./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-17.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-17.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 d57f7f362b600066c4a4932824c94646446bdcbd9ecdad935cd626673dca9b2a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:42:14,482 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:42:14,572 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 10:42:14,579 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:42:14,579 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:42:14,623 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:42:14,626 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:42:14,627 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:42:14,627 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:42:14,628 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:42:14,628 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:42:14,629 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:42:14,629 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:42:14,630 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:42:14,632 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:42:14,633 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:42:14,633 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:42:14,633 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:42:14,634 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 10:42:14,634 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:42:14,634 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:42:14,638 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:42:14,639 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:42:14,639 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:42:14,639 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:42:14,639 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:42:14,639 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:42:14,640 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:42:14,640 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:42:14,640 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:42:14,640 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:42:14,641 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:42:14,641 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:42:14,641 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:42:14,641 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:42:14,642 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:42:14,642 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 10:42:14,642 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 10:42:14,644 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:42:14,644 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:42:14,645 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:42:14,645 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:42:14,645 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-clean/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-clean/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 -> d57f7f362b600066c4a4932824c94646446bdcbd9ecdad935cd626673dca9b2a [2024-10-11 10:42:14,917 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:42:14,940 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:42:14,943 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:42:14,944 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:42:14,944 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:42:14,945 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-17.i [2024-10-11 10:42:16,345 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:42:16,570 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:42:16,571 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-17.i [2024-10-11 10:42:16,579 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/95203f17e/913ed21109054bc7ba65e27e8197423b/FLAG5c9fbfff0 [2024-10-11 10:42:16,595 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/95203f17e/913ed21109054bc7ba65e27e8197423b [2024-10-11 10:42:16,597 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:42:16,598 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:42:16,599 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:42:16,599 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:42:16,605 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:42:16,606 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:42:16" (1/1) ... [2024-10-11 10:42:16,607 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a041429 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:42:16, skipping insertion in model container [2024-10-11 10:42:16,607 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:42:16" (1/1) ... [2024-10-11 10:42:16,645 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:42:16,818 WARN L248 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_has-floats_file-17.i[917,930] [2024-10-11 10:42:16,885 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:42:16,900 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:42:16,914 WARN L248 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_has-floats_file-17.i[917,930] [2024-10-11 10:42:16,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:42:16,969 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:42:16,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:42:16 WrapperNode [2024-10-11 10:42:16,970 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:42:16,971 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:42:16,972 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:42:16,972 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:42:16,979 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:42:16" (1/1) ... [2024-10-11 10:42:16,990 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:42:16" (1/1) ... [2024-10-11 10:42:17,025 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 120 [2024-10-11 10:42:17,026 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:42:17,026 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:42:17,026 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:42:17,027 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:42:17,038 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:42:16" (1/1) ... [2024-10-11 10:42:17,038 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:42:16" (1/1) ... [2024-10-11 10:42:17,041 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:42:16" (1/1) ... [2024-10-11 10:42:17,058 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-10-11 10:42:17,058 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:42:16" (1/1) ... [2024-10-11 10:42:17,059 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:42:16" (1/1) ... [2024-10-11 10:42:17,065 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:42:16" (1/1) ... [2024-10-11 10:42:17,068 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:42:16" (1/1) ... [2024-10-11 10:42:17,069 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:42:16" (1/1) ... [2024-10-11 10:42:17,071 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:42:16" (1/1) ... [2024-10-11 10:42:17,073 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:42:17,074 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:42:17,074 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:42:17,074 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:42:17,077 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:42:16" (1/1) ... [2024-10-11 10:42:17,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:42:17,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:42:17,116 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 10:42:17,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 10:42:17,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:42:17,157 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:42:17,158 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:42:17,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 10:42:17,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:42:17,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:42:17,228 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:42:17,231 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:42:17,471 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-11 10:42:17,471 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:42:17,504 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:42:17,504 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:42:17,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:42:17 BoogieIcfgContainer [2024-10-11 10:42:17,505 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:42:17,507 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:42:17,507 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:42:17,512 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:42:17,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:42:16" (1/3) ... [2024-10-11 10:42:17,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f348714 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:42:17, skipping insertion in model container [2024-10-11 10:42:17,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:42:16" (2/3) ... [2024-10-11 10:42:17,514 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f348714 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:42:17, skipping insertion in model container [2024-10-11 10:42:17,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:42:17" (3/3) ... [2024-10-11 10:42:17,515 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-17.i [2024-10-11 10:42:17,529 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:42:17,530 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:42:17,591 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:42:17,597 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;@7da60b55, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:42:17,597 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:42:17,601 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 10:42:17,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 10:42:17,611 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:42:17,611 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 10:42:17,612 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:42:17,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:42:17,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1966908938, now seen corresponding path program 1 times [2024-10-11 10:42:17,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:42:17,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685638052] [2024-10-11 10:42:17,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:42:17,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:42:17,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:42:17,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:42:17,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:42:17,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:42:17,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:42:17,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:42:17,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:42:17,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 10:42:17,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:42:17,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 10:42:17,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:42:17,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 10:42:17,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:42:17,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 10:42:17,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:42:17,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 10:42:17,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:42:17,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 10:42:17,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:42:17,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 10:42:17,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:42:17,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 10:42:17,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:42:17,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 10:42:17,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:42:17,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 10:42:17,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:42:17,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 10:42:17,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:42:17,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 10:42:17,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:42:18,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 10:42:18,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:42:18,010 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 10:42:18,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:42:18,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685638052] [2024-10-11 10:42:18,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685638052] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:42:18,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:42:18,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:42:18,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328099143] [2024-10-11 10:42:18,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:42:18,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:42:18,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:42:18,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:42:18,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:42:18,104 INFO L87 Difference]: Start difference. First operand has 47 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 10:42:18,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:42:18,148 INFO L93 Difference]: Finished difference Result 91 states and 158 transitions. [2024-10-11 10:42:18,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:42:18,152 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 100 [2024-10-11 10:42:18,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:42:18,161 INFO L225 Difference]: With dead ends: 91 [2024-10-11 10:42:18,161 INFO L226 Difference]: Without dead ends: 45 [2024-10-11 10:42:18,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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-10-11 10:42:18,171 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:42:18,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:42:18,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-11 10:42:18,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-10-11 10:42:18,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 10:42:18,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 67 transitions. [2024-10-11 10:42:18,211 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 67 transitions. Word has length 100 [2024-10-11 10:42:18,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:42:18,212 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 67 transitions. [2024-10-11 10:42:18,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 10:42:18,212 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 67 transitions. [2024-10-11 10:42:18,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 10:42:18,218 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:42:18,218 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 10:42:18,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 10:42:18,219 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:42:18,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:42:18,219 INFO L85 PathProgramCache]: Analyzing trace with hash 904754814, now seen corresponding path program 1 times [2024-10-11 10:42:18,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:42:18,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375535297] [2024-10-11 10:42:18,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:42:18,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:42:18,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:42:18,384 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 10:42:18,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:42:18,477 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 10:42:18,478 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 10:42:18,480 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 10:42:18,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 10:42:18,484 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-11 10:42:18,568 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 10:42:18,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 10:42:18 BoogieIcfgContainer [2024-10-11 10:42:18,572 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 10:42:18,572 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 10:42:18,572 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 10:42:18,572 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 10:42:18,573 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:42:17" (3/4) ... [2024-10-11 10:42:18,577 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 10:42:18,578 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 10:42:18,580 INFO L158 Benchmark]: Toolchain (without parser) took 1980.70ms. Allocated memory is still 176.2MB. Free memory was 145.9MB in the beginning and 110.1MB in the end (delta: 35.7MB). Peak memory consumption was 33.3MB. Max. memory is 16.1GB. [2024-10-11 10:42:18,580 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 125.8MB. Free memory is still 88.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:42:18,582 INFO L158 Benchmark]: CACSL2BoogieTranslator took 371.27ms. Allocated memory is still 176.2MB. Free memory was 145.6MB in the beginning and 134.8MB in the end (delta: 10.8MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. [2024-10-11 10:42:18,582 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.58ms. Allocated memory is still 176.2MB. Free memory was 134.8MB in the beginning and 132.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 10:42:18,582 INFO L158 Benchmark]: Boogie Preprocessor took 46.96ms. Allocated memory is still 176.2MB. Free memory was 132.0MB in the beginning and 129.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 10:42:18,586 INFO L158 Benchmark]: RCFGBuilder took 430.78ms. Allocated memory is still 176.2MB. Free memory was 129.3MB in the beginning and 111.8MB in the end (delta: 17.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-11 10:42:18,587 INFO L158 Benchmark]: TraceAbstraction took 1064.74ms. Allocated memory is still 176.2MB. Free memory was 111.0MB in the beginning and 111.2MB in the end (delta: -173.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:42:18,587 INFO L158 Benchmark]: Witness Printer took 6.15ms. Allocated memory is still 176.2MB. Free memory was 111.2MB in the beginning and 110.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 10:42:18,589 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.10ms. Allocated memory is still 125.8MB. Free memory is still 88.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 371.27ms. Allocated memory is still 176.2MB. Free memory was 145.6MB in the beginning and 134.8MB in the end (delta: 10.8MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.58ms. Allocated memory is still 176.2MB. Free memory was 134.8MB in the beginning and 132.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.96ms. Allocated memory is still 176.2MB. Free memory was 132.0MB in the beginning and 129.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 430.78ms. Allocated memory is still 176.2MB. Free memory was 129.3MB in the beginning and 111.8MB in the end (delta: 17.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1064.74ms. Allocated memory is still 176.2MB. Free memory was 111.0MB in the beginning and 111.2MB in the end (delta: -173.8kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 6.15ms. Allocated memory is still 176.2MB. Free memory was 111.2MB in the beginning and 110.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 103, overapproximation of someBinaryFLOATComparisonOperation at line 103, overapproximation of someBinaryArithmeticDOUBLEoperation at line 53. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 10000000.8; [L23] unsigned char var_1_2 = 0; [L24] double var_1_3 = 16.2; [L25] double var_1_4 = 7.5; [L26] double var_1_5 = 49.6; [L27] signed short int var_1_6 = -10; [L28] double var_1_7 = 4.5; [L29] double var_1_8 = 9.4; [L30] signed short int var_1_9 = 128; [L31] signed short int var_1_10 = 128; [L32] unsigned char var_1_11 = 0; [L33] unsigned long int var_1_12 = 100; [L34] float var_1_13 = 128.4; [L35] double var_1_14 = 3.5; [L36] unsigned char var_1_15 = 16; [L37] unsigned char var_1_16 = 2; [L38] unsigned char last_1_var_1_15 = 16; [L107] isInitial = 1 [L108] FCALL initially() [L109] COND TRUE 1 [L110] CALL updateLastVariables() [L100] last_1_var_1_15 = var_1_15 [L110] RET updateLastVariables() [L111] CALL updateVariables() [L71] var_1_2 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_3=81/5, var_1_4=15/2, var_1_5=248/5, var_1_6=-10, var_1_7=9/2, var_1_8=47/5, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_3=81/5, var_1_4=15/2, var_1_5=248/5, var_1_6=-10, var_1_7=9/2, var_1_8=47/5, var_1_9=128] [L72] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_3=81/5, var_1_4=15/2, var_1_5=248/5, var_1_6=-10, var_1_7=9/2, var_1_8=47/5, var_1_9=128] [L73] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_3=81/5, var_1_4=15/2, var_1_5=248/5, var_1_6=-10, var_1_7=9/2, var_1_8=47/5, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_3=81/5, var_1_4=15/2, var_1_5=248/5, var_1_6=-10, var_1_7=9/2, var_1_8=47/5, var_1_9=128] [L73] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_3=81/5, var_1_4=15/2, var_1_5=248/5, var_1_6=-10, var_1_7=9/2, var_1_8=47/5, var_1_9=128] [L74] var_1_3 = __VERIFIER_nondet_double() [L75] CALL assume_abort_if_not((var_1_3 >= -461168.6018427382800e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 4611686.018427382800e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_4=15/2, var_1_5=248/5, var_1_6=-10, var_1_7=9/2, var_1_8=47/5, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_4=15/2, var_1_5=248/5, var_1_6=-10, var_1_7=9/2, var_1_8=47/5, var_1_9=128] [L75] RET assume_abort_if_not((var_1_3 >= -461168.6018427382800e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 4611686.018427382800e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_4=15/2, var_1_5=248/5, var_1_6=-10, var_1_7=9/2, var_1_8=47/5, var_1_9=128] [L76] var_1_4 = __VERIFIER_nondet_double() [L77] CALL assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_5=248/5, var_1_6=-10, var_1_7=9/2, var_1_8=47/5, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_5=248/5, var_1_6=-10, var_1_7=9/2, var_1_8=47/5, var_1_9=128] [L77] RET assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_5=248/5, var_1_6=-10, var_1_7=9/2, var_1_8=47/5, var_1_9=128] [L78] var_1_5 = __VERIFIER_nondet_double() [L79] CALL assume_abort_if_not((var_1_5 >= -230584.3009213691390e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 2305843.009213691390e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_7=9/2, var_1_8=47/5, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_7=9/2, var_1_8=47/5, var_1_9=128] [L79] RET assume_abort_if_not((var_1_5 >= -230584.3009213691390e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 2305843.009213691390e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_7=9/2, var_1_8=47/5, var_1_9=128] [L80] var_1_7 = __VERIFIER_nondet_double() [L81] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_8=47/5, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_8=47/5, var_1_9=128] [L81] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_8=47/5, var_1_9=128] [L82] var_1_8 = __VERIFIER_nondet_double() [L83] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_9=128] [L83] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_9=128] [L84] var_1_9 = __VERIFIER_nondet_short() [L85] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_9=0] [L85] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_9=0] [L86] CALL assume_abort_if_not(var_1_9 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_9=0] [L86] RET assume_abort_if_not(var_1_9 <= 16383) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_9=0] [L87] var_1_10 = __VERIFIER_nondet_short() [L88] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=1, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=1, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_9=0] [L88] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=1, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_9=0] [L89] CALL assume_abort_if_not(var_1_10 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=1, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=1, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_9=0] [L89] RET assume_abort_if_not(var_1_10 <= 32766) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=1, var_1_11=0, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_9=0] [L90] var_1_11 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=1, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=1, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_9=0] [L91] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=1, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_9=0] [L92] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=1, var_1_11=1, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=1, var_1_11=1, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_9=0] [L92] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=1, var_1_11=1, var_1_12=100, var_1_13=642/5, var_1_14=7/2, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_9=0] [L93] var_1_14 = __VERIFIER_nondet_double() [L94] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=1, var_1_11=1, var_1_12=100, var_1_13=642/5, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=1, var_1_11=1, var_1_12=100, var_1_13=642/5, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_9=0] [L94] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=1, var_1_11=1, var_1_12=100, var_1_13=642/5, var_1_15=16, var_1_16=2, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_9=0] [L95] var_1_16 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=1, var_1_11=1, var_1_12=100, var_1_13=642/5, var_1_15=16, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=1, var_1_11=1, var_1_12=100, var_1_13=642/5, var_1_15=16, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_9=0] [L96] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=1, var_1_11=1, var_1_12=100, var_1_13=642/5, var_1_15=16, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_9=0] [L97] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=1, var_1_11=1, var_1_12=100, var_1_13=642/5, var_1_15=16, var_1_16=254, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=1, var_1_11=1, var_1_12=100, var_1_13=642/5, var_1_15=16, var_1_16=254, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_9=0] [L97] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=1, var_1_11=1, var_1_12=100, var_1_13=642/5, var_1_15=16, var_1_16=254, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_9=0] [L111] RET updateVariables() [L112] CALL step() [L42] var_1_12 = last_1_var_1_15 [L43] unsigned long int stepLocal_1 = var_1_12; [L44] signed short int stepLocal_0 = var_1_9; VAL [isInitial=1, last_1_var_1_15=16, stepLocal_0=0, stepLocal_1=16, var_1_10=1, var_1_11=1, var_1_12=16, var_1_13=642/5, var_1_15=16, var_1_16=254, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_9=0] [L45] COND FALSE !(stepLocal_0 >= var_1_10) VAL [isInitial=1, last_1_var_1_15=16, stepLocal_1=16, var_1_10=1, var_1_11=1, var_1_12=16, var_1_13=642/5, var_1_15=16, var_1_16=254, var_1_1=50000004/5, var_1_2=1, var_1_6=-10, var_1_9=0] [L52] COND TRUE \read(var_1_2) [L53] var_1_1 = (var_1_3 + ((((var_1_4) < ((49.5 + var_1_5))) ? (var_1_4) : ((49.5 + var_1_5))))) VAL [isInitial=1, last_1_var_1_15=16, stepLocal_1=16, var_1_10=1, var_1_11=1, var_1_12=16, var_1_13=642/5, var_1_15=16, var_1_16=254, var_1_2=1, var_1_6=-10, var_1_9=0] [L55] COND TRUE (- (var_1_7 - var_1_8)) <= var_1_3 [L56] var_1_6 = ((8 + var_1_15) - var_1_15) VAL [isInitial=1, last_1_var_1_15=16, stepLocal_1=16, var_1_10=1, var_1_11=1, var_1_12=16, var_1_13=642/5, var_1_15=16, var_1_16=254, var_1_2=1, var_1_6=8, var_1_9=0] [L66] COND TRUE var_1_7 < (var_1_8 - var_1_14) [L67] var_1_13 = ((((var_1_4) > (((((((((127.4f) > (var_1_5)) ? (127.4f) : (var_1_5)))) > (var_1_3)) ? (((((127.4f) > (var_1_5)) ? (127.4f) : (var_1_5)))) : (var_1_3))))) ? (var_1_4) : (((((((((127.4f) > (var_1_5)) ? (127.4f) : (var_1_5)))) > (var_1_3)) ? (((((127.4f) > (var_1_5)) ? (127.4f) : (var_1_5)))) : (var_1_3)))))) VAL [isInitial=1, last_1_var_1_15=16, stepLocal_1=16, var_1_10=1, var_1_11=1, var_1_12=16, var_1_13=637/5, var_1_15=16, var_1_16=254, var_1_2=1, var_1_3=637/5, var_1_4=637/5, var_1_5=637/5, var_1_6=8, var_1_9=0] [L112] RET step() [L113] CALL, EXPR property() [L103-L104] return ((((var_1_2 ? (var_1_1 == ((double) (var_1_3 + ((((var_1_4) < ((49.5 + var_1_5))) ? (var_1_4) : ((49.5 + var_1_5))))))) : 1) && (((- (var_1_7 - var_1_8)) <= var_1_3) ? (var_1_6 == ((signed short int) ((8 + var_1_15) - var_1_15))) : (var_1_2 ? (var_1_11 ? (var_1_6 == ((signed short int) var_1_15)) : 1) : (var_1_6 == ((signed short int) var_1_15))))) && (var_1_12 == ((unsigned long int) last_1_var_1_15))) && ((var_1_7 < (var_1_8 - var_1_14)) ? (var_1_13 == ((float) ((((var_1_4) > (((((((((127.4f) > (var_1_5)) ? (127.4f) : (var_1_5)))) > (var_1_3)) ? (((((127.4f) > (var_1_5)) ? (127.4f) : (var_1_5)))) : (var_1_3))))) ? (var_1_4) : (((((((((127.4f) > (var_1_5)) ? (127.4f) : (var_1_5)))) > (var_1_3)) ? (((((127.4f) > (var_1_5)) ? (127.4f) : (var_1_5)))) : (var_1_3)))))))) : 1)) && ((var_1_9 >= var_1_10) ? (((var_1_9 + last_1_var_1_15) >= var_1_12) ? (var_1_15 == ((unsigned char) var_1_16)) : (var_1_15 == ((unsigned char) var_1_16))) : 1) ; [L113] RET, EXPR property() [L113] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=1, var_1_11=1, var_1_12=16, var_1_13=637/5, var_1_15=16, var_1_16=254, var_1_2=1, var_1_3=637/5, var_1_4=637/5, var_1_5=637/5, var_1_6=8, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=16, var_1_10=1, var_1_11=1, var_1_12=16, var_1_13=637/5, var_1_15=16, var_1_16=254, var_1_2=1, var_1_3=637/5, var_1_4=637/5, var_1_5=637/5, var_1_6=8, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 47 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 2, TraceHistogramMax: 16, 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, 64 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 64 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 200 NumberOfCodeBlocks, 200 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 99 ConstructedInterpolants, 0 QuantifiedInterpolants, 99 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 480/480 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-10-11 10:42:18,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-17.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 d57f7f362b600066c4a4932824c94646446bdcbd9ecdad935cd626673dca9b2a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:42:20,903 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:42:20,985 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 10:42:20,993 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:42:20,993 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:42:21,025 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:42:21,028 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:42:21,028 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:42:21,029 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:42:21,030 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:42:21,030 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:42:21,031 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:42:21,031 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:42:21,033 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:42:21,033 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:42:21,034 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:42:21,034 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:42:21,034 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:42:21,035 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:42:21,035 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:42:21,035 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:42:21,039 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:42:21,040 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:42:21,040 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 10:42:21,040 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 10:42:21,040 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:42:21,040 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 10:42:21,041 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:42:21,041 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:42:21,041 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:42:21,041 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:42:21,042 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:42:21,042 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:42:21,042 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:42:21,042 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:42:21,043 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:42:21,043 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:42:21,043 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:42:21,045 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 10:42:21,045 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 10:42:21,046 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:42:21,046 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:42:21,046 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:42:21,046 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:42:21,047 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 10:42:21,047 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-clean/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-clean/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 -> d57f7f362b600066c4a4932824c94646446bdcbd9ecdad935cd626673dca9b2a [2024-10-11 10:42:21,375 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:42:21,397 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:42:21,401 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:42:21,402 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:42:21,402 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:42:21,404 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-17.i [2024-10-11 10:42:23,040 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:42:23,268 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:42:23,269 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-17.i [2024-10-11 10:42:23,283 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fa53a5f16/80f6becc41004260b5ae4bd1925ba01c/FLAG3f2a45472 [2024-10-11 10:42:23,305 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fa53a5f16/80f6becc41004260b5ae4bd1925ba01c [2024-10-11 10:42:23,308 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:42:23,310 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:42:23,314 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:42:23,314 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:42:23,326 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:42:23,327 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:42:23" (1/1) ... [2024-10-11 10:42:23,327 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dcedf85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:42:23, skipping insertion in model container [2024-10-11 10:42:23,328 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:42:23" (1/1) ... [2024-10-11 10:42:23,356 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:42:23,538 WARN L248 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_has-floats_file-17.i[917,930] [2024-10-11 10:42:23,599 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:42:23,616 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:42:23,630 WARN L248 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_has-floats_file-17.i[917,930] [2024-10-11 10:42:23,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:42:23,683 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:42:23,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:42:23 WrapperNode [2024-10-11 10:42:23,684 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:42:23,685 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:42:23,685 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:42:23,685 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:42:23,692 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:42:23" (1/1) ... [2024-10-11 10:42:23,709 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:42:23" (1/1) ... [2024-10-11 10:42:23,744 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 118 [2024-10-11 10:42:23,745 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:42:23,746 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:42:23,746 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:42:23,746 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:42:23,756 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:42:23" (1/1) ... [2024-10-11 10:42:23,757 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:42:23" (1/1) ... [2024-10-11 10:42:23,764 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:42:23" (1/1) ... [2024-10-11 10:42:23,780 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-10-11 10:42:23,780 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:42:23" (1/1) ... [2024-10-11 10:42:23,781 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:42:23" (1/1) ... [2024-10-11 10:42:23,797 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:42:23" (1/1) ... [2024-10-11 10:42:23,800 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:42:23" (1/1) ... [2024-10-11 10:42:23,802 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:42:23" (1/1) ... [2024-10-11 10:42:23,803 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:42:23" (1/1) ... [2024-10-11 10:42:23,806 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:42:23,807 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:42:23,807 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:42:23,807 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:42:23,808 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:42:23" (1/1) ... [2024-10-11 10:42:23,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:42:23,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:42:23,850 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 10:42:23,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 10:42:23,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:42:23,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 10:42:23,889 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:42:23,889 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:42:23,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:42:23,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:42:23,991 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:42:23,993 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:42:29,573 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-11 10:42:29,573 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:42:29,627 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:42:29,630 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:42:29,630 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:42:29 BoogieIcfgContainer [2024-10-11 10:42:29,630 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:42:29,632 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:42:29,632 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:42:29,637 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:42:29,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:42:23" (1/3) ... [2024-10-11 10:42:29,639 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41bcf59b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:42:29, skipping insertion in model container [2024-10-11 10:42:29,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:42:23" (2/3) ... [2024-10-11 10:42:29,640 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41bcf59b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:42:29, skipping insertion in model container [2024-10-11 10:42:29,640 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:42:29" (3/3) ... [2024-10-11 10:42:29,642 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-17.i [2024-10-11 10:42:29,658 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:42:29,658 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:42:29,739 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:42:29,745 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;@162890f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:42:29,746 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:42:29,750 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 10:42:29,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 10:42:29,762 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:42:29,763 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 10:42:29,763 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:42:29,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:42:29,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1966908938, now seen corresponding path program 1 times [2024-10-11 10:42:29,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:42:29,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1460624210] [2024-10-11 10:42:29,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:42:29,785 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-10-11 10:42:29,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:42:29,789 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-10-11 10:42:29,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 10:42:30,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:42:30,199 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 10:42:30,212 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:42:30,259 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-10-11 10:42:30,259 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:42:30,260 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:42:30,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1460624210] [2024-10-11 10:42:30,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1460624210] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:42:30,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:42:30,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:42:30,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560998822] [2024-10-11 10:42:30,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:42:30,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:42:30,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:42:30,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:42:30,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:42:30,293 INFO L87 Difference]: Start difference. First operand has 47 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 10:42:32,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:42:32,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:42:32,993 INFO L93 Difference]: Finished difference Result 91 states and 158 transitions. [2024-10-11 10:42:33,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:42:33,027 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 100 [2024-10-11 10:42:33,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:42:33,034 INFO L225 Difference]: With dead ends: 91 [2024-10-11 10:42:33,034 INFO L226 Difference]: Without dead ends: 45 [2024-10-11 10:42:33,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 99 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-10-11 10:42:33,039 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-11 10:42:33,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-11 10:42:33,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-11 10:42:33,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-10-11 10:42:33,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 10:42:33,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 67 transitions. [2024-10-11 10:42:33,081 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 67 transitions. Word has length 100 [2024-10-11 10:42:33,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:42:33,082 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 67 transitions. [2024-10-11 10:42:33,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 10:42:33,082 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 67 transitions. [2024-10-11 10:42:33,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 10:42:33,086 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:42:33,086 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 10:42:33,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 10:42:33,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-10-11 10:42:33,288 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:42:33,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:42:33,288 INFO L85 PathProgramCache]: Analyzing trace with hash 904754814, now seen corresponding path program 1 times [2024-10-11 10:42:33,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:42:33,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [217042118] [2024-10-11 10:42:33,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:42:33,290 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-10-11 10:42:33,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:42:33,292 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-10-11 10:42:33,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 10:42:33,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:42:33,784 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-11 10:42:33,794 INFO L278 TraceCheckSpWp]: Computing forward predicates...