./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-21.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-21.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 134b13cd1b8ac1dc8abd325434d56d90d6a754291c767bced87290501af7bb0e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 17:13:26,482 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 17:13:26,541 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:26,548 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 17:13:26,548 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 17:13:26,568 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 17:13:26,570 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 17:13:26,570 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 17:13:26,571 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 17:13:26,573 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 17:13:26,574 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 17:13:26,574 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 17:13:26,574 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 17:13:26,574 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 17:13:26,575 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 17:13:26,575 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 17:13:26,575 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 17:13:26,575 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 17:13:26,575 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 17:13:26,577 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 17:13:26,577 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 17:13:26,577 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 17:13:26,577 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 17:13:26,577 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 17:13:26,578 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 17:13:26,578 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 17:13:26,578 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 17:13:26,578 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 17:13:26,578 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 17:13:26,578 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 17:13:26,579 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 17:13:26,579 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 17:13:26,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:13:26,579 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 17:13:26,579 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 17:13:26,579 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 17:13:26,580 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 17:13:26,580 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 17:13:26,580 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 17:13:26,580 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 17:13:26,580 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 17:13:26,581 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 17:13:26,581 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 -> 134b13cd1b8ac1dc8abd325434d56d90d6a754291c767bced87290501af7bb0e [2024-11-16 17:13:26,760 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 17:13:26,779 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 17:13:26,782 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 17:13:26,783 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 17:13:26,783 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 17:13:26,784 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-21.i [2024-11-16 17:13:27,971 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 17:13:28,142 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 17:13:28,143 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-21.i [2024-11-16 17:13:28,148 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b36abcb91/b7b620b6e4114d5f99c1c9ed499ac0ea/FLAG8d6df0c36 [2024-11-16 17:13:28,159 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b36abcb91/b7b620b6e4114d5f99c1c9ed499ac0ea [2024-11-16 17:13:28,160 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 17:13:28,161 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 17:13:28,162 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 17:13:28,162 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 17:13:28,167 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 17:13:28,168 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:13:28" (1/1) ... [2024-11-16 17:13:28,168 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65162f14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:28, skipping insertion in model container [2024-11-16 17:13:28,169 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:13:28" (1/1) ... [2024-11-16 17:13:28,183 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 17:13:28,308 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-21.i[915,928] [2024-11-16 17:13:28,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:13:28,339 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 17:13:28,348 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-21.i[915,928] [2024-11-16 17:13:28,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:13:28,371 INFO L204 MainTranslator]: Completed translation [2024-11-16 17:13:28,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:28 WrapperNode [2024-11-16 17:13:28,371 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 17:13:28,372 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 17:13:28,372 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 17:13:28,372 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 17:13:28,377 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:28" (1/1) ... [2024-11-16 17:13:28,382 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:28" (1/1) ... [2024-11-16 17:13:28,399 INFO L138 Inliner]: procedures = 26, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 81 [2024-11-16 17:13:28,400 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 17:13:28,400 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 17:13:28,400 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 17:13:28,400 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 17:13:28,408 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:28" (1/1) ... [2024-11-16 17:13:28,408 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:28" (1/1) ... [2024-11-16 17:13:28,412 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:28" (1/1) ... [2024-11-16 17:13:28,428 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:28,429 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:28" (1/1) ... [2024-11-16 17:13:28,429 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:28" (1/1) ... [2024-11-16 17:13:28,432 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:28" (1/1) ... [2024-11-16 17:13:28,434 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:28" (1/1) ... [2024-11-16 17:13:28,435 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:28" (1/1) ... [2024-11-16 17:13:28,436 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:28" (1/1) ... [2024-11-16 17:13:28,437 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 17:13:28,438 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 17:13:28,438 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 17:13:28,438 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 17:13:28,440 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:28" (1/1) ... [2024-11-16 17:13:28,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:13:28,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 17:13:28,466 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:28,468 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:28,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 17:13:28,507 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 17:13:28,508 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 17:13:28,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 17:13:28,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 17:13:28,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 17:13:28,564 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 17:13:28,566 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 17:13:28,730 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L56: havoc property_#t~bitwise8#1; [2024-11-16 17:13:28,742 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-16 17:13:28,742 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 17:13:28,769 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 17:13:28,769 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 17:13:28,769 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:13:28 BoogieIcfgContainer [2024-11-16 17:13:28,770 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 17:13:28,771 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 17:13:28,771 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 17:13:28,775 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 17:13:28,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 05:13:28" (1/3) ... [2024-11-16 17:13:28,776 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5705ceca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:13:28, skipping insertion in model container [2024-11-16 17:13:28,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:28" (2/3) ... [2024-11-16 17:13:28,776 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5705ceca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:13:28, skipping insertion in model container [2024-11-16 17:13:28,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:13:28" (3/3) ... [2024-11-16 17:13:28,777 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-21.i [2024-11-16 17:13:28,789 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 17:13:28,789 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 17:13:28,829 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 17:13:28,835 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;@4bfffef1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 17:13:28,835 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 17:13:28,838 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-16 17:13:28,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-16 17:13:28,844 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:13:28,845 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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:28,846 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:13:28,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:13:28,851 INFO L85 PathProgramCache]: Analyzing trace with hash 293430448, now seen corresponding path program 1 times [2024-11-16 17:13:28,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:13:28,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266683804] [2024-11-16 17:13:28,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:13:28,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:13:28,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:29,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:13:29,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:29,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:13:29,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:29,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 17:13:29,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:29,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:13:29,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:29,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 17:13:29,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:29,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:13:29,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:29,081 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-16 17:13:29,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:13:29,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266683804] [2024-11-16 17:13:29,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266683804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:13:29,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:13:29,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 17:13:29,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772695205] [2024-11-16 17:13:29,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:13:29,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 17:13:29,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:13:29,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 17:13:29,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 17:13:29,108 INFO L87 Difference]: Start difference. First operand has 40 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-16 17:13:29,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:13:29,134 INFO L93 Difference]: Finished difference Result 72 states and 105 transitions. [2024-11-16 17:13:29,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 17:13:29,137 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 49 [2024-11-16 17:13:29,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:13:29,142 INFO L225 Difference]: With dead ends: 72 [2024-11-16 17:13:29,142 INFO L226 Difference]: Without dead ends: 35 [2024-11-16 17:13:29,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 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:29,148 INFO L432 NwaCegarLoop]: 43 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, 43 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 17:13:29,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 17:13:29,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-16 17:13:29,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-16 17:13:29,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-16 17:13:29,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2024-11-16 17:13:29,203 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 49 [2024-11-16 17:13:29,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:13:29,204 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2024-11-16 17:13:29,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-16 17:13:29,204 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2024-11-16 17:13:29,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-16 17:13:29,207 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:13:29,207 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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:29,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 17:13:29,207 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:13:29,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:13:29,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1962245456, now seen corresponding path program 1 times [2024-11-16 17:13:29,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:13:29,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133161059] [2024-11-16 17:13:29,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:13:29,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:13:29,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 17:13:29,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [3310722] [2024-11-16 17:13:29,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:13:29,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 17:13:29,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 17:13:29,286 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 17:13:29,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 17:13:29,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 17:13:29,361 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 17:13:29,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 17:13:29,413 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 17:13:29,414 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 17:13:29,415 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 17:13:29,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 17:13:29,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 17:13:29,620 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-16 17:13:29,648 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 17:13:29,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 05:13:29 BoogieIcfgContainer [2024-11-16 17:13:29,652 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 17:13:29,652 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 17:13:29,652 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 17:13:29,652 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 17:13:29,653 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:28" (3/4) ... [2024-11-16 17:13:29,654 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 17:13:29,655 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 17:13:29,656 INFO L158 Benchmark]: Toolchain (without parser) took 1494.44ms. Allocated memory is still 165.7MB. Free memory was 131.7MB in the beginning and 115.8MB in the end (delta: 15.9MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. [2024-11-16 17:13:29,656 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 121.6MB. Free memory was 81.5MB in the beginning and 81.4MB in the end (delta: 119.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 17:13:29,656 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.43ms. Allocated memory is still 165.7MB. Free memory was 131.7MB in the beginning and 118.3MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 17:13:29,660 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.44ms. Allocated memory is still 165.7MB. Free memory was 118.3MB in the beginning and 116.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 17:13:29,661 INFO L158 Benchmark]: Boogie Preprocessor took 37.44ms. Allocated memory is still 165.7MB. Free memory was 116.2MB in the beginning and 114.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 17:13:29,661 INFO L158 Benchmark]: IcfgBuilder took 331.69ms. Allocated memory is still 165.7MB. Free memory was 114.1MB in the beginning and 97.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-16 17:13:29,661 INFO L158 Benchmark]: TraceAbstraction took 880.48ms. Allocated memory is still 165.7MB. Free memory was 97.3MB in the beginning and 116.9MB in the end (delta: -19.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 17:13:29,661 INFO L158 Benchmark]: Witness Printer took 3.22ms. Allocated memory is still 165.7MB. Free memory was 116.9MB in the beginning and 115.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 17:13:29,663 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.13ms. Allocated memory is still 121.6MB. Free memory was 81.5MB in the beginning and 81.4MB in the end (delta: 119.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 209.43ms. Allocated memory is still 165.7MB. Free memory was 131.7MB in the beginning and 118.3MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.44ms. Allocated memory is still 165.7MB. Free memory was 118.3MB in the beginning and 116.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.44ms. Allocated memory is still 165.7MB. Free memory was 116.2MB in the beginning and 114.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 331.69ms. Allocated memory is still 165.7MB. Free memory was 114.1MB in the beginning and 97.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 880.48ms. Allocated memory is still 165.7MB. Free memory was 97.3MB in the beginning and 116.9MB in the end (delta: -19.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.22ms. Allocated memory is still 165.7MB. Free memory was 116.9MB in the beginning and 115.8MB in the end (delta: 1.0MB). There was no memory consumed. 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 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 56. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -16; [L23] signed long int var_1_6 = 10; [L24] unsigned char var_1_8 = 0; [L25] unsigned char var_1_9 = 4; [L26] float var_1_10 = 15.5; [L27] float var_1_11 = 99.125; [L28] signed short int var_1_12 = 2; [L29] signed long int last_1_var_1_1 = -16; VAL [isInitial=0, last_1_var_1_1=-16, var_1_10=31/2, var_1_11=793/8, var_1_12=2, var_1_1=-16, var_1_6=10, var_1_8=0, var_1_9=4] [L60] isInitial = 1 [L61] FCALL initially() [L62] COND TRUE 1 [L63] CALL updateLastVariables() [L53] last_1_var_1_1 = var_1_1 VAL [isInitial=1, last_1_var_1_1=-16, var_1_10=31/2, var_1_11=793/8, var_1_12=2, var_1_1=-16, var_1_6=10, var_1_8=0, var_1_9=4] [L63] RET updateLastVariables() [L64] CALL updateVariables() [L42] var_1_6 = __VERIFIER_nondet_long() [L43] CALL assume_abort_if_not(var_1_6 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_10=31/2, var_1_11=793/8, var_1_12=2, var_1_1=-16, var_1_6=-1, var_1_8=0, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_10=31/2, var_1_11=793/8, var_1_12=2, var_1_1=-16, var_1_6=-1, var_1_8=0, var_1_9=4] [L43] RET assume_abort_if_not(var_1_6 >= -2147483648) VAL [isInitial=1, last_1_var_1_1=-16, var_1_10=31/2, var_1_11=793/8, var_1_12=2, var_1_1=-16, var_1_6=-1, var_1_8=0, var_1_9=4] [L44] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_10=31/2, var_1_11=793/8, var_1_12=2, var_1_1=-16, var_1_6=-1, var_1_8=0, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_10=31/2, var_1_11=793/8, var_1_12=2, var_1_1=-16, var_1_6=-1, var_1_8=0, var_1_9=4] [L44] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, last_1_var_1_1=-16, var_1_10=31/2, var_1_11=793/8, var_1_12=2, var_1_1=-16, var_1_6=-1, var_1_8=0, var_1_9=4] [L45] CALL assume_abort_if_not(var_1_6 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_10=31/2, var_1_11=793/8, var_1_12=2, var_1_1=-16, var_1_6=-1, var_1_8=0, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_10=31/2, var_1_11=793/8, var_1_12=2, var_1_1=-16, var_1_6=-1, var_1_8=0, var_1_9=4] [L45] RET assume_abort_if_not(var_1_6 != 0) VAL [isInitial=1, last_1_var_1_1=-16, var_1_10=31/2, var_1_11=793/8, var_1_12=2, var_1_1=-16, var_1_6=-1, var_1_8=0, var_1_9=4] [L46] var_1_9 = __VERIFIER_nondet_uchar() [L47] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_10=31/2, var_1_11=793/8, var_1_12=2, var_1_1=-16, var_1_6=-1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_10=31/2, var_1_11=793/8, var_1_12=2, var_1_1=-16, var_1_6=-1, var_1_8=0] [L47] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_1=-16, var_1_10=31/2, var_1_11=793/8, var_1_12=2, var_1_1=-16, var_1_6=-1, var_1_8=0] [L48] CALL assume_abort_if_not(var_1_9 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_10=31/2, var_1_11=793/8, var_1_12=2, var_1_1=-16, var_1_6=-1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_10=31/2, var_1_11=793/8, var_1_12=2, var_1_1=-16, var_1_6=-1, var_1_8=0, var_1_9=0] [L48] RET assume_abort_if_not(var_1_9 <= 254) VAL [isInitial=1, last_1_var_1_1=-16, var_1_10=31/2, var_1_11=793/8, var_1_12=2, var_1_1=-16, var_1_6=-1, var_1_8=0, var_1_9=0] [L49] var_1_11 = __VERIFIER_nondet_float() [L50] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_10=31/2, var_1_12=2, var_1_1=-16, var_1_6=-1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_10=31/2, var_1_12=2, var_1_1=-16, var_1_6=-1, var_1_8=0, var_1_9=0] [L50] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-16, var_1_10=31/2, var_1_12=2, var_1_1=-16, var_1_6=-1, var_1_8=0, var_1_9=0] [L64] RET updateVariables() [L65] CALL step() [L33] var_1_8 = var_1_9 [L34] var_1_10 = var_1_11 [L35] var_1_12 = var_1_9 VAL [isInitial=1, last_1_var_1_1=-16, var_1_10=2, var_1_11=2, var_1_12=0, var_1_1=-16, var_1_6=-1, var_1_8=0, var_1_9=0] [L36] EXPR var_1_8 & (var_1_12 * var_1_8) VAL [isInitial=1, last_1_var_1_1=-16, var_1_10=2, var_1_11=2, var_1_12=0, var_1_1=-16, var_1_6=-1, var_1_8=0, var_1_9=0] [L36] signed long int stepLocal_0 = var_1_8 & (var_1_12 * var_1_8); [L37] COND TRUE stepLocal_0 < (last_1_var_1_1 / var_1_6) [L38] var_1_1 = (var_1_8 + 256) VAL [isInitial=1, last_1_var_1_1=-16, var_1_10=2, var_1_11=2, var_1_12=0, var_1_1=256, var_1_6=-1, var_1_8=0, var_1_9=0] [L65] RET step() [L66] CALL, EXPR property() [L56] EXPR var_1_8 & (var_1_12 * var_1_8) VAL [isInitial=1, last_1_var_1_1=-16, var_1_10=2, var_1_11=2, var_1_12=0, var_1_1=256, var_1_6=-1, var_1_8=0, var_1_9=0] [L56-L57] return (((((var_1_8 & (var_1_12 * var_1_8)) < (last_1_var_1_1 / var_1_6)) ? (var_1_1 == ((signed long int) (var_1_8 + 256))) : 1) && (var_1_8 == ((unsigned char) var_1_9))) && (var_1_10 == ((float) var_1_11))) && (var_1_12 == ((signed short int) var_1_9)) ; [L66] RET, EXPR property() [L66] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=-16, var_1_10=2, var_1_11=2, var_1_12=0, var_1_1=256, var_1_6=-1, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=-16, var_1_10=2, var_1_11=2, var_1_12=0, var_1_1=256, var_1_6=-1, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 43 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2 IncrementalHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 43 mSDtfsCounter, 2 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=0, InterpolantAutomatonStates: 2, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 147 NumberOfCodeBlocks, 147 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 48 ConstructedInterpolants, 0 QuantifiedInterpolants, 48 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 60/60 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-16 17:13:29,688 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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-21.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 134b13cd1b8ac1dc8abd325434d56d90d6a754291c767bced87290501af7bb0e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 17:13:31,430 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 17:13:31,486 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 17:13:31,490 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 17:13:31,490 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 17:13:31,513 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 17:13:31,514 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 17:13:31,514 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 17:13:31,515 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 17:13:31,518 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 17:13:31,518 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 17:13:31,518 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 17:13:31,518 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 17:13:31,518 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 17:13:31,519 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 17:13:31,519 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 17:13:31,519 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 17:13:31,519 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 17:13:31,519 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 17:13:31,519 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 17:13:31,520 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 17:13:31,521 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 17:13:31,521 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 17:13:31,522 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 17:13:31,522 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 17:13:31,523 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 17:13:31,523 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 17:13:31,523 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 17:13:31,523 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 17:13:31,523 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 17:13:31,524 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 17:13:31,524 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 17:13:31,524 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 17:13:31,524 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 17:13:31,524 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:13:31,525 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 17:13:31,525 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 17:13:31,525 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 17:13:31,525 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 17:13:31,525 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 17:13:31,525 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 17:13:31,526 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 17:13:31,526 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 17:13:31,526 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 17:13:31,526 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 -> 134b13cd1b8ac1dc8abd325434d56d90d6a754291c767bced87290501af7bb0e [2024-11-16 17:13:31,769 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 17:13:31,784 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 17:13:31,787 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 17:13:31,788 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 17:13:31,788 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 17:13:31,789 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-21.i [2024-11-16 17:13:33,002 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 17:13:33,170 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 17:13:33,170 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-21.i [2024-11-16 17:13:33,176 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b4ed8c1d/353e0a1d3476422088f530dff5479fbc/FLAG59279b1e4 [2024-11-16 17:13:33,575 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b4ed8c1d/353e0a1d3476422088f530dff5479fbc [2024-11-16 17:13:33,577 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 17:13:33,578 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 17:13:33,579 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 17:13:33,579 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 17:13:33,583 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 17:13:33,583 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:13:33" (1/1) ... [2024-11-16 17:13:33,584 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41b3f5a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:33, skipping insertion in model container [2024-11-16 17:13:33,584 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:13:33" (1/1) ... [2024-11-16 17:13:33,597 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 17:13:33,738 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-21.i[915,928] [2024-11-16 17:13:33,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:13:33,779 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 17:13:33,790 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-21.i[915,928] [2024-11-16 17:13:33,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:13:33,820 INFO L204 MainTranslator]: Completed translation [2024-11-16 17:13:33,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:33 WrapperNode [2024-11-16 17:13:33,821 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 17:13:33,821 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 17:13:33,822 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 17:13:33,822 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 17:13:33,826 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:33" (1/1) ... [2024-11-16 17:13:33,840 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:33" (1/1) ... [2024-11-16 17:13:33,856 INFO L138 Inliner]: procedures = 27, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 63 [2024-11-16 17:13:33,857 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 17:13:33,858 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 17:13:33,858 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 17:13:33,858 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 17:13:33,866 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:33" (1/1) ... [2024-11-16 17:13:33,866 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:33" (1/1) ... [2024-11-16 17:13:33,870 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:33" (1/1) ... [2024-11-16 17:13:33,884 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:33,884 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:33" (1/1) ... [2024-11-16 17:13:33,884 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:33" (1/1) ... [2024-11-16 17:13:33,890 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:33" (1/1) ... [2024-11-16 17:13:33,895 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:33" (1/1) ... [2024-11-16 17:13:33,896 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:33" (1/1) ... [2024-11-16 17:13:33,900 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:33" (1/1) ... [2024-11-16 17:13:33,902 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 17:13:33,902 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 17:13:33,905 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 17:13:33,905 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 17:13:33,906 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:33" (1/1) ... [2024-11-16 17:13:33,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:13:33,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 17:13:33,934 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:33,939 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:33,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 17:13:33,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 17:13:33,985 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 17:13:33,985 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 17:13:33,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 17:13:33,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 17:13:34,049 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 17:13:34,051 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 17:13:34,262 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-16 17:13:34,263 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 17:13:34,272 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 17:13:34,273 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 17:13:34,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:13:34 BoogieIcfgContainer [2024-11-16 17:13:34,274 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 17:13:34,276 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 17:13:34,276 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 17:13:34,278 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 17:13:34,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 05:13:33" (1/3) ... [2024-11-16 17:13:34,280 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2519cc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:13:34, skipping insertion in model container [2024-11-16 17:13:34,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:33" (2/3) ... [2024-11-16 17:13:34,281 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2519cc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:13:34, skipping insertion in model container [2024-11-16 17:13:34,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:13:34" (3/3) ... [2024-11-16 17:13:34,282 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-21.i [2024-11-16 17:13:34,294 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 17:13:34,295 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 17:13:34,343 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 17:13:34,348 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;@5539efd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 17:13:34,348 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 17:13:34,351 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-16 17:13:34,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-16 17:13:34,356 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:13:34,356 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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:34,357 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:13:34,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:13:34,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1576928573, now seen corresponding path program 1 times [2024-11-16 17:13:34,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 17:13:34,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2005310445] [2024-11-16 17:13:34,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:13:34,369 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 17:13:34,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 17:13:34,371 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 17:13:34,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-16 17:13:34,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:34,475 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 17:13:34,480 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:13:34,505 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-16 17:13:34,505 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 17:13:34,505 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 17:13:34,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2005310445] [2024-11-16 17:13:34,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2005310445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:13:34,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:13:34,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 17:13:34,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487519029] [2024-11-16 17:13:34,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:13:34,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 17:13:34,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 17:13:34,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 17:13:34,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 17:13:34,531 INFO L87 Difference]: Start difference. First operand has 32 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-16 17:13:34,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:13:34,543 INFO L93 Difference]: Finished difference Result 56 states and 81 transitions. [2024-11-16 17:13:34,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 17:13:34,545 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 45 [2024-11-16 17:13:34,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:13:34,549 INFO L225 Difference]: With dead ends: 56 [2024-11-16 17:13:34,549 INFO L226 Difference]: Without dead ends: 27 [2024-11-16 17:13:34,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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:34,566 INFO L432 NwaCegarLoop]: 33 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, 33 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:34,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 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:34,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-16 17:13:34,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-16 17:13:34,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-16 17:13:34,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2024-11-16 17:13:34,595 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 45 [2024-11-16 17:13:34,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:13:34,595 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2024-11-16 17:13:34,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-16 17:13:34,595 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2024-11-16 17:13:34,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-16 17:13:34,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:13:34,598 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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:34,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-16 17:13:34,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 17:13:34,799 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:13:34,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:13:34,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1503617891, now seen corresponding path program 1 times [2024-11-16 17:13:34,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 17:13:34,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1449438371] [2024-11-16 17:13:34,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:13:34,802 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 17:13:34,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 17:13:34,803 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 17:13:34,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-16 17:13:34,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:34,922 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-16 17:13:34,928 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:13:35,443 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-16 17:13:35,443 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 17:13:35,444 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 17:13:35,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1449438371] [2024-11-16 17:13:35,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1449438371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:13:35,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:13:35,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 17:13:35,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846230671] [2024-11-16 17:13:35,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:13:35,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 17:13:35,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 17:13:35,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 17:13:35,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-16 17:13:35,449 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-16 17:13:36,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:13:36,323 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2024-11-16 17:13:36,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-16 17:13:36,324 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 45 [2024-11-16 17:13:36,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:13:36,325 INFO L225 Difference]: With dead ends: 66 [2024-11-16 17:13:36,325 INFO L226 Difference]: Without dead ends: 63 [2024-11-16 17:13:36,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=156, Invalid=396, Unknown=0, NotChecked=0, Total=552 [2024-11-16 17:13:36,327 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 62 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 17:13:36,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 132 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 17:13:36,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-16 17:13:36,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2024-11-16 17:13:36,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 31 states have (on average 1.064516129032258) internal successors, (33), 32 states have internal predecessors, (33), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-16 17:13:36,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2024-11-16 17:13:36,342 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 45 [2024-11-16 17:13:36,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:13:36,343 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2024-11-16 17:13:36,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-16 17:13:36,343 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2024-11-16 17:13:36,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-16 17:13:36,344 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:13:36,344 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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:36,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-16 17:13:36,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 17:13:36,545 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:13:36,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:13:36,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1532247042, now seen corresponding path program 1 times [2024-11-16 17:13:36,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 17:13:36,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1174166136] [2024-11-16 17:13:36,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:13:36,546 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 17:13:36,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 17:13:36,549 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 17:13:36,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-16 17:13:36,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:36,624 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-16 17:13:36,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:13:38,016 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 42 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 17:13:38,017 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 17:13:40,278 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-16 17:13:40,278 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 17:13:40,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1174166136] [2024-11-16 17:13:40,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1174166136] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-16 17:13:40,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 17:13:40,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 21 [2024-11-16 17:13:40,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160340402] [2024-11-16 17:13:40,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:13:40,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 17:13:40,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 17:13:40,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 17:13:40,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2024-11-16 17:13:40,280 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-16 17:13:41,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:13:41,995 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2024-11-16 17:13:41,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 17:13:41,998 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 45 [2024-11-16 17:13:41,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:13:41,998 INFO L225 Difference]: With dead ends: 52 [2024-11-16 17:13:41,998 INFO L226 Difference]: Without dead ends: 0 [2024-11-16 17:13:41,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=110, Invalid=442, Unknown=0, NotChecked=0, Total=552 [2024-11-16 17:13:41,999 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 24 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-16 17:13:42,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 79 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-16 17:13:42,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-16 17:13:42,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-16 17:13:42,000 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:42,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-16 17:13:42,001 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2024-11-16 17:13:42,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:13:42,001 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-16 17:13:42,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-16 17:13:42,001 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-16 17:13:42,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-16 17:13:42,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 17:13:42,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-16 17:13:42,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 17:13:42,207 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-16 17:13:42,208 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-16 17:13:43,859 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 17:13:43,884 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-16 17:13:43,884 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-16 17:13:43,901 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-16 17:13:43,901 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-16 17:13:43,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 05:13:43 BoogieIcfgContainer [2024-11-16 17:13:43,910 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 17:13:43,910 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 17:13:43,910 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 17:13:43,910 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 17:13:43,911 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:34" (3/4) ... [2024-11-16 17:13:43,915 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-16 17:13:43,918 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-16 17:13:43,920 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2024-11-16 17:13:43,921 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-16 17:13:43,921 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-16 17:13:43,921 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-16 17:13:43,981 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 17:13:43,982 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-16 17:13:43,982 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 17:13:43,982 INFO L158 Benchmark]: Toolchain (without parser) took 10403.98ms. Allocated memory was 81.8MB in the beginning and 109.1MB in the end (delta: 27.3MB). Free memory was 56.3MB in the beginning and 79.9MB in the end (delta: -23.6MB). Peak memory consumption was 1.2MB. Max. memory is 16.1GB. [2024-11-16 17:13:43,982 INFO L158 Benchmark]: CDTParser took 0.70ms. Allocated memory is still 50.3MB. Free memory is still 26.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 17:13:43,983 INFO L158 Benchmark]: CACSL2BoogieTranslator took 241.83ms. Allocated memory is still 81.8MB. Free memory was 56.0MB in the beginning and 42.6MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 17:13:43,983 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.57ms. Allocated memory is still 81.8MB. Free memory was 42.3MB in the beginning and 40.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 17:13:43,984 INFO L158 Benchmark]: Boogie Preprocessor took 44.35ms. Allocated memory is still 81.8MB. Free memory was 40.8MB in the beginning and 38.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 17:13:43,984 INFO L158 Benchmark]: IcfgBuilder took 371.27ms. Allocated memory is still 81.8MB. Free memory was 38.7MB in the beginning and 50.8MB in the end (delta: -12.1MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. [2024-11-16 17:13:43,984 INFO L158 Benchmark]: TraceAbstraction took 9633.81ms. Allocated memory was 81.8MB in the beginning and 109.1MB in the end (delta: 27.3MB). Free memory was 50.2MB in the beginning and 85.3MB in the end (delta: -35.0MB). Peak memory consumption was 45.6MB. Max. memory is 16.1GB. [2024-11-16 17:13:43,984 INFO L158 Benchmark]: Witness Printer took 71.64ms. Allocated memory is still 109.1MB. Free memory was 85.3MB in the beginning and 79.9MB in the end (delta: 5.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 17:13:43,985 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.70ms. Allocated memory is still 50.3MB. Free memory is still 26.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 241.83ms. Allocated memory is still 81.8MB. Free memory was 56.0MB in the beginning and 42.6MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.57ms. Allocated memory is still 81.8MB. Free memory was 42.3MB in the beginning and 40.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.35ms. Allocated memory is still 81.8MB. Free memory was 40.8MB in the beginning and 38.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 371.27ms. Allocated memory is still 81.8MB. Free memory was 38.7MB in the beginning and 50.8MB in the end (delta: -12.1MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. * TraceAbstraction took 9633.81ms. Allocated memory was 81.8MB in the beginning and 109.1MB in the end (delta: 27.3MB). Free memory was 50.2MB in the beginning and 85.3MB in the end (delta: -35.0MB). Peak memory consumption was 45.6MB. Max. memory is 16.1GB. * Witness Printer took 71.64ms. Allocated memory is still 109.1MB. Free memory was 85.3MB in the beginning and 79.9MB in the end (delta: 5.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven * 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, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.9s, OverallIterations: 3, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 87 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 86 mSDsluCounter, 244 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 162 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 251 IncrementalHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 82 mSDtfsCounter, 251 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 193 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=2, InterpolantAutomatonStates: 30, 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, 19 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 176 ConstructedInterpolants, 4 QuantifiedInterpolants, 1246 SizeOfPredicates, 20 NumberOfNonLiveVariables, 251 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 234/240 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: 62]: 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: ((0 != cond) && (((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_6 == \old(var_1_6))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11))) && (var_1_12 == \old(var_1_12))) && (last_1_var_1_1 == \old(last_1_var_1_1)))) RESULT: Ultimate proved your program to be correct! [2024-11-16 17:13:44,014 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