./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-4.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 087f53d60a69a89d74f854e09dec49f6677e36a3379c1213b60b4862ed153ba1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 08:17:12,758 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 08:17:12,831 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 08:17:12,837 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 08:17:12,838 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 08:17:12,873 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 08:17:12,873 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 08:17:12,874 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 08:17:12,875 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 08:17:12,879 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 08:17:12,879 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 08:17:12,879 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 08:17:12,880 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 08:17:12,880 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 08:17:12,881 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 08:17:12,881 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 08:17:12,881 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 08:17:12,881 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 08:17:12,882 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 08:17:12,882 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 08:17:12,882 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 08:17:12,884 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 08:17:12,884 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 08:17:12,885 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 08:17:12,885 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 08:17:12,885 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 08:17:12,885 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 08:17:12,886 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 08:17:12,886 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 08:17:12,886 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 08:17:12,886 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 08:17:12,887 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 08:17:12,887 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:17:12,887 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 08:17:12,887 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 08:17:12,888 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 08:17:12,888 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 08:17:12,889 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 08:17:12,889 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 08:17:12,890 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 08:17:12,890 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 08:17:12,890 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 08:17:12,890 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 -> 087f53d60a69a89d74f854e09dec49f6677e36a3379c1213b60b4862ed153ba1 [2024-11-10 08:17:13,165 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 08:17:13,195 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 08:17:13,198 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 08:17:13,199 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 08:17:13,200 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 08:17:13,201 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-4.i [2024-11-10 08:17:14,688 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 08:17:14,911 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 08:17:14,911 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-4.i [2024-11-10 08:17:14,923 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b4085693/169d622fc59e4c399f1b015f3a5ef77c/FLAG508157964 [2024-11-10 08:17:14,941 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b4085693/169d622fc59e4c399f1b015f3a5ef77c [2024-11-10 08:17:14,944 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 08:17:14,948 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 08:17:14,951 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 08:17:14,952 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 08:17:14,958 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 08:17:14,959 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:17:14" (1/1) ... [2024-11-10 08:17:14,960 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52ebcf81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:14, skipping insertion in model container [2024-11-10 08:17:14,960 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:17:14" (1/1) ... [2024-11-10 08:17:14,982 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 08:17:15,162 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-4.i[914,927] [2024-11-10 08:17:15,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:17:15,207 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 08:17:15,220 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-4.i[914,927] [2024-11-10 08:17:15,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:17:15,270 INFO L204 MainTranslator]: Completed translation [2024-11-10 08:17:15,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:15 WrapperNode [2024-11-10 08:17:15,271 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 08:17:15,272 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 08:17:15,272 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 08:17:15,273 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 08:17:15,280 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:15" (1/1) ... [2024-11-10 08:17:15,292 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:15" (1/1) ... [2024-11-10 08:17:15,319 INFO L138 Inliner]: procedures = 26, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 67 [2024-11-10 08:17:15,328 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 08:17:15,330 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 08:17:15,330 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 08:17:15,330 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 08:17:15,341 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:15" (1/1) ... [2024-11-10 08:17:15,341 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:15" (1/1) ... [2024-11-10 08:17:15,343 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:15" (1/1) ... [2024-11-10 08:17:15,356 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 08:17:15,356 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:15" (1/1) ... [2024-11-10 08:17:15,359 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:15" (1/1) ... [2024-11-10 08:17:15,365 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:15" (1/1) ... [2024-11-10 08:17:15,366 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:15" (1/1) ... [2024-11-10 08:17:15,371 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:15" (1/1) ... [2024-11-10 08:17:15,372 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:15" (1/1) ... [2024-11-10 08:17:15,373 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 08:17:15,374 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 08:17:15,374 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 08:17:15,374 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 08:17:15,379 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:15" (1/1) ... [2024-11-10 08:17:15,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:17:15,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:17:15,421 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 08:17:15,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 08:17:15,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 08:17:15,481 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 08:17:15,481 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 08:17:15,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 08:17:15,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 08:17:15,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 08:17:15,560 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 08:17:15,563 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 08:17:15,746 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-10 08:17:15,746 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 08:17:15,763 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 08:17:15,764 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 08:17:15,764 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:17:15 BoogieIcfgContainer [2024-11-10 08:17:15,764 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 08:17:15,767 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 08:17:15,767 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 08:17:15,772 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 08:17:15,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:17:14" (1/3) ... [2024-11-10 08:17:15,773 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c5f3d59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:17:15, skipping insertion in model container [2024-11-10 08:17:15,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:15" (2/3) ... [2024-11-10 08:17:15,775 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c5f3d59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:17:15, skipping insertion in model container [2024-11-10 08:17:15,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:17:15" (3/3) ... [2024-11-10 08:17:15,776 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-4.i [2024-11-10 08:17:15,796 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 08:17:15,796 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 08:17:15,850 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 08:17:15,856 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;@35d89b71, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 08:17:15,857 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 08:17:15,861 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 25 states have (on average 1.24) internal successors, (31), 26 states have internal predecessors, (31), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 08:17:15,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-10 08:17:15,870 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:17:15,871 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:17:15,872 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:17:15,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:17:15,876 INFO L85 PathProgramCache]: Analyzing trace with hash -699217210, now seen corresponding path program 1 times [2024-11-10 08:17:15,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:17:15,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470692959] [2024-11-10 08:17:15,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:17:15,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:17:16,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:16,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:17:16,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:16,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:17:16,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:16,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:17:16,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:16,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:17:16,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:16,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:17:16,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:16,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:17:16,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:16,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:17:16,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:16,171 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-10 08:17:16,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:17:16,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470692959] [2024-11-10 08:17:16,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470692959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:17:16,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:17:16,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 08:17:16,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74910423] [2024-11-10 08:17:16,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:17:16,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 08:17:16,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:17:16,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 08:17:16,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:17:16,211 INFO L87 Difference]: Start difference. First operand has 35 states, 25 states have (on average 1.24) internal successors, (31), 26 states have internal predecessors, (31), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-10 08:17:16,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:17:16,236 INFO L93 Difference]: Finished difference Result 62 states and 90 transitions. [2024-11-10 08:17:16,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 08:17:16,238 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 52 [2024-11-10 08:17:16,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:17:16,244 INFO L225 Difference]: With dead ends: 62 [2024-11-10 08:17:16,244 INFO L226 Difference]: Without dead ends: 30 [2024-11-10 08:17:16,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:17:16,250 INFO L432 NwaCegarLoop]: 37 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, 37 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 08:17:16,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:17:16,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-10 08:17:16,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-10 08:17:16,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 08:17:16,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2024-11-10 08:17:16,286 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 52 [2024-11-10 08:17:16,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:17:16,286 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-11-10 08:17:16,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-10 08:17:16,287 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2024-11-10 08:17:16,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-10 08:17:16,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:17:16,290 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:17:16,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 08:17:16,290 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:17:16,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:17:16,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1023228455, now seen corresponding path program 1 times [2024-11-10 08:17:16,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:17:16,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094176074] [2024-11-10 08:17:16,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:17:16,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:17:16,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 08:17:16,376 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 08:17:16,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 08:17:16,480 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 08:17:16,480 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 08:17:16,481 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 08:17:16,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 08:17:16,485 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-10 08:17:16,529 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 08:17:16,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 08:17:16 BoogieIcfgContainer [2024-11-10 08:17:16,533 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 08:17:16,534 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 08:17:16,535 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 08:17:16,535 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 08:17:16,535 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:17:15" (3/4) ... [2024-11-10 08:17:16,537 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 08:17:16,538 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 08:17:16,539 INFO L158 Benchmark]: Toolchain (without parser) took 1591.19ms. Allocated memory was 125.8MB in the beginning and 163.6MB in the end (delta: 37.7MB). Free memory was 71.0MB in the beginning and 86.2MB in the end (delta: -15.1MB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. [2024-11-10 08:17:16,540 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 125.8MB. Free memory was 86.9MB in the beginning and 86.8MB in the end (delta: 134.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:17:16,540 INFO L158 Benchmark]: CACSL2BoogieTranslator took 320.29ms. Allocated memory is still 125.8MB. Free memory was 70.9MB in the beginning and 98.8MB in the end (delta: -27.9MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. [2024-11-10 08:17:16,541 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.64ms. Allocated memory was 125.8MB in the beginning and 163.6MB in the end (delta: 37.7MB). Free memory was 98.7MB in the beginning and 137.5MB in the end (delta: -38.8MB). Peak memory consumption was 2.5MB. Max. memory is 16.1GB. [2024-11-10 08:17:16,541 INFO L158 Benchmark]: Boogie Preprocessor took 43.95ms. Allocated memory is still 163.6MB. Free memory was 137.5MB in the beginning and 136.5MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 08:17:16,542 INFO L158 Benchmark]: IcfgBuilder took 390.23ms. Allocated memory is still 163.6MB. Free memory was 136.5MB in the beginning and 123.9MB in the end (delta: 12.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-10 08:17:16,543 INFO L158 Benchmark]: TraceAbstraction took 766.88ms. Allocated memory is still 163.6MB. Free memory was 122.9MB in the beginning and 86.2MB in the end (delta: 36.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-10 08:17:16,543 INFO L158 Benchmark]: Witness Printer took 4.06ms. Allocated memory is still 163.6MB. Free memory is still 86.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:17:16,549 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.20ms. Allocated memory is still 125.8MB. Free memory was 86.9MB in the beginning and 86.8MB in the end (delta: 134.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 320.29ms. Allocated memory is still 125.8MB. Free memory was 70.9MB in the beginning and 98.8MB in the end (delta: -27.9MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.64ms. Allocated memory was 125.8MB in the beginning and 163.6MB in the end (delta: 37.7MB). Free memory was 98.7MB in the beginning and 137.5MB in the end (delta: -38.8MB). Peak memory consumption was 2.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.95ms. Allocated memory is still 163.6MB. Free memory was 137.5MB in the beginning and 136.5MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 390.23ms. Allocated memory is still 163.6MB. Free memory was 136.5MB in the beginning and 123.9MB in the end (delta: 12.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 766.88ms. Allocated memory is still 163.6MB. Free memory was 122.9MB in the beginning and 86.2MB in the end (delta: 36.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * Witness Printer took 4.06ms. Allocated memory is still 163.6MB. Free memory is still 86.2MB. 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 short int var_1_2 = 16; [L24] signed short int var_1_3 = 25; [L25] signed long int var_1_4 = -32; [L26] unsigned char var_1_5 = 1; [L27] float var_1_6 = 0.6599999999999999; [L28] float var_1_7 = 256.6; VAL [isInitial=0, var_1_1=-16, var_1_2=16, var_1_3=25, var_1_4=-32, var_1_5=1, var_1_6=6599999999999999/10000000000000000, var_1_7=1283/5] [L60] isInitial = 1 [L61] FCALL initially() [L62] COND TRUE 1 [L63] FCALL updateLastVariables() [L64] CALL updateVariables() [L41] var_1_2 = __VERIFIER_nondet_short() [L42] CALL assume_abort_if_not(var_1_2 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_1=-16, var_1_2=8, var_1_3=25, var_1_4=-32, var_1_5=1, var_1_6=6599999999999999/10000000000000000, var_1_7=1283/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-16, var_1_2=8, var_1_3=25, var_1_4=-32, var_1_5=1, var_1_6=6599999999999999/10000000000000000, var_1_7=1283/5] [L42] RET assume_abort_if_not(var_1_2 >= -32768) VAL [isInitial=1, var_1_1=-16, var_1_2=8, var_1_3=25, var_1_4=-32, var_1_5=1, var_1_6=6599999999999999/10000000000000000, var_1_7=1283/5] [L43] CALL assume_abort_if_not(var_1_2 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_1=-16, var_1_2=8, var_1_3=25, var_1_4=-32, var_1_5=1, var_1_6=6599999999999999/10000000000000000, var_1_7=1283/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-16, var_1_2=8, var_1_3=25, var_1_4=-32, var_1_5=1, var_1_6=6599999999999999/10000000000000000, var_1_7=1283/5] [L43] RET assume_abort_if_not(var_1_2 <= 32767) VAL [isInitial=1, var_1_1=-16, var_1_2=8, var_1_3=25, var_1_4=-32, var_1_5=1, var_1_6=6599999999999999/10000000000000000, var_1_7=1283/5] [L44] var_1_3 = __VERIFIER_nondet_short() [L45] CALL assume_abort_if_not(var_1_3 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_1=-16, var_1_2=8, var_1_3=4, var_1_4=-32, var_1_5=1, var_1_6=6599999999999999/10000000000000000, var_1_7=1283/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-16, var_1_2=8, var_1_3=4, var_1_4=-32, var_1_5=1, var_1_6=6599999999999999/10000000000000000, var_1_7=1283/5] [L45] RET assume_abort_if_not(var_1_3 >= -32768) VAL [isInitial=1, var_1_1=-16, var_1_2=8, var_1_3=4, var_1_4=-32, var_1_5=1, var_1_6=6599999999999999/10000000000000000, var_1_7=1283/5] [L46] CALL assume_abort_if_not(var_1_3 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_1=-16, var_1_2=8, var_1_3=4, var_1_4=-32, var_1_5=1, var_1_6=6599999999999999/10000000000000000, var_1_7=1283/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-16, var_1_2=8, var_1_3=4, var_1_4=-32, var_1_5=1, var_1_6=6599999999999999/10000000000000000, var_1_7=1283/5] [L46] RET assume_abort_if_not(var_1_3 <= 32767) VAL [isInitial=1, var_1_1=-16, var_1_2=8, var_1_3=4, var_1_4=-32, var_1_5=1, var_1_6=6599999999999999/10000000000000000, var_1_7=1283/5] [L47] var_1_4 = __VERIFIER_nondet_long() [L48] CALL assume_abort_if_not(var_1_4 >= -2147483647) VAL [\old(cond)=1, isInitial=1, var_1_1=-16, var_1_2=8, var_1_3=4, var_1_4=5, var_1_5=1, var_1_6=6599999999999999/10000000000000000, var_1_7=1283/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-16, var_1_2=8, var_1_3=4, var_1_4=5, var_1_5=1, var_1_6=6599999999999999/10000000000000000, var_1_7=1283/5] [L48] RET assume_abort_if_not(var_1_4 >= -2147483647) VAL [isInitial=1, var_1_1=-16, var_1_2=8, var_1_3=4, var_1_4=5, var_1_5=1, var_1_6=6599999999999999/10000000000000000, var_1_7=1283/5] [L49] CALL assume_abort_if_not(var_1_4 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_1=-16, var_1_2=8, var_1_3=4, var_1_4=5, var_1_5=1, var_1_6=6599999999999999/10000000000000000, var_1_7=1283/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-16, var_1_2=8, var_1_3=4, var_1_4=5, var_1_5=1, var_1_6=6599999999999999/10000000000000000, var_1_7=1283/5] [L49] RET assume_abort_if_not(var_1_4 <= 2147483646) VAL [isInitial=1, var_1_1=-16, var_1_2=8, var_1_3=4, var_1_4=5, var_1_5=1, var_1_6=6599999999999999/10000000000000000, var_1_7=1283/5] [L50] var_1_7 = __VERIFIER_nondet_float() [L51] CALL assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=-16, var_1_2=8, var_1_3=4, var_1_4=5, var_1_5=1, var_1_6=6599999999999999/10000000000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-16, var_1_2=8, var_1_3=4, var_1_4=5, var_1_5=1, var_1_6=6599999999999999/10000000000000000] [L51] RET assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=-16, var_1_2=8, var_1_3=4, var_1_4=5, var_1_5=1, var_1_6=6599999999999999/10000000000000000] [L64] RET updateVariables() [L65] CALL step() [L32] COND FALSE !(var_1_2 <= var_1_3) [L35] var_1_1 = ((((var_1_4) > (((((var_1_3) < (var_1_2)) ? (var_1_3) : (var_1_2))))) ? (var_1_4) : (((((var_1_3) < (var_1_2)) ? (var_1_3) : (var_1_2)))))) VAL [isInitial=1, var_1_1=5, var_1_2=8, var_1_3=4, var_1_4=5, var_1_5=1, var_1_6=6599999999999999/10000000000000000] [L37] var_1_5 = 0 [L38] var_1_6 = var_1_7 VAL [isInitial=1, var_1_1=5, var_1_2=8, var_1_3=4, var_1_4=5, var_1_5=0, var_1_6=261, var_1_7=261] [L65] RET step() [L66] CALL, EXPR property() [L56-L57] return (((var_1_2 <= var_1_3) ? (var_1_1 == ((signed long int) ((((var_1_2) < ((var_1_3 + -50))) ? (var_1_2) : ((var_1_3 + -50)))))) : (var_1_1 == ((signed long int) ((((var_1_4) > (((((var_1_3) < (var_1_2)) ? (var_1_3) : (var_1_2))))) ? (var_1_4) : (((((var_1_3) < (var_1_2)) ? (var_1_3) : (var_1_2))))))))) && (var_1_5 == ((unsigned char) 0))) && (var_1_6 == ((float) var_1_7)) ; VAL [\result=0, isInitial=1, var_1_1=5, var_1_2=8, var_1_3=4, var_1_4=5, var_1_5=0, var_1_6=261, var_1_7=261] [L66] RET, EXPR property() [L66] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_1=5, var_1_2=8, var_1_3=4, var_1_4=5, var_1_5=0, var_1_6=261, var_1_7=261] [L19] reach_error() VAL [isInitial=1, var_1_1=5, var_1_2=8, var_1_3=4, var_1_4=5, var_1_5=0, var_1_6=261, var_1_7=261] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 7, 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, 37 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 37 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred 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.2s InterpolantComputationTime, 104 NumberOfCodeBlocks, 104 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 51 ConstructedInterpolants, 0 QuantifiedInterpolants, 51 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 84/84 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-10 08:17:16,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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-4.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 087f53d60a69a89d74f854e09dec49f6677e36a3379c1213b60b4862ed153ba1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 08:17:18,867 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 08:17:18,953 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 08:17:18,961 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 08:17:18,961 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 08:17:18,995 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 08:17:18,996 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 08:17:18,996 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 08:17:18,997 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 08:17:18,997 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 08:17:18,998 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 08:17:18,998 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 08:17:18,999 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 08:17:18,999 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 08:17:19,000 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 08:17:19,000 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 08:17:19,000 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 08:17:19,001 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 08:17:19,001 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 08:17:19,001 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 08:17:19,002 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 08:17:19,005 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 08:17:19,006 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 08:17:19,006 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 08:17:19,006 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 08:17:19,006 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 08:17:19,021 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 08:17:19,023 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 08:17:19,023 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 08:17:19,024 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 08:17:19,024 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 08:17:19,025 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 08:17:19,025 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 08:17:19,025 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 08:17:19,026 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:17:19,026 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 08:17:19,027 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 08:17:19,027 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 08:17:19,027 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 08:17:19,027 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 08:17:19,028 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 08:17:19,028 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 08:17:19,028 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 08:17:19,028 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 08:17:19,029 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 -> 087f53d60a69a89d74f854e09dec49f6677e36a3379c1213b60b4862ed153ba1 [2024-11-10 08:17:19,352 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 08:17:19,382 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 08:17:19,386 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 08:17:19,387 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 08:17:19,388 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 08:17:19,389 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-4.i [2024-11-10 08:17:20,987 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 08:17:21,247 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 08:17:21,249 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-4.i [2024-11-10 08:17:21,261 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adef9ad01/8199736ae6144d4cacc7c184613ccc76/FLAGd1efda139 [2024-11-10 08:17:21,282 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adef9ad01/8199736ae6144d4cacc7c184613ccc76 [2024-11-10 08:17:21,286 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 08:17:21,287 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 08:17:21,288 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 08:17:21,289 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 08:17:21,296 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 08:17:21,297 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:17:21" (1/1) ... [2024-11-10 08:17:21,298 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b132e30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:21, skipping insertion in model container [2024-11-10 08:17:21,298 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:17:21" (1/1) ... [2024-11-10 08:17:21,321 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 08:17:21,520 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-4.i[914,927] [2024-11-10 08:17:21,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:17:21,588 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 08:17:21,601 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-4.i[914,927] [2024-11-10 08:17:21,621 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:17:21,647 INFO L204 MainTranslator]: Completed translation [2024-11-10 08:17:21,648 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:21 WrapperNode [2024-11-10 08:17:21,648 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 08:17:21,649 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 08:17:21,649 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 08:17:21,650 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 08:17:21,656 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:21" (1/1) ... [2024-11-10 08:17:21,669 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:21" (1/1) ... [2024-11-10 08:17:21,697 INFO L138 Inliner]: procedures = 27, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 64 [2024-11-10 08:17:21,698 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 08:17:21,699 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 08:17:21,699 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 08:17:21,699 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 08:17:21,709 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:21" (1/1) ... [2024-11-10 08:17:21,710 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:21" (1/1) ... [2024-11-10 08:17:21,714 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:21" (1/1) ... [2024-11-10 08:17:21,732 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 08:17:21,732 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:21" (1/1) ... [2024-11-10 08:17:21,734 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:21" (1/1) ... [2024-11-10 08:17:21,740 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:21" (1/1) ... [2024-11-10 08:17:21,745 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:21" (1/1) ... [2024-11-10 08:17:21,750 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:21" (1/1) ... [2024-11-10 08:17:21,751 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:21" (1/1) ... [2024-11-10 08:17:21,758 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 08:17:21,759 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 08:17:21,762 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 08:17:21,762 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 08:17:21,763 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:21" (1/1) ... [2024-11-10 08:17:21,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:17:21,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:17:21,810 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 08:17:21,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 08:17:21,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 08:17:21,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 08:17:21,865 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 08:17:21,865 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 08:17:21,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 08:17:21,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 08:17:21,949 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 08:17:21,953 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 08:17:22,168 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-10 08:17:22,169 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 08:17:22,184 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 08:17:22,185 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 08:17:22,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:17:22 BoogieIcfgContainer [2024-11-10 08:17:22,186 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 08:17:22,189 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 08:17:22,190 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 08:17:22,193 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 08:17:22,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:17:21" (1/3) ... [2024-11-10 08:17:22,195 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@590d1165 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:17:22, skipping insertion in model container [2024-11-10 08:17:22,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:21" (2/3) ... [2024-11-10 08:17:22,196 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@590d1165 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:17:22, skipping insertion in model container [2024-11-10 08:17:22,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:17:22" (3/3) ... [2024-11-10 08:17:22,199 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-4.i [2024-11-10 08:17:22,217 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 08:17:22,218 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 08:17:22,307 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 08:17:22,318 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;@536407b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 08:17:22,318 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 08:17:22,324 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 25 states have (on average 1.24) internal successors, (31), 26 states have internal predecessors, (31), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 08:17:22,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-10 08:17:22,334 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:17:22,335 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:17:22,336 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:17:22,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:17:22,343 INFO L85 PathProgramCache]: Analyzing trace with hash -699217210, now seen corresponding path program 1 times [2024-11-10 08:17:22,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 08:17:22,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [806737642] [2024-11-10 08:17:22,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:17:22,358 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-10 08:17:22,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 08:17:22,361 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-10 08:17:22,363 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-10 08:17:22,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:22,531 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 08:17:22,538 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:17:22,569 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-10 08:17:22,570 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 08:17:22,571 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 08:17:22,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [806737642] [2024-11-10 08:17:22,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [806737642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:17:22,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:17:22,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 08:17:22,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570876251] [2024-11-10 08:17:22,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:17:22,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 08:17:22,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 08:17:22,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 08:17:22,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:17:22,611 INFO L87 Difference]: Start difference. First operand has 35 states, 25 states have (on average 1.24) internal successors, (31), 26 states have internal predecessors, (31), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-10 08:17:22,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:17:22,638 INFO L93 Difference]: Finished difference Result 62 states and 90 transitions. [2024-11-10 08:17:22,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 08:17:22,641 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 52 [2024-11-10 08:17:22,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:17:22,649 INFO L225 Difference]: With dead ends: 62 [2024-11-10 08:17:22,649 INFO L226 Difference]: Without dead ends: 30 [2024-11-10 08:17:22,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:17:22,657 INFO L432 NwaCegarLoop]: 37 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, 37 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 08:17:22,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:17:22,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-10 08:17:22,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-10 08:17:22,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 08:17:22,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2024-11-10 08:17:22,705 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 52 [2024-11-10 08:17:22,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:17:22,706 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-11-10 08:17:22,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-10 08:17:22,707 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2024-11-10 08:17:22,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-10 08:17:22,709 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:17:22,710 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:17:22,718 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 (2)] Ended with exit code 0 [2024-11-10 08:17:22,911 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-10 08:17:22,912 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:17:22,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:17:22,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1023228455, now seen corresponding path program 1 times [2024-11-10 08:17:22,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 08:17:22,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [630222824] [2024-11-10 08:17:22,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:17:22,914 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-10 08:17:22,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 08:17:22,917 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-10 08:17:22,918 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-10 08:17:23,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:23,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-10 08:17:23,162 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:17:27,595 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-10 08:17:27,595 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 08:17:27,595 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 08:17:27,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [630222824] [2024-11-10 08:17:27,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [630222824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:17:27,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:17:27,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 08:17:27,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952351062] [2024-11-10 08:17:27,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:17:27,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 08:17:27,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 08:17:27,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 08:17:27,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-10 08:17:27,602 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 08:17:28,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:17:28,319 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2024-11-10 08:17:28,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 08:17:28,320 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 52 [2024-11-10 08:17:28,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:17:28,322 INFO L225 Difference]: With dead ends: 47 [2024-11-10 08:17:28,322 INFO L226 Difference]: Without dead ends: 44 [2024-11-10 08:17:28,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2024-11-10 08:17:28,324 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 50 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 08:17:28,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 128 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 08:17:28,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-10 08:17:28,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 38. [2024-11-10 08:17:28,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 states have internal predecessors, (30), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 08:17:28,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2024-11-10 08:17:28,335 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 52 [2024-11-10 08:17:28,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:17:28,336 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2024-11-10 08:17:28,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 08:17:28,337 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2024-11-10 08:17:28,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-10 08:17:28,339 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:17:28,339 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:17:28,347 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 (3)] Ended with exit code 0 [2024-11-10 08:17:28,540 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-10 08:17:28,541 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:17:28,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:17:28,542 INFO L85 PathProgramCache]: Analyzing trace with hash 135724774, now seen corresponding path program 1 times [2024-11-10 08:17:28,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 08:17:28,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2133863615] [2024-11-10 08:17:28,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:17:28,543 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-10 08:17:28,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 08:17:28,551 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-10 08:17:28,555 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-10 08:17:28,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:28,663 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-10 08:17:28,669 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:17:31,714 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-10 08:17:31,714 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 08:17:31,715 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 08:17:31,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2133863615] [2024-11-10 08:17:31,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2133863615] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:17:31,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:17:31,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 08:17:31,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420995082] [2024-11-10 08:17:31,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:17:31,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 08:17:31,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 08:17:31,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 08:17:31,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-10 08:17:31,717 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 08:17:32,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:17:32,367 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2024-11-10 08:17:32,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 08:17:32,368 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 52 [2024-11-10 08:17:32,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:17:32,369 INFO L225 Difference]: With dead ends: 44 [2024-11-10 08:17:32,369 INFO L226 Difference]: Without dead ends: 0 [2024-11-10 08:17:32,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2024-11-10 08:17:32,371 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 39 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 08:17:32,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 123 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 08:17:32,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-10 08:17:32,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-10 08:17:32,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 08:17:32,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-10 08:17:32,373 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2024-11-10 08:17:32,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:17:32,374 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 08:17:32,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 08:17:32,375 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-10 08:17:32,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-10 08:17:32,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 08:17:32,386 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-10 08:17:32,580 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-10 08:17:32,583 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-10 08:17:32,586 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-10 08:17:33,075 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 08:17:33,094 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-10 08:17:33,095 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-10 08:17:33,098 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-10 08:17:33,098 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-10 08:17:33,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 08:17:33 BoogieIcfgContainer [2024-11-10 08:17:33,106 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 08:17:33,107 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 08:17:33,107 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 08:17:33,107 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 08:17:33,107 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:17:22" (3/4) ... [2024-11-10 08:17:33,113 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 08:17:33,117 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-10 08:17:33,121 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2024-11-10 08:17:33,122 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-11-10 08:17:33,122 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-10 08:17:33,122 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 08:17:33,229 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 08:17:33,229 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 08:17:33,229 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 08:17:33,230 INFO L158 Benchmark]: Toolchain (without parser) took 11942.84ms. Allocated memory was 65.0MB in the beginning and 448.8MB in the end (delta: 383.8MB). Free memory was 31.7MB in the beginning and 405.5MB in the end (delta: -373.8MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. [2024-11-10 08:17:33,230 INFO L158 Benchmark]: CDTParser took 1.19ms. Allocated memory is still 48.2MB. Free memory was 22.7MB in the beginning and 22.7MB in the end (delta: 10.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:17:33,231 INFO L158 Benchmark]: CACSL2BoogieTranslator took 360.10ms. Allocated memory is still 65.0MB. Free memory was 31.4MB in the beginning and 33.6MB in the end (delta: -2.2MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. [2024-11-10 08:17:33,231 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.58ms. Allocated memory is still 65.0MB. Free memory was 33.4MB in the beginning and 31.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 08:17:33,231 INFO L158 Benchmark]: Boogie Preprocessor took 59.14ms. Allocated memory is still 65.0MB. Free memory was 31.8MB in the beginning and 29.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 08:17:33,232 INFO L158 Benchmark]: IcfgBuilder took 427.12ms. Allocated memory is still 65.0MB. Free memory was 29.6MB in the beginning and 33.5MB in the end (delta: -3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 08:17:33,232 INFO L158 Benchmark]: TraceAbstraction took 10917.26ms. Allocated memory was 65.0MB in the beginning and 448.8MB in the end (delta: 383.8MB). Free memory was 33.1MB in the beginning and 409.7MB in the end (delta: -376.7MB). Peak memory consumption was 188.0MB. Max. memory is 16.1GB. [2024-11-10 08:17:33,232 INFO L158 Benchmark]: Witness Printer took 122.93ms. Allocated memory is still 448.8MB. Free memory was 409.7MB in the beginning and 405.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 08:17:33,234 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.19ms. Allocated memory is still 48.2MB. Free memory was 22.7MB in the beginning and 22.7MB in the end (delta: 10.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 360.10ms. Allocated memory is still 65.0MB. Free memory was 31.4MB in the beginning and 33.6MB in the end (delta: -2.2MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.58ms. Allocated memory is still 65.0MB. Free memory was 33.4MB in the beginning and 31.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.14ms. Allocated memory is still 65.0MB. Free memory was 31.8MB in the beginning and 29.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 427.12ms. Allocated memory is still 65.0MB. Free memory was 29.6MB in the beginning and 33.5MB in the end (delta: -3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * TraceAbstraction took 10917.26ms. Allocated memory was 65.0MB in the beginning and 448.8MB in the end (delta: 383.8MB). Free memory was 33.1MB in the beginning and 409.7MB in the end (delta: -376.7MB). Peak memory consumption was 188.0MB. Max. memory is 16.1GB. * Witness Printer took 122.93ms. Allocated memory is still 448.8MB. Free memory was 409.7MB in the beginning and 405.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.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, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.3s, OverallIterations: 3, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 91 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 89 mSDsluCounter, 288 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 197 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 224 IncrementalHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 91 mSDtfsCounter, 224 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 169 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=2, InterpolantAutomatonStates: 28, 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, 6 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 156 NumberOfCodeBlocks, 156 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 153 ConstructedInterpolants, 0 QuantifiedInterpolants, 685 SizeOfPredicates, 16 NumberOfNonLiveVariables, 270 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 252/252 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_2 == \old(var_1_2))) && (var_1_3 == \old(var_1_3))) && (var_1_4 == \old(var_1_4))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7)))) RESULT: Ultimate proved your program to be correct! [2024-11-10 08:17:33,269 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