./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-13.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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_floatingpointinfluence_no-floats_file-13.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 70056f6ecf6cc1e792a4daa4b0ef5828c715d2ed64331075caaff01f6900b2e4 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 04:45:33,239 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 04:45:33,306 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 04:45:33,311 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 04:45:33,312 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 04:45:33,336 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 04:45:33,337 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 04:45:33,337 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 04:45:33,337 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 04:45:33,339 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 04:45:33,339 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 04:45:33,340 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 04:45:33,340 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 04:45:33,340 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 04:45:33,343 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 04:45:33,343 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 04:45:33,344 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 04:45:33,344 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 04:45:33,344 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 04:45:33,344 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 04:45:33,344 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 04:45:33,345 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 04:45:33,345 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 04:45:33,345 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 04:45:33,345 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 04:45:33,345 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 04:45:33,345 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 04:45:33,346 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 04:45:33,346 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 04:45:33,346 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 04:45:33,346 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 04:45:33,346 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 04:45:33,347 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:45:33,347 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 04:45:33,347 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 04:45:33,347 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 04:45:33,347 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 04:45:33,347 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 04:45:33,348 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 04:45:33,348 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 04:45:33,349 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 04:45:33,350 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 04:45:33,350 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 -> 70056f6ecf6cc1e792a4daa4b0ef5828c715d2ed64331075caaff01f6900b2e4 [2024-11-12 04:45:33,568 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 04:45:33,605 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 04:45:33,613 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 04:45:33,618 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 04:45:33,619 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 04:45:33,620 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-13.i [2024-11-12 04:45:35,263 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 04:45:35,513 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 04:45:35,514 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-13.i [2024-11-12 04:45:35,527 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/108e82050/4ef51f10ebc74d4b9c12e84268a2dad6/FLAG4fabd66a8 [2024-11-12 04:45:35,543 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/108e82050/4ef51f10ebc74d4b9c12e84268a2dad6 [2024-11-12 04:45:35,546 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 04:45:35,548 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 04:45:35,550 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 04:45:35,554 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 04:45:35,560 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 04:45:35,561 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:45:35" (1/1) ... [2024-11-12 04:45:35,564 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@603171dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:35, skipping insertion in model container [2024-11-12 04:45:35,564 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:45:35" (1/1) ... [2024-11-12 04:45:35,593 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 04:45:35,788 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_floatingpointinfluence_no-floats_file-13.i[916,929] [2024-11-12 04:45:35,850 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:45:35,878 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 04:45:35,904 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_floatingpointinfluence_no-floats_file-13.i[916,929] [2024-11-12 04:45:35,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:45:35,992 INFO L204 MainTranslator]: Completed translation [2024-11-12 04:45:35,993 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:35 WrapperNode [2024-11-12 04:45:35,993 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 04:45:35,995 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 04:45:35,995 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 04:45:35,995 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 04:45:36,002 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:35" (1/1) ... [2024-11-12 04:45:36,015 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:35" (1/1) ... [2024-11-12 04:45:36,063 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 113 [2024-11-12 04:45:36,064 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 04:45:36,065 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 04:45:36,069 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 04:45:36,069 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 04:45:36,085 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:35" (1/1) ... [2024-11-12 04:45:36,086 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:35" (1/1) ... [2024-11-12 04:45:36,090 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:35" (1/1) ... [2024-11-12 04:45:36,115 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-12 04:45:36,116 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:35" (1/1) ... [2024-11-12 04:45:36,116 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:35" (1/1) ... [2024-11-12 04:45:36,125 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:35" (1/1) ... [2024-11-12 04:45:36,132 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:35" (1/1) ... [2024-11-12 04:45:36,134 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:35" (1/1) ... [2024-11-12 04:45:36,138 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:35" (1/1) ... [2024-11-12 04:45:36,141 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 04:45:36,145 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 04:45:36,145 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 04:45:36,145 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 04:45:36,146 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:35" (1/1) ... [2024-11-12 04:45:36,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:45:36,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:45:36,185 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-12 04:45:36,188 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-12 04:45:36,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 04:45:36,242 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 04:45:36,243 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 04:45:36,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 04:45:36,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 04:45:36,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 04:45:36,363 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 04:45:36,365 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 04:45:36,634 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-12 04:45:36,634 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 04:45:36,652 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 04:45:36,652 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 04:45:36,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:45:36 BoogieIcfgContainer [2024-11-12 04:45:36,653 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 04:45:36,655 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 04:45:36,655 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 04:45:36,658 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 04:45:36,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:45:35" (1/3) ... [2024-11-12 04:45:36,659 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f78984a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:45:36, skipping insertion in model container [2024-11-12 04:45:36,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:35" (2/3) ... [2024-11-12 04:45:36,660 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f78984a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:45:36, skipping insertion in model container [2024-11-12 04:45:36,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:45:36" (3/3) ... [2024-11-12 04:45:36,662 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-13.i [2024-11-12 04:45:36,677 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 04:45:36,677 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 04:45:36,748 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 04:45:36,756 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;@14f4e72f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 04:45:36,757 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 04:45:36,765 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-12 04:45:36,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-12 04:45:36,782 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:45:36,783 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:45:36,784 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:45:36,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:45:36,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1848977806, now seen corresponding path program 1 times [2024-11-12 04:45:36,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:45:36,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59152550] [2024-11-12 04:45:36,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:45:36,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:45:36,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:37,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:45:37,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:37,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:45:37,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:37,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:45:37,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:37,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:45:37,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:37,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 04:45:37,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:37,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:45:37,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:37,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 04:45:37,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:37,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:45:37,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:37,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 04:45:37,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:37,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:45:37,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:37,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 04:45:37,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:37,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:45:37,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:37,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 04:45:37,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:37,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:45:37,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:37,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 04:45:37,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:37,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:45:37,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:37,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 04:45:37,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:37,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:45:37,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:37,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-12 04:45:37,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:37,190 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-12 04:45:37,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:45:37,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59152550] [2024-11-12 04:45:37,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59152550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:45:37,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:45:37,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 04:45:37,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239505028] [2024-11-12 04:45:37,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:45:37,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 04:45:37,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:45:37,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 04:45:37,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:45:37,221 INFO L87 Difference]: Start difference. First operand has 53 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-12 04:45:37,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:45:37,244 INFO L93 Difference]: Finished difference Result 99 states and 171 transitions. [2024-11-12 04:45:37,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 04:45:37,246 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 118 [2024-11-12 04:45:37,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:45:37,252 INFO L225 Difference]: With dead ends: 99 [2024-11-12 04:45:37,252 INFO L226 Difference]: Without dead ends: 49 [2024-11-12 04:45:37,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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-12 04:45:37,258 INFO L435 NwaCegarLoop]: 71 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, 71 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-12 04:45:37,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:45:37,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-12 04:45:37,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-12 04:45:37,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-12 04:45:37,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 71 transitions. [2024-11-12 04:45:37,359 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 71 transitions. Word has length 118 [2024-11-12 04:45:37,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:45:37,359 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 71 transitions. [2024-11-12 04:45:37,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-12 04:45:37,360 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 71 transitions. [2024-11-12 04:45:37,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-12 04:45:37,362 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:45:37,363 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:45:37,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 04:45:37,363 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:45:37,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:45:37,364 INFO L85 PathProgramCache]: Analyzing trace with hash -609254647, now seen corresponding path program 1 times [2024-11-12 04:45:37,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:45:37,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965998581] [2024-11-12 04:45:37,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:45:37,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:45:37,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 04:45:37,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1816012290] [2024-11-12 04:45:37,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:45:37,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 04:45:37,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:45:37,526 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 04:45:37,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 04:45:37,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 04:45:37,727 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 04:45:37,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 04:45:37,812 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 04:45:37,814 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 04:45:37,815 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 04:45:37,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 04:45:38,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 04:45:38,021 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-12 04:45:38,081 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 04:45:38,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 04:45:38 BoogieIcfgContainer [2024-11-12 04:45:38,087 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 04:45:38,088 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 04:45:38,088 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 04:45:38,088 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 04:45:38,089 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:45:36" (3/4) ... [2024-11-12 04:45:38,091 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 04:45:38,092 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 04:45:38,092 INFO L158 Benchmark]: Toolchain (without parser) took 2544.93ms. Allocated memory was 159.4MB in the beginning and 232.8MB in the end (delta: 73.4MB). Free memory was 85.9MB in the beginning and 166.5MB in the end (delta: -80.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 04:45:38,093 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 159.4MB. Free memory was 109.5MB in the beginning and 109.3MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 04:45:38,093 INFO L158 Benchmark]: CACSL2BoogieTranslator took 443.94ms. Allocated memory is still 159.4MB. Free memory was 85.7MB in the beginning and 71.6MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 04:45:38,093 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.48ms. Allocated memory is still 159.4MB. Free memory was 71.4MB in the beginning and 68.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 04:45:38,094 INFO L158 Benchmark]: Boogie Preprocessor took 79.17ms. Allocated memory is still 159.4MB. Free memory was 68.9MB in the beginning and 65.5MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 04:45:38,094 INFO L158 Benchmark]: RCFGBuilder took 507.86ms. Allocated memory was 159.4MB in the beginning and 232.8MB in the end (delta: 73.4MB). Free memory was 65.5MB in the beginning and 192.3MB in the end (delta: -126.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 04:45:38,095 INFO L158 Benchmark]: TraceAbstraction took 1432.27ms. Allocated memory is still 232.8MB. Free memory was 192.3MB in the beginning and 166.5MB in the end (delta: 25.8MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. [2024-11-12 04:45:38,095 INFO L158 Benchmark]: Witness Printer took 4.14ms. Allocated memory is still 232.8MB. Free memory is still 166.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 04:45:38,096 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 159.4MB. Free memory was 109.5MB in the beginning and 109.3MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 443.94ms. Allocated memory is still 159.4MB. Free memory was 85.7MB in the beginning and 71.6MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.48ms. Allocated memory is still 159.4MB. Free memory was 71.4MB in the beginning and 68.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.17ms. Allocated memory is still 159.4MB. Free memory was 68.9MB in the beginning and 65.5MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 507.86ms. Allocated memory was 159.4MB in the beginning and 232.8MB in the end (delta: 73.4MB). Free memory was 65.5MB in the beginning and 192.3MB in the end (delta: -126.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1432.27ms. Allocated memory is still 232.8MB. Free memory was 192.3MB in the beginning and 166.5MB in the end (delta: 25.8MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. * Witness Printer took 4.14ms. Allocated memory is still 232.8MB. Free memory is still 166.5MB. 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 someBinaryDOUBLEComparisonOperation at line 92. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 25; [L23] unsigned char var_1_2 = 1; [L24] signed char var_1_5 = 16; [L25] unsigned short int var_1_6 = 16; [L26] signed char var_1_7 = 4; [L27] unsigned short int var_1_8 = 2; [L28] signed char var_1_9 = 64; [L29] signed char var_1_10 = 0; [L30] unsigned char var_1_11 = 16; [L31] signed long int var_1_12 = 128; [L32] signed long int var_1_13 = 50; [L33] signed long int var_1_14 = 3; [L34] signed long int var_1_15 = 25; VAL [isInitial=0, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=16, var_1_7=4, var_1_8=2, var_1_9=64] [L96] isInitial = 1 [L97] FCALL initially() [L98] COND TRUE 1 [L99] FCALL updateLastVariables() [L100] CALL updateVariables() [L60] var_1_2 = __VERIFIER_nondet_uchar() [L61] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_5=16, var_1_6=16, var_1_7=4, var_1_8=2, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_5=16, var_1_6=16, var_1_7=4, var_1_8=2, var_1_9=64] [L61] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_5=16, var_1_6=16, var_1_7=4, var_1_8=2, var_1_9=64] [L62] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=16, var_1_7=4, var_1_8=2, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=16, var_1_7=4, var_1_8=2, var_1_9=64] [L62] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=16, var_1_7=4, var_1_8=2, var_1_9=64] [L63] var_1_6 = __VERIFIER_nondet_ushort() [L64] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_7=4, var_1_8=2, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_7=4, var_1_8=2, var_1_9=64] [L64] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_7=4, var_1_8=2, var_1_9=64] [L65] CALL assume_abort_if_not(var_1_6 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_7=4, var_1_8=2, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_7=4, var_1_8=2, var_1_9=64] [L65] RET assume_abort_if_not(var_1_6 <= 65535) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_7=4, var_1_8=2, var_1_9=64] [L66] CALL assume_abort_if_not(var_1_6 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=-65535, var_1_7=4, var_1_8=2, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=-65535, var_1_7=4, var_1_8=2, var_1_9=64] [L66] RET assume_abort_if_not(var_1_6 != 0) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=-65535, var_1_7=4, var_1_8=2, var_1_9=64] [L67] var_1_7 = __VERIFIER_nondet_char() [L68] CALL assume_abort_if_not(var_1_7 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=-65535, var_1_7=-127, var_1_8=2, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=-65535, var_1_7=-127, var_1_8=2, var_1_9=64] [L68] RET assume_abort_if_not(var_1_7 >= -127) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=-65535, var_1_7=-127, var_1_8=2, var_1_9=64] [L69] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=-65535, var_1_7=-127, var_1_8=2, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=-65535, var_1_7=-127, var_1_8=2, var_1_9=64] [L69] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=-65535, var_1_7=-127, var_1_8=2, var_1_9=64] [L70] var_1_9 = __VERIFIER_nondet_char() [L71] CALL assume_abort_if_not(var_1_9 >= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=-65535, var_1_7=-127, var_1_8=2, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=-65535, var_1_7=-127, var_1_8=2, var_1_9=63] [L71] RET assume_abort_if_not(var_1_9 >= 63) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=-65535, var_1_7=-127, var_1_8=2, var_1_9=63] [L72] CALL assume_abort_if_not(var_1_9 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=-65535, var_1_7=-127, var_1_8=2, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=-65535, var_1_7=-127, var_1_8=2, var_1_9=63] [L72] RET assume_abort_if_not(var_1_9 <= 127) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=-65535, var_1_7=-127, var_1_8=2, var_1_9=63] [L73] var_1_10 = __VERIFIER_nondet_char() [L74] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=-65535, var_1_7=-127, var_1_8=2, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=-65535, var_1_7=-127, var_1_8=2, var_1_9=63] [L74] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=-65535, var_1_7=-127, var_1_8=2, var_1_9=63] [L75] CALL assume_abort_if_not(var_1_10 <= 64) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=-65535, var_1_7=-127, var_1_8=2, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=-65535, var_1_7=-127, var_1_8=2, var_1_9=63] [L75] RET assume_abort_if_not(var_1_10 <= 64) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=128, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=-65535, var_1_7=-127, var_1_8=2, var_1_9=63] [L76] var_1_12 = __VERIFIER_nondet_long() [L77] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=-65535, var_1_7=-127, var_1_8=2, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=-65535, var_1_7=-127, var_1_8=2, var_1_9=63] [L77] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=-65535, var_1_7=-127, var_1_8=2, var_1_9=63] [L78] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=-65535, var_1_7=-127, var_1_8=2, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=-65535, var_1_7=-127, var_1_8=2, var_1_9=63] [L78] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=50, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=-65535, var_1_7=-127, var_1_8=2, var_1_9=63] [L79] var_1_13 = __VERIFIER_nondet_long() [L80] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=-65535, var_1_7=-127, var_1_8=2, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=-65535, var_1_7=-127, var_1_8=2, var_1_9=63] [L80] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=-65535, var_1_7=-127, var_1_8=2, var_1_9=63] [L81] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=-65535, var_1_7=-127, var_1_8=2, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=-65535, var_1_7=-127, var_1_8=2, var_1_9=63] [L81] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=3, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=-65535, var_1_7=-127, var_1_8=2, var_1_9=63] [L82] var_1_14 = __VERIFIER_nondet_long() [L83] CALL assume_abort_if_not(var_1_14 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=-2147483648, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=-65535, var_1_7=-127, var_1_8=2, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=-2147483648, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=-65535, var_1_7=-127, var_1_8=2, var_1_9=63] [L83] RET assume_abort_if_not(var_1_14 >= -2147483648) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=-2147483648, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=-65535, var_1_7=-127, var_1_8=2, var_1_9=63] [L84] CALL assume_abort_if_not(var_1_14 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=-2147483648, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=-65535, var_1_7=-127, var_1_8=2, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=-2147483648, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=-65535, var_1_7=-127, var_1_8=2, var_1_9=63] [L84] RET assume_abort_if_not(var_1_14 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=-2147483648, var_1_15=25, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=-65535, var_1_7=-127, var_1_8=2, var_1_9=63] [L85] var_1_15 = __VERIFIER_nondet_long() [L86] CALL assume_abort_if_not(var_1_15 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=-2147483648, var_1_15=-2147483648, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=-65535, var_1_7=-127, var_1_8=2, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=-2147483648, var_1_15=-2147483648, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=-65535, var_1_7=-127, var_1_8=2, var_1_9=63] [L86] RET assume_abort_if_not(var_1_15 >= -2147483648) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=-2147483648, var_1_15=-2147483648, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=-65535, var_1_7=-127, var_1_8=2, var_1_9=63] [L87] CALL assume_abort_if_not(var_1_15 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=-2147483648, var_1_15=-2147483648, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=-65535, var_1_7=-127, var_1_8=2, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=-2147483648, var_1_15=-2147483648, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=-65535, var_1_7=-127, var_1_8=2, var_1_9=63] [L87] RET assume_abort_if_not(var_1_15 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=-2147483648, var_1_15=-2147483648, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=-65535, var_1_7=-127, var_1_8=2, var_1_9=63] [L100] RET updateVariables() [L101] CALL step() [L38] COND FALSE !(((var_1_12 - var_1_13) + var_1_14) <= (256.625 * ((((1.875) > (var_1_15)) ? (1.875) : (var_1_15))))) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=-2147483648, var_1_15=-2147483648, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=-65535, var_1_7=-127, var_1_8=2, var_1_9=63] [L41] COND TRUE \read(var_1_2) [L42] var_1_1 = ((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=-2147483648, var_1_15=-2147483648, var_1_1=16, var_1_2=1, var_1_5=16, var_1_6=-65535, var_1_7=-127, var_1_8=2, var_1_9=63] [L44] COND TRUE (var_1_1 == 16) || (var_1_11 < (10 / var_1_6)) [L45] var_1_5 = var_1_7 VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=-2147483648, var_1_15=-2147483648, var_1_1=16, var_1_2=1, var_1_5=-127, var_1_6=-65535, var_1_7=-127, var_1_8=2, var_1_9=63] [L49] unsigned char stepLocal_1 = var_1_11; [L50] unsigned char stepLocal_0 = var_1_2; VAL [isInitial=1, stepLocal_1=16, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=-2147483648, var_1_15=-2147483648, var_1_1=16, var_1_2=1, var_1_5=-127, var_1_6=-65535, var_1_7=-127, var_1_8=2, var_1_9=63] [L51] COND TRUE stepLocal_0 || (var_1_11 >= var_1_11) VAL [isInitial=1, stepLocal_1=16, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=-2147483648, var_1_15=-2147483648, var_1_1=16, var_1_2=1, var_1_5=-127, var_1_6=-65535, var_1_7=-127, var_1_8=2, var_1_9=63] [L52] COND TRUE stepLocal_1 < ((var_1_9 - var_1_10) - 16) [L53] var_1_8 = ((((var_1_10) > (32)) ? (var_1_10) : (32))) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=-2147483648, var_1_15=-2147483648, var_1_1=16, var_1_2=1, var_1_5=-127, var_1_6=-65535, var_1_7=-127, var_1_8=32, var_1_9=63] [L101] RET step() [L102] CALL, EXPR property() [L92-L93] return (((var_1_2 ? (var_1_1 == ((unsigned short int) ((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))))) : 1) && (((var_1_1 == 16) || (var_1_11 < (10 / var_1_6))) ? (var_1_5 == ((signed char) var_1_7)) : (var_1_5 == ((signed char) 5)))) && ((var_1_2 || (var_1_11 >= var_1_11)) ? ((var_1_11 < ((var_1_9 - var_1_10) - 16)) ? (var_1_8 == ((unsigned short int) ((((var_1_10) > (32)) ? (var_1_10) : (32))))) : 1) : (var_1_8 == ((unsigned short int) ((((var_1_9) < (var_1_11)) ? (var_1_9) : (var_1_11))))))) && ((((var_1_12 - var_1_13) + var_1_14) <= (256.625 * ((((1.875) > (var_1_15)) ? (1.875) : (var_1_15))))) ? (var_1_11 == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1) ; VAL [\result=0, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=-2147483648, var_1_15=-2147483648, var_1_1=16, var_1_2=1, var_1_5=-127, var_1_6=-65535, var_1_7=-127, var_1_8=32, var_1_9=63] [L102] RET, EXPR property() [L102] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=-2147483648, var_1_15=-2147483648, var_1_1=16, var_1_2=1, var_1_5=-127, var_1_6=-65535, var_1_7=-127, var_1_8=32, var_1_9=63] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=-2147483648, var_1_15=-2147483648, var_1_1=16, var_1_2=1, var_1_5=-127, var_1_6=-65535, var_1_7=-127, var_1_8=32, var_1_9=63] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 53 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 2, TraceHistogramMax: 19, 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, 71 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, 71 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred 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.1s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 356 NumberOfCodeBlocks, 356 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 117 ConstructedInterpolants, 0 QuantifiedInterpolants, 117 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 684/684 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-12 04:45:38,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-13.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 70056f6ecf6cc1e792a4daa4b0ef5828c715d2ed64331075caaff01f6900b2e4 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 04:45:40,243 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 04:45:40,319 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 04:45:40,326 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 04:45:40,327 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 04:45:40,356 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 04:45:40,356 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 04:45:40,357 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 04:45:40,357 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 04:45:40,358 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 04:45:40,358 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 04:45:40,359 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 04:45:40,359 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 04:45:40,361 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 04:45:40,361 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 04:45:40,362 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 04:45:40,362 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 04:45:40,362 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 04:45:40,362 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 04:45:40,363 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 04:45:40,363 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 04:45:40,367 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 04:45:40,367 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 04:45:40,367 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 04:45:40,367 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 04:45:40,368 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 04:45:40,368 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 04:45:40,368 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 04:45:40,368 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 04:45:40,368 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 04:45:40,369 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 04:45:40,369 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 04:45:40,369 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 04:45:40,369 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 04:45:40,370 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:45:40,371 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 04:45:40,372 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 04:45:40,372 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 04:45:40,373 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 04:45:40,373 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 04:45:40,373 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 04:45:40,376 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 04:45:40,376 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 04:45:40,377 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 04:45:40,377 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 -> 70056f6ecf6cc1e792a4daa4b0ef5828c715d2ed64331075caaff01f6900b2e4 [2024-11-12 04:45:40,680 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 04:45:40,711 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 04:45:40,715 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 04:45:40,716 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 04:45:40,716 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 04:45:40,717 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-13.i [2024-11-12 04:45:42,308 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 04:45:42,536 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 04:45:42,536 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-13.i [2024-11-12 04:45:42,549 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82ef0de16/c85918fe9262497ab2022f15b0cdc403/FLAGbcac3d347 [2024-11-12 04:45:42,569 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82ef0de16/c85918fe9262497ab2022f15b0cdc403 [2024-11-12 04:45:42,572 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 04:45:42,574 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 04:45:42,575 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 04:45:42,577 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 04:45:42,588 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 04:45:42,589 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:45:42" (1/1) ... [2024-11-12 04:45:42,589 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69e99512 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:42, skipping insertion in model container [2024-11-12 04:45:42,590 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:45:42" (1/1) ... [2024-11-12 04:45:42,614 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 04:45:42,770 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_floatingpointinfluence_no-floats_file-13.i[916,929] [2024-11-12 04:45:42,820 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:45:42,839 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 04:45:42,849 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_floatingpointinfluence_no-floats_file-13.i[916,929] [2024-11-12 04:45:42,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:45:42,902 INFO L204 MainTranslator]: Completed translation [2024-11-12 04:45:42,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:42 WrapperNode [2024-11-12 04:45:42,903 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 04:45:42,904 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 04:45:42,904 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 04:45:42,904 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 04:45:42,910 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:42" (1/1) ... [2024-11-12 04:45:42,921 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:42" (1/1) ... [2024-11-12 04:45:42,945 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 106 [2024-11-12 04:45:42,948 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 04:45:42,949 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 04:45:42,949 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 04:45:42,949 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 04:45:42,958 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:42" (1/1) ... [2024-11-12 04:45:42,958 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:42" (1/1) ... [2024-11-12 04:45:42,961 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:42" (1/1) ... [2024-11-12 04:45:42,984 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-12 04:45:42,984 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:42" (1/1) ... [2024-11-12 04:45:42,984 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:42" (1/1) ... [2024-11-12 04:45:42,993 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:42" (1/1) ... [2024-11-12 04:45:42,996 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:42" (1/1) ... [2024-11-12 04:45:43,001 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:42" (1/1) ... [2024-11-12 04:45:43,002 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:42" (1/1) ... [2024-11-12 04:45:43,008 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 04:45:43,009 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 04:45:43,009 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 04:45:43,009 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 04:45:43,014 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:42" (1/1) ... [2024-11-12 04:45:43,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:45:43,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:45:43,043 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-12 04:45:43,046 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-12 04:45:43,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 04:45:43,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 04:45:43,087 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 04:45:43,087 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 04:45:43,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 04:45:43,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 04:45:43,168 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 04:45:43,170 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 04:45:47,669 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-12 04:45:47,670 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 04:45:47,684 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 04:45:47,685 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 04:45:47,685 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:45:47 BoogieIcfgContainer [2024-11-12 04:45:47,685 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 04:45:47,687 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 04:45:47,688 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 04:45:47,691 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 04:45:47,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:45:42" (1/3) ... [2024-11-12 04:45:47,692 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@437f09d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:45:47, skipping insertion in model container [2024-11-12 04:45:47,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:42" (2/3) ... [2024-11-12 04:45:47,693 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@437f09d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:45:47, skipping insertion in model container [2024-11-12 04:45:47,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:45:47" (3/3) ... [2024-11-12 04:45:47,696 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-13.i [2024-11-12 04:45:47,710 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 04:45:47,711 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 04:45:47,779 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 04:45:47,794 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;@7825a8bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 04:45:47,795 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 04:45:47,802 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-12 04:45:47,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-12 04:45:47,820 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:45:47,820 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:45:47,821 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:45:47,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:45:47,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1848977806, now seen corresponding path program 1 times [2024-11-12 04:45:47,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:45:47,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [109788148] [2024-11-12 04:45:47,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:45:47,845 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-12 04:45:47,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:45:47,848 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-12 04:45:47,850 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-12 04:45:48,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:48,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 04:45:48,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:45:48,152 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2024-11-12 04:45:48,152 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 04:45:48,153 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 04:45:48,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [109788148] [2024-11-12 04:45:48,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [109788148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:45:48,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:45:48,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 04:45:48,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121776097] [2024-11-12 04:45:48,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:45:48,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 04:45:48,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 04:45:48,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 04:45:48,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:45:48,183 INFO L87 Difference]: Start difference. First operand has 53 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-12 04:45:48,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:45:48,202 INFO L93 Difference]: Finished difference Result 99 states and 171 transitions. [2024-11-12 04:45:48,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 04:45:48,204 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 118 [2024-11-12 04:45:48,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:45:48,209 INFO L225 Difference]: With dead ends: 99 [2024-11-12 04:45:48,209 INFO L226 Difference]: Without dead ends: 49 [2024-11-12 04:45:48,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 117 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-12 04:45:48,215 INFO L435 NwaCegarLoop]: 71 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, 71 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-12 04:45:48,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:45:48,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-12 04:45:48,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-12 04:45:48,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-12 04:45:48,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 71 transitions. [2024-11-12 04:45:48,254 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 71 transitions. Word has length 118 [2024-11-12 04:45:48,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:45:48,254 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 71 transitions. [2024-11-12 04:45:48,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-12 04:45:48,254 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 71 transitions. [2024-11-12 04:45:48,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-12 04:45:48,259 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:45:48,274 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:45:48,285 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-12 04:45:48,478 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-12 04:45:48,479 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:45:48,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:45:48,480 INFO L85 PathProgramCache]: Analyzing trace with hash -609254647, now seen corresponding path program 1 times [2024-11-12 04:45:48,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:45:48,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1631333781] [2024-11-12 04:45:48,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:45:48,481 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-12 04:45:48,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:45:48,485 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-12 04:45:48,486 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-12 04:45:48,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:48,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-12 04:45:48,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:46:06,723 WARN L286 SmtUtils]: Spent 5.83s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-12 04:46:28,667 WARN L286 SmtUtils]: Spent 12.65s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-12 04:47:03,003 WARN L286 SmtUtils]: Spent 16.20s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)