./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-16.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-16.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 0f3c671fd90b32c42295a3fff7f6ed38c1953794fa7bfd867d0ac70cf5a873bc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 17:12:56,532 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 17:12:56,599 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 17:12:56,604 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 17:12:56,604 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 17:12:56,635 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 17:12:56,636 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 17:12:56,636 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 17:12:56,636 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 17:12:56,637 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 17:12:56,637 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 17:12:56,639 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 17:12:56,640 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 17:12:56,643 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 17:12:56,644 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 17:12:56,644 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 17:12:56,644 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 17:12:56,645 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 17:12:56,645 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 17:12:56,645 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 17:12:56,646 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 17:12:56,646 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 17:12:56,646 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 17:12:56,647 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 17:12:56,647 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 17:12:56,647 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 17:12:56,648 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 17:12:56,648 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 17:12:56,648 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 17:12:56,648 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 17:12:56,649 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 17:12:56,649 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 17:12:56,649 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:12:56,650 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 17:12:56,650 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 17:12:56,650 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 17:12:56,651 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 17:12:56,651 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 17:12:56,651 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 17:12:56,651 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 17:12:56,652 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 17:12:56,652 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 17:12:56,652 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 -> 0f3c671fd90b32c42295a3fff7f6ed38c1953794fa7bfd867d0ac70cf5a873bc [2024-11-16 17:12:56,896 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 17:12:56,922 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 17:12:56,934 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 17:12:56,936 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 17:12:56,936 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 17:12:56,937 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-16.i [2024-11-16 17:12:58,370 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 17:12:58,547 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 17:12:58,548 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-16.i [2024-11-16 17:12:58,557 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4365c7ef/a6e2012a2ce84782acd072ff273f3c21/FLAG5779a598d [2024-11-16 17:12:58,944 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4365c7ef/a6e2012a2ce84782acd072ff273f3c21 [2024-11-16 17:12:58,946 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 17:12:58,947 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 17:12:58,948 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 17:12:58,949 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 17:12:58,953 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 17:12:58,953 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:12:58" (1/1) ... [2024-11-16 17:12:58,954 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@740b60c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:58, skipping insertion in model container [2024-11-16 17:12:58,955 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:12:58" (1/1) ... [2024-11-16 17:12:58,977 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 17:12:59,156 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-16.i[915,928] [2024-11-16 17:12:59,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:12:59,206 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 17:12:59,219 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-16.i[915,928] [2024-11-16 17:12:59,235 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:12:59,256 INFO L204 MainTranslator]: Completed translation [2024-11-16 17:12:59,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:59 WrapperNode [2024-11-16 17:12:59,257 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 17:12:59,258 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 17:12:59,258 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 17:12:59,259 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 17:12:59,265 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:59" (1/1) ... [2024-11-16 17:12:59,274 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:59" (1/1) ... [2024-11-16 17:12:59,290 INFO L138 Inliner]: procedures = 26, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 65 [2024-11-16 17:12:59,290 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 17:12:59,291 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 17:12:59,291 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 17:12:59,291 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 17:12:59,301 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:59" (1/1) ... [2024-11-16 17:12:59,302 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:59" (1/1) ... [2024-11-16 17:12:59,306 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:59" (1/1) ... [2024-11-16 17:12:59,318 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 17:12:59,319 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:59" (1/1) ... [2024-11-16 17:12:59,322 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:59" (1/1) ... [2024-11-16 17:12:59,326 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:59" (1/1) ... [2024-11-16 17:12:59,327 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:59" (1/1) ... [2024-11-16 17:12:59,328 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:59" (1/1) ... [2024-11-16 17:12:59,329 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:59" (1/1) ... [2024-11-16 17:12:59,330 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 17:12:59,332 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 17:12:59,332 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 17:12:59,332 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 17:12:59,333 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:59" (1/1) ... [2024-11-16 17:12:59,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:12:59,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 17:12:59,367 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 17:12:59,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 17:12:59,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 17:12:59,410 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 17:12:59,410 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 17:12:59,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 17:12:59,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 17:12:59,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 17:12:59,470 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 17:12:59,473 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 17:12:59,613 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-16 17:12:59,614 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 17:12:59,632 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 17:12:59,632 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 17:12:59,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:12:59 BoogieIcfgContainer [2024-11-16 17:12:59,633 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 17:12:59,635 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 17:12:59,637 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 17:12:59,640 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 17:12:59,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 05:12:58" (1/3) ... [2024-11-16 17:12:59,643 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e5e50c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:12:59, skipping insertion in model container [2024-11-16 17:12:59,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:59" (2/3) ... [2024-11-16 17:12:59,643 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e5e50c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:12:59, skipping insertion in model container [2024-11-16 17:12:59,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:12:59" (3/3) ... [2024-11-16 17:12:59,645 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-16.i [2024-11-16 17:12:59,662 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 17:12:59,663 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 17:12:59,739 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 17:12:59,749 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;@267beecc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 17:12:59,750 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 17:12:59,754 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-16 17:12:59,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-16 17:12:59,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:12:59,763 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-16 17:12:59,764 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:12:59,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:12:59,771 INFO L85 PathProgramCache]: Analyzing trace with hash -699217210, now seen corresponding path program 1 times [2024-11-16 17:12:59,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:12:59,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095806150] [2024-11-16 17:12:59,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:12:59,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:12:59,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:12:59,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:12:59,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:00,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:13:00,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:00,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:13:00,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:00,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:13:00,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:00,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:13:00,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:00,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:13:00,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:00,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:13:00,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:00,066 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-16 17:13:00,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:13:00,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095806150] [2024-11-16 17:13:00,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095806150] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:13:00,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:13:00,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 17:13:00,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079824411] [2024-11-16 17:13:00,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:13:00,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 17:13:00,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:13:00,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 17:13:00,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 17:13:00,102 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-16 17:13:00,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:13:00,119 INFO L93 Difference]: Finished difference Result 62 states and 90 transitions. [2024-11-16 17:13:00,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 17:13:00,121 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-16 17:13:00,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:13:00,126 INFO L225 Difference]: With dead ends: 62 [2024-11-16 17:13:00,126 INFO L226 Difference]: Without dead ends: 30 [2024-11-16 17:13:00,129 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-16 17:13:00,132 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-16 17:13:00,133 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-16 17:13:00,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-16 17:13:00,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-16 17:13:00,162 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-16 17:13:00,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2024-11-16 17:13:00,165 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 52 [2024-11-16 17:13:00,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:13:00,165 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-11-16 17:13:00,166 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-16 17:13:00,166 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2024-11-16 17:13:00,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-16 17:13:00,168 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:13:00,168 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-16 17:13:00,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 17:13:00,169 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:13:00,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:13:00,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1023228455, now seen corresponding path program 1 times [2024-11-16 17:13:00,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:13:00,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064422005] [2024-11-16 17:13:00,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:13:00,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:13:00,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 17:13:00,264 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 17:13:00,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 17:13:00,348 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 17:13:00,349 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 17:13:00,350 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 17:13:00,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 17:13:00,354 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-16 17:13:00,388 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 17:13:00,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 05:13:00 BoogieIcfgContainer [2024-11-16 17:13:00,392 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 17:13:00,393 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 17:13:00,393 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 17:13:00,393 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 17:13:00,394 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:12:59" (3/4) ... [2024-11-16 17:13:00,397 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 17:13:00,398 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 17:13:00,399 INFO L158 Benchmark]: Toolchain (without parser) took 1451.75ms. Allocated memory was 151.0MB in the beginning and 205.5MB in the end (delta: 54.5MB). Free memory was 99.2MB in the beginning and 154.9MB in the end (delta: -55.7MB). Peak memory consumption was 1.6MB. Max. memory is 16.1GB. [2024-11-16 17:13:00,399 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 151.0MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 17:13:00,400 INFO L158 Benchmark]: CACSL2BoogieTranslator took 309.27ms. Allocated memory is still 151.0MB. Free memory was 99.2MB in the beginning and 85.3MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-16 17:13:00,400 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.10ms. Allocated memory is still 151.0MB. Free memory was 85.3MB in the beginning and 83.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 17:13:00,401 INFO L158 Benchmark]: Boogie Preprocessor took 39.58ms. Allocated memory is still 151.0MB. Free memory was 83.2MB in the beginning and 81.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 17:13:00,401 INFO L158 Benchmark]: IcfgBuilder took 301.00ms. Allocated memory is still 151.0MB. Free memory was 81.6MB in the beginning and 69.4MB in the end (delta: 12.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-16 17:13:00,402 INFO L158 Benchmark]: TraceAbstraction took 756.87ms. Allocated memory was 151.0MB in the beginning and 205.5MB in the end (delta: 54.5MB). Free memory was 69.0MB in the beginning and 154.9MB in the end (delta: -85.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 17:13:00,402 INFO L158 Benchmark]: Witness Printer took 5.79ms. Allocated memory is still 205.5MB. Free memory is still 154.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 17:13:00,404 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 151.0MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 309.27ms. Allocated memory is still 151.0MB. Free memory was 99.2MB in the beginning and 85.3MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.10ms. Allocated memory is still 151.0MB. Free memory was 85.3MB in the beginning and 83.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.58ms. Allocated memory is still 151.0MB. Free memory was 83.2MB in the beginning and 81.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 301.00ms. Allocated memory is still 151.0MB. Free memory was 81.6MB in the beginning and 69.4MB in the end (delta: 12.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 756.87ms. Allocated memory was 151.0MB in the beginning and 205.5MB in the end (delta: 54.5MB). Free memory was 69.0MB in the beginning and 154.9MB in the end (delta: -85.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.79ms. Allocated memory is still 205.5MB. Free memory is still 154.9MB. 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 57, overapproximation of someBinaryDOUBLEComparisonOperation at line 57, overapproximation of someUnaryFLOAToperation at line 36. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 63.45; [L23] unsigned long int var_1_2 = 3925393104; [L24] unsigned long int var_1_3 = 256; [L25] unsigned long int var_1_4 = 2; [L26] float var_1_5 = 3.6; [L27] float var_1_6 = 99.372; [L28] double var_1_7 = 32.15; VAL [isInitial=0, var_1_1=1269/20, var_1_2=3925393104, var_1_3=256, var_1_4=2, var_1_5=18/5, var_1_6=24843/250, var_1_7=643/20] [L61] isInitial = 1 [L62] FCALL initially() [L63] COND TRUE 1 [L64] FCALL updateLastVariables() [L65] CALL updateVariables() [L42] var_1_2 = __VERIFIER_nondet_ulong() [L43] CALL assume_abort_if_not(var_1_2 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_1=1269/20, var_1_2=-9223372030412324864, var_1_3=256, var_1_4=2, var_1_5=18/5, var_1_6=24843/250, var_1_7=643/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1269/20, var_1_2=-9223372030412324864, var_1_3=256, var_1_4=2, var_1_5=18/5, var_1_6=24843/250, var_1_7=643/20] [L43] RET assume_abort_if_not(var_1_2 >= 2147483647) VAL [isInitial=1, var_1_1=1269/20, var_1_2=-9223372030412324864, var_1_3=256, var_1_4=2, var_1_5=18/5, var_1_6=24843/250, var_1_7=643/20] [L44] CALL assume_abort_if_not(var_1_2 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_1=1269/20, var_1_2=-9223372030412324864, var_1_3=256, var_1_4=2, var_1_5=18/5, var_1_6=24843/250, var_1_7=643/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1269/20, var_1_2=-9223372030412324864, var_1_3=256, var_1_4=2, var_1_5=18/5, var_1_6=24843/250, var_1_7=643/20] [L44] RET assume_abort_if_not(var_1_2 <= 4294967295) VAL [isInitial=1, var_1_1=1269/20, var_1_2=-9223372030412324864, var_1_3=256, var_1_4=2, var_1_5=18/5, var_1_6=24843/250, var_1_7=643/20] [L45] var_1_3 = __VERIFIER_nondet_ulong() [L46] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1269/20, var_1_2=-9223372030412324864, var_1_4=2, var_1_5=18/5, var_1_6=24843/250, var_1_7=643/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1269/20, var_1_2=-9223372030412324864, var_1_4=2, var_1_5=18/5, var_1_6=24843/250, var_1_7=643/20] [L46] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_1=1269/20, var_1_2=-9223372030412324864, var_1_4=2, var_1_5=18/5, var_1_6=24843/250, var_1_7=643/20] [L47] CALL assume_abort_if_not(var_1_3 <= 1073741824) VAL [\old(cond)=1, isInitial=1, var_1_1=1269/20, var_1_2=-9223372030412324864, var_1_3=1073741824, var_1_4=2, var_1_5=18/5, var_1_6=24843/250, var_1_7=643/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1269/20, var_1_2=-9223372030412324864, var_1_3=1073741824, var_1_4=2, var_1_5=18/5, var_1_6=24843/250, var_1_7=643/20] [L47] RET assume_abort_if_not(var_1_3 <= 1073741824) VAL [isInitial=1, var_1_1=1269/20, var_1_2=-9223372030412324864, var_1_3=1073741824, var_1_4=2, var_1_5=18/5, var_1_6=24843/250, var_1_7=643/20] [L48] var_1_4 = __VERIFIER_nondet_ulong() [L49] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1269/20, var_1_2=-9223372030412324864, var_1_3=1073741824, var_1_5=18/5, var_1_6=24843/250, var_1_7=643/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1269/20, var_1_2=-9223372030412324864, var_1_3=1073741824, var_1_5=18/5, var_1_6=24843/250, var_1_7=643/20] [L49] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_1=1269/20, var_1_2=-9223372030412324864, var_1_3=1073741824, var_1_5=18/5, var_1_6=24843/250, var_1_7=643/20] [L50] CALL assume_abort_if_not(var_1_4 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_1=1269/20, var_1_2=-9223372030412324864, var_1_3=1073741824, var_1_4=1073741823, var_1_5=18/5, var_1_6=24843/250, var_1_7=643/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1269/20, var_1_2=-9223372030412324864, var_1_3=1073741824, var_1_4=1073741823, var_1_5=18/5, var_1_6=24843/250, var_1_7=643/20] [L50] RET assume_abort_if_not(var_1_4 <= 1073741823) VAL [isInitial=1, var_1_1=1269/20, var_1_2=-9223372030412324864, var_1_3=1073741824, var_1_4=1073741823, var_1_5=18/5, var_1_6=24843/250, var_1_7=643/20] [L51] var_1_5 = __VERIFIER_nondet_float() [L52] CALL assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=1269/20, var_1_2=-9223372030412324864, var_1_3=1073741824, var_1_4=1073741823, var_1_6=24843/250, var_1_7=643/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1269/20, var_1_2=-9223372030412324864, var_1_3=1073741824, var_1_4=1073741823, var_1_6=24843/250, var_1_7=643/20] [L52] RET assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=1269/20, var_1_2=-9223372030412324864, var_1_3=1073741824, var_1_4=1073741823, var_1_6=24843/250, var_1_7=643/20] [L65] RET updateVariables() [L66] CALL step() [L32] unsigned long int stepLocal_0 = 10u / 16u; VAL [isInitial=1, stepLocal_0=0, var_1_1=1269/20, var_1_2=-9223372030412324864, var_1_3=1073741824, var_1_4=1073741823, var_1_6=24843/250, var_1_7=643/20] [L33] COND FALSE !((var_1_2 - (var_1_3 + var_1_4)) <= stepLocal_0) [L36] var_1_1 = ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) VAL [isInitial=1, var_1_1=3925393109, var_1_2=-9223372030412324864, var_1_3=1073741824, var_1_4=1073741823, var_1_5=3925393109, var_1_6=24843/250, var_1_7=643/20] [L38] var_1_6 = var_1_5 [L39] var_1_7 = var_1_5 VAL [isInitial=1, var_1_1=3925393109, var_1_2=-9223372030412324864, var_1_3=1073741824, var_1_4=1073741823, var_1_5=3925393109, var_1_6=3925393109, var_1_7=3925393109] [L66] RET step() [L67] CALL, EXPR property() [L57-L58] return ((((var_1_2 - (var_1_3 + var_1_4)) <= (10u / 16u)) ? (var_1_1 == ((float) var_1_5)) : (var_1_1 == ((float) ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))))) && (var_1_6 == ((float) var_1_5))) && (var_1_7 == ((double) var_1_5)) ; VAL [\result=0, isInitial=1, var_1_1=3925393109, var_1_2=-9223372030412324864, var_1_3=1073741824, var_1_4=1073741823, var_1_5=3925393109, var_1_6=3925393109, var_1_7=3925393109] [L67] RET, EXPR property() [L67] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_1=3925393109, var_1_2=-9223372030412324864, var_1_3=1073741824, var_1_4=1073741823, var_1_5=3925393109, var_1_6=3925393109, var_1_7=3925393109] [L19] reach_error() VAL [isInitial=1, var_1_1=3925393109, var_1_2=-9223372030412324864, var_1_3=1073741824, var_1_4=1073741823, var_1_5=3925393109, var_1_6=3925393109, var_1_7=3925393109] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, 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.1s 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-16 17:13:00,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-16.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 0f3c671fd90b32c42295a3fff7f6ed38c1953794fa7bfd867d0ac70cf5a873bc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 17:13:02,604 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 17:13:02,691 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 17:13:02,695 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 17:13:02,696 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 17:13:02,728 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 17:13:02,729 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 17:13:02,729 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 17:13:02,730 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 17:13:02,730 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 17:13:02,731 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 17:13:02,731 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 17:13:02,732 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 17:13:02,733 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 17:13:02,734 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 17:13:02,734 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 17:13:02,734 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 17:13:02,734 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 17:13:02,735 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 17:13:02,735 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 17:13:02,735 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 17:13:02,738 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 17:13:02,738 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 17:13:02,739 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 17:13:02,739 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 17:13:02,739 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 17:13:02,739 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 17:13:02,740 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 17:13:02,740 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 17:13:02,740 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 17:13:02,740 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 17:13:02,740 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 17:13:02,741 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 17:13:02,741 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 17:13:02,741 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:13:02,742 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 17:13:02,742 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 17:13:02,742 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 17:13:02,743 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 17:13:02,743 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 17:13:02,743 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 17:13:02,744 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 17:13:02,744 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 17:13:02,744 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 17:13:02,745 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 -> 0f3c671fd90b32c42295a3fff7f6ed38c1953794fa7bfd867d0ac70cf5a873bc [2024-11-16 17:13:03,072 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 17:13:03,094 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 17:13:03,098 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 17:13:03,099 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 17:13:03,099 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 17:13:03,101 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-16.i [2024-11-16 17:13:04,580 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 17:13:04,796 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 17:13:04,796 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-16.i [2024-11-16 17:13:04,803 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93e13f323/84643c0a7bfa46f8b15ca37ef247814c/FLAG6d5b3b775 [2024-11-16 17:13:04,814 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93e13f323/84643c0a7bfa46f8b15ca37ef247814c [2024-11-16 17:13:04,817 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 17:13:04,818 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 17:13:04,819 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 17:13:04,819 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 17:13:04,825 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 17:13:04,826 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:13:04" (1/1) ... [2024-11-16 17:13:04,827 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dbf849e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:04, skipping insertion in model container [2024-11-16 17:13:04,827 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:13:04" (1/1) ... [2024-11-16 17:13:04,848 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 17:13:05,031 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-16.i[915,928] [2024-11-16 17:13:05,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:13:05,085 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 17:13:05,097 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-16.i[915,928] [2024-11-16 17:13:05,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:13:05,133 INFO L204 MainTranslator]: Completed translation [2024-11-16 17:13:05,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:05 WrapperNode [2024-11-16 17:13:05,134 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 17:13:05,135 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 17:13:05,135 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 17:13:05,135 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 17:13:05,142 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:05" (1/1) ... [2024-11-16 17:13:05,157 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:05" (1/1) ... [2024-11-16 17:13:05,181 INFO L138 Inliner]: procedures = 27, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 65 [2024-11-16 17:13:05,182 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 17:13:05,183 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 17:13:05,183 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 17:13:05,183 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 17:13:05,205 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:05" (1/1) ... [2024-11-16 17:13:05,206 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:05" (1/1) ... [2024-11-16 17:13:05,212 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:05" (1/1) ... [2024-11-16 17:13:05,223 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 17:13:05,224 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:05" (1/1) ... [2024-11-16 17:13:05,224 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:05" (1/1) ... [2024-11-16 17:13:05,236 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:05" (1/1) ... [2024-11-16 17:13:05,236 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:05" (1/1) ... [2024-11-16 17:13:05,238 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:05" (1/1) ... [2024-11-16 17:13:05,243 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:05" (1/1) ... [2024-11-16 17:13:05,245 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 17:13:05,246 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 17:13:05,249 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 17:13:05,249 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 17:13:05,250 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:05" (1/1) ... [2024-11-16 17:13:05,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:13:05,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 17:13:05,286 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 17:13:05,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 17:13:05,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 17:13:05,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 17:13:05,336 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 17:13:05,336 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 17:13:05,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 17:13:05,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 17:13:05,418 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 17:13:05,421 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 17:13:05,737 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-16 17:13:05,737 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 17:13:05,755 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 17:13:05,756 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 17:13:05,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:13:05 BoogieIcfgContainer [2024-11-16 17:13:05,756 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 17:13:05,759 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 17:13:05,760 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 17:13:05,763 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 17:13:05,763 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 05:13:04" (1/3) ... [2024-11-16 17:13:05,764 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8855da5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:13:05, skipping insertion in model container [2024-11-16 17:13:05,765 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:05" (2/3) ... [2024-11-16 17:13:05,766 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8855da5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:13:05, skipping insertion in model container [2024-11-16 17:13:05,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:13:05" (3/3) ... [2024-11-16 17:13:05,767 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-16.i [2024-11-16 17:13:05,784 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 17:13:05,784 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 17:13:05,853 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 17:13:05,861 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;@4c328835, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 17:13:05,861 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 17:13:05,865 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-16 17:13:05,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-16 17:13:05,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:13:05,873 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-16 17:13:05,874 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:13:05,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:13:05,881 INFO L85 PathProgramCache]: Analyzing trace with hash -699217210, now seen corresponding path program 1 times [2024-11-16 17:13:05,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 17:13:05,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [885887107] [2024-11-16 17:13:05,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:13:05,895 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 17:13:05,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 17:13:05,898 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 17:13:05,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-16 17:13:06,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:06,092 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 17:13:06,102 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:13:06,133 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-16 17:13:06,133 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 17:13:06,134 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 17:13:06,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [885887107] [2024-11-16 17:13:06,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [885887107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:13:06,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:13:06,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 17:13:06,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992783821] [2024-11-16 17:13:06,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:13:06,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 17:13:06,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 17:13:06,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 17:13:06,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 17:13:06,166 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-16 17:13:06,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:13:06,185 INFO L93 Difference]: Finished difference Result 62 states and 90 transitions. [2024-11-16 17:13:06,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 17:13:06,187 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-16 17:13:06,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:13:06,193 INFO L225 Difference]: With dead ends: 62 [2024-11-16 17:13:06,193 INFO L226 Difference]: Without dead ends: 30 [2024-11-16 17:13:06,196 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-16 17:13:06,198 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-16 17:13:06,199 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-16 17:13:06,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-16 17:13:06,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-16 17:13:06,228 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-16 17:13:06,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2024-11-16 17:13:06,231 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 52 [2024-11-16 17:13:06,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:13:06,231 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-11-16 17:13:06,231 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-16 17:13:06,232 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2024-11-16 17:13:06,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-16 17:13:06,233 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:13:06,234 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-16 17:13:06,242 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-16 17:13:06,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 17:13:06,435 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:13:06,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:13:06,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1023228455, now seen corresponding path program 1 times [2024-11-16 17:13:06,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 17:13:06,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2081681597] [2024-11-16 17:13:06,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:13:06,437 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 17:13:06,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 17:13:06,440 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 17:13:06,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-16 17:13:06,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:06,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-16 17:13:06,607 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:13:11,274 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 65 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-16 17:13:11,275 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 17:13:14,976 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-16 17:13:14,977 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 17:13:14,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2081681597] [2024-11-16 17:13:14,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2081681597] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-16 17:13:14,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 17:13:14,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [18] total 26 [2024-11-16 17:13:14,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114435167] [2024-11-16 17:13:14,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:13:14,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 17:13:14,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 17:13:14,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 17:13:14,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=512, Unknown=0, NotChecked=0, Total=650 [2024-11-16 17:13:14,981 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) 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-16 17:13:17,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:13:17,071 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2024-11-16 17:13:17,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 17:13:17,072 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) 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-16 17:13:17,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:13:17,073 INFO L225 Difference]: With dead ends: 50 [2024-11-16 17:13:17,073 INFO L226 Difference]: Without dead ends: 47 [2024-11-16 17:13:17,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=154, Invalid=602, Unknown=0, NotChecked=0, Total=756 [2024-11-16 17:13:17,076 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 53 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-16 17:13:17,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 129 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-16 17:13:17,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-16 17:13:17,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2024-11-16 17:13:17,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 32 states have (on average 1.0625) internal successors, (34), 33 states have internal predecessors, (34), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-16 17:13:17,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2024-11-16 17:13:17,086 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 52 [2024-11-16 17:13:17,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:13:17,087 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2024-11-16 17:13:17,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) 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-16 17:13:17,087 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2024-11-16 17:13:17,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-16 17:13:17,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:13:17,089 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-16 17:13:17,099 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-16 17:13:17,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 17:13:17,290 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:13:17,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:13:17,290 INFO L85 PathProgramCache]: Analyzing trace with hash 135724774, now seen corresponding path program 1 times [2024-11-16 17:13:17,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 17:13:17,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1351198196] [2024-11-16 17:13:17,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:13:17,291 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 17:13:17,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 17:13:17,294 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 17:13:17,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-16 17:13:17,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:17,425 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-16 17:13:17,429 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:13:20,823 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 65 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-16 17:13:20,824 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 17:13:23,719 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-16 17:13:23,719 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 17:13:23,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1351198196] [2024-11-16 17:13:23,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1351198196] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-16 17:13:23,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 17:13:23,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [19] total 28 [2024-11-16 17:13:23,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67816162] [2024-11-16 17:13:23,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:13:23,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 17:13:23,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 17:13:23,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 17:13:23,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=600, Unknown=0, NotChecked=0, Total=756 [2024-11-16 17:13:23,722 INFO L87 Difference]: Start difference. First operand 44 states and 52 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-16 17:13:26,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:13:26,706 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2024-11-16 17:13:26,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 17:13:26,707 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-16 17:13:26,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:13:26,708 INFO L225 Difference]: With dead ends: 58 [2024-11-16 17:13:26,708 INFO L226 Difference]: Without dead ends: 0 [2024-11-16 17:13:26,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=191, Invalid=801, Unknown=0, NotChecked=0, Total=992 [2024-11-16 17:13:26,710 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 31 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-16 17:13:26,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 129 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-16 17:13:26,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-16 17:13:26,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-16 17:13:26,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 17:13:26,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-16 17:13:26,714 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2024-11-16 17:13:26,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:13:26,715 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-16 17:13:26,716 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-16 17:13:26,716 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-16 17:13:26,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-16 17:13:26,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 17:13:26,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-16 17:13:26,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 17:13:26,927 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-16 17:13:26,929 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-16 17:13:29,913 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 17:13:29,929 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~64 [2024-11-16 17:13:29,936 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 05:13:29 BoogieIcfgContainer [2024-11-16 17:13:29,936 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 17:13:29,939 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 17:13:29,939 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 17:13:29,939 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 17:13:29,940 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:13:05" (3/4) ... [2024-11-16 17:13:29,942 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-16 17:13:29,947 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-16 17:13:29,952 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2024-11-16 17:13:29,952 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-11-16 17:13:29,953 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-16 17:13:29,953 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-16 17:13:30,052 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 17:13:30,052 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-16 17:13:30,052 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 17:13:30,053 INFO L158 Benchmark]: Toolchain (without parser) took 25235.33ms. Allocated memory was 62.9MB in the beginning and 100.7MB in the end (delta: 37.7MB). Free memory was 41.2MB in the beginning and 45.0MB in the end (delta: -3.7MB). Peak memory consumption was 33.0MB. Max. memory is 16.1GB. [2024-11-16 17:13:30,053 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 44.0MB. Free memory is still 20.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 17:13:30,054 INFO L158 Benchmark]: CACSL2BoogieTranslator took 315.46ms. Allocated memory is still 62.9MB. Free memory was 41.1MB in the beginning and 27.5MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-16 17:13:30,054 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.88ms. Allocated memory is still 62.9MB. Free memory was 27.5MB in the beginning and 25.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 17:13:30,054 INFO L158 Benchmark]: Boogie Preprocessor took 62.59ms. Allocated memory was 62.9MB in the beginning and 83.9MB in the end (delta: 21.0MB). Free memory was 25.7MB in the beginning and 62.5MB in the end (delta: -36.8MB). Peak memory consumption was 2.9MB. Max. memory is 16.1GB. [2024-11-16 17:13:30,055 INFO L158 Benchmark]: IcfgBuilder took 510.45ms. Allocated memory is still 83.9MB. Free memory was 62.5MB in the beginning and 50.2MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 17:13:30,055 INFO L158 Benchmark]: TraceAbstraction took 24176.90ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 49.3MB in the beginning and 50.2MB in the end (delta: -883.1kB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. [2024-11-16 17:13:30,055 INFO L158 Benchmark]: Witness Printer took 113.39ms. Allocated memory is still 100.7MB. Free memory was 50.2MB in the beginning and 45.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 17:13:30,057 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.12ms. Allocated memory is still 44.0MB. Free memory is still 20.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 315.46ms. Allocated memory is still 62.9MB. Free memory was 41.1MB in the beginning and 27.5MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.88ms. Allocated memory is still 62.9MB. Free memory was 27.5MB in the beginning and 25.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 62.59ms. Allocated memory was 62.9MB in the beginning and 83.9MB in the end (delta: 21.0MB). Free memory was 25.7MB in the beginning and 62.5MB in the end (delta: -36.8MB). Peak memory consumption was 2.9MB. Max. memory is 16.1GB. * IcfgBuilder took 510.45ms. Allocated memory is still 83.9MB. Free memory was 62.5MB in the beginning and 50.2MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 24176.90ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 49.3MB in the beginning and 50.2MB in the end (delta: -883.1kB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. * Witness Printer took 113.39ms. Allocated memory is still 100.7MB. Free memory was 50.2MB in the beginning and 45.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~64 * 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: 21.1s, OverallIterations: 3, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 84 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 84 mSDsluCounter, 295 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 192 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 292 IncrementalHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 103 mSDtfsCounter, 292 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 261 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 9.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=2, InterpolantAutomatonStates: 22, 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, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 14.7s InterpolantComputationTime, 156 NumberOfCodeBlocks, 156 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 255 ConstructedInterpolants, 0 QuantifiedInterpolants, 1705 SizeOfPredicates, 19 NumberOfNonLiveVariables, 270 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 396/420 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: 63]: Location Invariant Derived location invariant: null - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_2 == \old(var_1_2))) && (var_1_3 == \old(var_1_3))) && (var_1_4 == \old(var_1_4))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) RESULT: Ultimate proved your program to be correct! [2024-11-16 17:13:30,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE