/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.smt.solver External_ModelsAndUnsatCoreMode --traceabstraction.command.for.external.solver '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' -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-95.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-03 07:51:55,969 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-03 07:51:56,027 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-03 07:51:56,031 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-03 07:51:56,032 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-03 07:51:56,067 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-03 07:51:56,068 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-03 07:51:56,068 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-03 07:51:56,068 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-03 07:51:56,069 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-03 07:51:56,069 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-03 07:51:56,069 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-03 07:51:56,070 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-03 07:51:56,070 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-03 07:51:56,071 INFO L153 SettingsManager]: * Use SBE=true [2024-11-03 07:51:56,071 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-03 07:51:56,071 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-03 07:51:56,072 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-03 07:51:56,072 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-03 07:51:56,074 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-03 07:51:56,074 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-03 07:51:56,078 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-03 07:51:56,079 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-03 07:51:56,079 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-03 07:51:56,079 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-03 07:51:56,079 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-03 07:51:56,080 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-03 07:51:56,080 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-03 07:51:56,080 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-03 07:51:56,080 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-03 07:51:56,081 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-03 07:51:56,081 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-03 07:51:56,081 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-03 07:51:56,081 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-03 07:51:56,081 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-03 07:51:56,082 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-03 07:51:56,082 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-03 07:51:56,083 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-03 07:51:56,083 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-03 07:51:56,084 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-03 07:51:56,084 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-03 07:51:56,084 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-03 07:51:56,084 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-03 07:51:56,085 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-03 07:51:56,085 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Command for external solver -> mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-03 07:51:56,303 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-03 07:51:56,329 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-03 07:51:56,334 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-03 07:51:56,337 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-03 07:51:56,337 INFO L274 PluginConnector]: CDTParser initialized [2024-11-03 07:51:56,339 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-95.i [2024-11-03 07:51:57,817 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-03 07:51:58,023 INFO L384 CDTParser]: Found 1 translation units. [2024-11-03 07:51:58,024 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-95.i [2024-11-03 07:51:58,035 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8b2febb2/df695af2b4a24a87b29228a59e52a402/FLAG853b19464 [2024-11-03 07:51:58,050 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8b2febb2/df695af2b4a24a87b29228a59e52a402 [2024-11-03 07:51:58,053 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-03 07:51:58,054 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-03 07:51:58,055 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-03 07:51:58,055 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-03 07:51:58,060 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-03 07:51:58,061 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 07:51:58" (1/1) ... [2024-11-03 07:51:58,061 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d4f8f54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 07:51:58, skipping insertion in model container [2024-11-03 07:51:58,061 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 07:51:58" (1/1) ... [2024-11-03 07:51:58,084 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-03 07:51:58,230 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-95.i[916,929] [2024-11-03 07:51:58,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-03 07:51:58,289 INFO L200 MainTranslator]: Completed pre-run [2024-11-03 07:51:58,300 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-95.i[916,929] [2024-11-03 07:51:58,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-03 07:51:58,346 INFO L204 MainTranslator]: Completed translation [2024-11-03 07:51:58,347 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 07:51:58 WrapperNode [2024-11-03 07:51:58,347 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-03 07:51:58,348 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-03 07:51:58,348 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-03 07:51:58,348 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-03 07:51:58,354 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 07:51:58" (1/1) ... [2024-11-03 07:51:58,365 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 07:51:58" (1/1) ... [2024-11-03 07:51:58,389 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2024-11-03 07:51:58,391 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-03 07:51:58,392 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-03 07:51:58,392 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-03 07:51:58,392 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-03 07:51:58,401 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 07:51:58" (1/1) ... [2024-11-03 07:51:58,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 07:51:58" (1/1) ... [2024-11-03 07:51:58,406 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 07:51:58" (1/1) ... [2024-11-03 07:51:58,419 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-03 07:51:58,420 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 07:51:58" (1/1) ... [2024-11-03 07:51:58,420 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 07:51:58" (1/1) ... [2024-11-03 07:51:58,428 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 07:51:58" (1/1) ... [2024-11-03 07:51:58,433 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 07:51:58" (1/1) ... [2024-11-03 07:51:58,435 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 07:51:58" (1/1) ... [2024-11-03 07:51:58,458 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 07:51:58" (1/1) ... [2024-11-03 07:51:58,463 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-03 07:51:58,464 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-03 07:51:58,464 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-03 07:51:58,464 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-03 07:51:58,465 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 07:51:58" (1/1) ... [2024-11-03 07:51:58,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-03 07:51:58,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-03 07:51:58,502 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-03 07:51:58,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-03 07:51:58,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-03 07:51:58,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-03 07:51:58,544 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-03 07:51:58,544 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-03 07:51:58,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-03 07:51:58,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-03 07:51:58,641 INFO L238 CfgBuilder]: Building ICFG [2024-11-03 07:51:58,644 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-03 07:52:05,204 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-03 07:52:05,204 INFO L287 CfgBuilder]: Performing block encoding [2024-11-03 07:52:05,215 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-03 07:52:05,215 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-03 07:52:05,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 07:52:05 BoogieIcfgContainer [2024-11-03 07:52:05,216 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-03 07:52:05,219 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-03 07:52:05,219 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-03 07:52:05,222 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-03 07:52:05,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 07:51:58" (1/3) ... [2024-11-03 07:52:05,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@789e09a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 07:52:05, skipping insertion in model container [2024-11-03 07:52:05,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 07:51:58" (2/3) ... [2024-11-03 07:52:05,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@789e09a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 07:52:05, skipping insertion in model container [2024-11-03 07:52:05,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 07:52:05" (3/3) ... [2024-11-03 07:52:05,226 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-95.i [2024-11-03 07:52:05,244 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-03 07:52:05,245 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-03 07:52:05,298 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-03 07:52:05,303 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;@5a75c14e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-03 07:52:05,304 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-03 07:52:05,307 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 29 states have internal predecessors, (36), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-03 07:52:05,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-03 07:52:05,317 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 07:52:05,317 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 07:52:05,318 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 07:52:05,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 07:52:05,322 INFO L85 PathProgramCache]: Analyzing trace with hash 311912880, now seen corresponding path program 1 times [2024-11-03 07:52:05,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 07:52:05,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [111507161] [2024-11-03 07:52:05,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 07:52:05,333 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-03 07:52:05,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 07:52:05,337 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-03 07:52:05,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-03 07:52:05,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 07:52:05,629 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-03 07:52:05,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 07:52:05,695 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-11-03 07:52:05,695 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 07:52:05,940 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 18 proven. 18 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2024-11-03 07:52:05,944 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 07:52:05,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [111507161] [2024-11-03 07:52:05,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [111507161] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-03 07:52:05,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-03 07:52:05,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-03 07:52:05,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619174186] [2024-11-03 07:52:05,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-03 07:52:05,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-03 07:52:05,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 07:52:05,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-03 07:52:05,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-03 07:52:05,979 INFO L87 Difference]: Start difference. First operand has 50 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 29 states have internal predecessors, (36), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-03 07:52:05,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 07:52:05,999 INFO L93 Difference]: Finished difference Result 93 states and 161 transitions. [2024-11-03 07:52:06,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-03 07:52:06,001 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, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 115 [2024-11-03 07:52:06,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 07:52:06,006 INFO L225 Difference]: With dead ends: 93 [2024-11-03 07:52:06,006 INFO L226 Difference]: Without dead ends: 46 [2024-11-03 07:52:06,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-03 07:52:06,012 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-03 07:52:06,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-03 07:52:06,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-03 07:52:06,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-03 07:52:06,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-03 07:52:06,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 66 transitions. [2024-11-03 07:52:06,056 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 66 transitions. Word has length 115 [2024-11-03 07:52:06,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 07:52:06,058 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 66 transitions. [2024-11-03 07:52:06,059 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, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-03 07:52:06,059 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 66 transitions. [2024-11-03 07:52:06,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-03 07:52:06,065 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 07:52:06,065 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 07:52:06,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-03 07:52:06,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-03 07:52:06,267 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 07:52:06,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 07:52:06,268 INFO L85 PathProgramCache]: Analyzing trace with hash 470655502, now seen corresponding path program 1 times [2024-11-03 07:52:06,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 07:52:06,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [213388374] [2024-11-03 07:52:06,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 07:52:06,268 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-03 07:52:06,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 07:52:06,270 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-03 07:52:06,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-03 07:52:06,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 07:52:06,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-03 07:52:06,513 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 07:52:06,992 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 340 proven. 33 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2024-11-03 07:52:06,993 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 07:52:07,619 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 21 proven. 33 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-03 07:52:07,619 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 07:52:07,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [213388374] [2024-11-03 07:52:07,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [213388374] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 07:52:07,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 07:52:07,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-03 07:52:07,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243106643] [2024-11-03 07:52:07,620 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 07:52:07,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-03 07:52:07,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 07:52:07,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-03 07:52:07,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-03 07:52:07,624 INFO L87 Difference]: Start difference. First operand 46 states and 66 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 3 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2024-11-03 07:52:10,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-03 07:52:10,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 07:52:10,161 INFO L93 Difference]: Finished difference Result 97 states and 136 transitions. [2024-11-03 07:52:10,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-03 07:52:10,188 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 3 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) Word has length 116 [2024-11-03 07:52:10,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 07:52:10,190 INFO L225 Difference]: With dead ends: 97 [2024-11-03 07:52:10,190 INFO L226 Difference]: Without dead ends: 54 [2024-11-03 07:52:10,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2024-11-03 07:52:10,192 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 57 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-03 07:52:10,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 108 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-03 07:52:10,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-03 07:52:10,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2024-11-03 07:52:10,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 states have internal predecessors, (30), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-03 07:52:10,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 68 transitions. [2024-11-03 07:52:10,206 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 68 transitions. Word has length 116 [2024-11-03 07:52:10,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 07:52:10,207 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 68 transitions. [2024-11-03 07:52:10,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 3 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2024-11-03 07:52:10,207 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions. [2024-11-03 07:52:10,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-03 07:52:10,209 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 07:52:10,211 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 07:52:10,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-03 07:52:10,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-03 07:52:10,413 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 07:52:10,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 07:52:10,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1304351860, now seen corresponding path program 1 times [2024-11-03 07:52:10,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 07:52:10,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [911173529] [2024-11-03 07:52:10,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 07:52:10,414 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-03 07:52:10,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 07:52:10,416 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-03 07:52:10,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-03 07:52:10,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-03 07:52:10,599 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-03 07:52:10,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-03 07:52:10,755 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2024-11-03 07:52:10,755 WARN L124 FreeRefinementEngine]: Strategy FIXED_PREFERENCES was unsuccessful and could not determine trace feasibility [2024-11-03 07:52:10,755 INFO L325 BasicCegarLoop]: Counterexample might be feasible [2024-11-03 07:52:10,761 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-03 07:52:10,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-03 07:52:10,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-03 07:52:10,967 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-03 07:52:10,986 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-03 07:52:10,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 07:52:10 BoogieIcfgContainer [2024-11-03 07:52:10,992 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-03 07:52:10,993 INFO L158 Benchmark]: Toolchain (without parser) took 12938.70ms. Allocated memory was 213.9MB in the beginning and 296.7MB in the end (delta: 82.8MB). Free memory was 151.0MB in the beginning and 184.0MB in the end (delta: -32.9MB). Peak memory consumption was 50.2MB. Max. memory is 8.0GB. [2024-11-03 07:52:10,993 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 213.9MB. Free memory is still 163.5MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-03 07:52:10,997 INFO L158 Benchmark]: CACSL2BoogieTranslator took 291.96ms. Allocated memory is still 213.9MB. Free memory was 150.8MB in the beginning and 135.9MB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2024-11-03 07:52:10,997 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.58ms. Allocated memory is still 213.9MB. Free memory was 135.9MB in the beginning and 133.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-03 07:52:10,998 INFO L158 Benchmark]: Boogie Preprocessor took 70.82ms. Allocated memory was 213.9MB in the beginning and 296.7MB in the end (delta: 82.8MB). Free memory was 133.8MB in the beginning and 262.9MB in the end (delta: -129.1MB). Peak memory consumption was 9.0MB. Max. memory is 8.0GB. [2024-11-03 07:52:10,998 INFO L158 Benchmark]: RCFGBuilder took 6752.27ms. Allocated memory is still 296.7MB. Free memory was 262.9MB in the beginning and 246.6MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2024-11-03 07:52:10,998 INFO L158 Benchmark]: TraceAbstraction took 5773.21ms. Allocated memory is still 296.7MB. Free memory was 246.1MB in the beginning and 184.0MB in the end (delta: 62.2MB). Peak memory consumption was 62.2MB. Max. memory is 8.0GB. [2024-11-03 07:52:11,000 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 213.9MB. Free memory is still 163.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 291.96ms. Allocated memory is still 213.9MB. Free memory was 150.8MB in the beginning and 135.9MB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.58ms. Allocated memory is still 213.9MB. Free memory was 135.9MB in the beginning and 133.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 70.82ms. Allocated memory was 213.9MB in the beginning and 296.7MB in the end (delta: 82.8MB). Free memory was 133.8MB in the beginning and 262.9MB in the end (delta: -129.1MB). Peak memory consumption was 9.0MB. Max. memory is 8.0GB. * RCFGBuilder took 6752.27ms. Allocated memory is still 296.7MB. Free memory was 262.9MB in the beginning and 246.6MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 5773.21ms. Allocated memory is still 296.7MB. Free memory was 246.1MB in the beginning and 184.0MB in the end (delta: 62.2MB). Peak memory consumption was 62.2MB. Max. memory is 8.0GB. * 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: unable to decide satisfiability of path constraint. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -64; [L23] signed long int var_1_3 = 1; [L24] signed long int var_1_4 = 8; [L25] signed long int var_1_5 = 255; [L26] signed long int var_1_6 = 50; [L27] unsigned char var_1_7 = 0; [L28] unsigned long int var_1_8 = 8; [L29] unsigned char var_1_10 = 32; [L30] unsigned char var_1_11 = 5; [L31] unsigned char var_1_12 = 2; [L32] signed short int var_1_13 = 0; [L33] unsigned long int var_1_14 = 16; [L34] signed char var_1_16 = -1; [L35] signed char var_1_17 = -16; [L36] unsigned char last_1_var_1_7 = 0; [L95] isInitial = 1 [L96] FCALL initially() [L97] COND TRUE 1 [L98] CALL updateLastVariables() [L88] last_1_var_1_7 = var_1_7 [L98] RET updateLastVariables() [L99] CALL updateVariables() [L58] var_1_4 = __VERIFIER_nondet_long() [L59] CALL assume_abort_if_not(var_1_4 >= 0) [L20] COND FALSE !(!cond) [L59] RET assume_abort_if_not(var_1_4 >= 0) [L60] CALL assume_abort_if_not(var_1_4 <= 2147483647) [L20] COND FALSE !(!cond) [L60] RET assume_abort_if_not(var_1_4 <= 2147483647) [L61] var_1_5 = __VERIFIER_nondet_long() [L62] CALL assume_abort_if_not(var_1_5 >= 0) [L20] COND FALSE !(!cond) [L62] RET assume_abort_if_not(var_1_5 >= 0) [L63] CALL assume_abort_if_not(var_1_5 <= 2147483647) [L20] COND FALSE !(!cond) [L63] RET assume_abort_if_not(var_1_5 <= 2147483647) [L64] var_1_6 = __VERIFIER_nondet_long() [L65] CALL assume_abort_if_not(var_1_6 >= 0) [L20] COND FALSE !(!cond) [L65] RET assume_abort_if_not(var_1_6 >= 0) [L66] CALL assume_abort_if_not(var_1_6 <= 2147483647) [L20] COND FALSE !(!cond) [L66] RET assume_abort_if_not(var_1_6 <= 2147483647) [L67] var_1_8 = __VERIFIER_nondet_ulong() [L68] CALL assume_abort_if_not(var_1_8 >= 0) [L20] COND FALSE !(!cond) [L68] RET assume_abort_if_not(var_1_8 >= 0) [L69] CALL assume_abort_if_not(var_1_8 <= 2147483647) [L20] COND FALSE !(!cond) [L69] RET assume_abort_if_not(var_1_8 <= 2147483647) [L70] var_1_10 = __VERIFIER_nondet_uchar() [L71] CALL assume_abort_if_not(var_1_10 >= 0) [L20] COND FALSE !(!cond) [L71] RET assume_abort_if_not(var_1_10 >= 0) [L72] CALL assume_abort_if_not(var_1_10 <= 127) [L20] COND FALSE !(!cond) [L72] RET assume_abort_if_not(var_1_10 <= 127) [L73] var_1_11 = __VERIFIER_nondet_uchar() [L74] CALL assume_abort_if_not(var_1_11 >= 0) [L20] COND FALSE !(!cond) [L74] RET assume_abort_if_not(var_1_11 >= 0) [L75] CALL assume_abort_if_not(var_1_11 <= 127) [L20] COND FALSE !(!cond) [L75] RET assume_abort_if_not(var_1_11 <= 127) [L76] var_1_12 = __VERIFIER_nondet_uchar() [L77] CALL assume_abort_if_not(var_1_12 >= 0) [L20] COND FALSE !(!cond) [L77] RET assume_abort_if_not(var_1_12 >= 0) [L78] CALL assume_abort_if_not(var_1_12 <= 127) [L20] COND FALSE !(!cond) [L78] RET assume_abort_if_not(var_1_12 <= 127) [L79] var_1_14 = __VERIFIER_nondet_ulong() [L80] CALL assume_abort_if_not(var_1_14 >= 0) [L20] COND FALSE !(!cond) [L80] RET assume_abort_if_not(var_1_14 >= 0) [L81] CALL assume_abort_if_not(var_1_14 <= 4294967295) [L20] COND FALSE !(!cond) [L81] RET assume_abort_if_not(var_1_14 <= 4294967295) [L82] CALL assume_abort_if_not(var_1_14 != 0) [L20] COND FALSE !(!cond) [L82] RET assume_abort_if_not(var_1_14 != 0) [L83] var_1_17 = __VERIFIER_nondet_char() [L84] CALL assume_abort_if_not(var_1_17 >= -127) [L20] COND FALSE !(!cond) [L84] RET assume_abort_if_not(var_1_17 >= -127) [L85] CALL assume_abort_if_not(var_1_17 <= 126) [L20] COND FALSE !(!cond) [L85] RET assume_abort_if_not(var_1_17 <= 126) [L99] RET updateVariables() [L100] CALL step() [L40] var_1_1 = ((((last_1_var_1_7) < 0 ) ? -(last_1_var_1_7) : (last_1_var_1_7))) [L41] var_1_3 = ((var_1_4 - var_1_5) + ((((256.5f) < ((var_1_6 - 16.125f))) ? (256.5f) : ((var_1_6 - 16.125f))))) [L42] var_1_16 = var_1_17 [L43] signed long int stepLocal_0 = var_1_16 & var_1_1; [L44] COND TRUE (- (3351680781u - var_1_8)) > stepLocal_0 [L45] var_1_7 = (((((var_1_10) < (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? (var_1_10) : (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))) + var_1_12) [L47] COND FALSE !((var_1_16 / var_1_14) < (var_1_7 >> var_1_7)) [L50] COND TRUE var_1_16 >= var_1_1 [L51] var_1_13 = (-5 + (var_1_12 - var_1_11)) [L100] RET step() [L101] CALL, EXPR property() [L91-L92] return ((((var_1_1 == ((signed long int) ((((last_1_var_1_7) < 0 ) ? -(last_1_var_1_7) : (last_1_var_1_7))))) && (var_1_3 == ((signed long int) ((var_1_4 - var_1_5) + ((((256.5f) < ((var_1_6 - 16.125f))) ? (256.5f) : ((var_1_6 - 16.125f)))))))) && (((- (3351680781u - var_1_8)) > (var_1_16 & var_1_1)) ? (var_1_7 == ((unsigned char) (((((var_1_10) < (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? (var_1_10) : (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))) + var_1_12))) : 1)) && (((var_1_16 / var_1_14) < (var_1_7 >> var_1_7)) ? (var_1_13 == ((signed short int) ((((4 - var_1_11) < 0 ) ? -(4 - var_1_11) : (4 - var_1_11))))) : ((var_1_16 >= var_1_1) ? (var_1_13 == ((signed short int) (-5 + (var_1_12 - var_1_11)))) : (var_1_13 == ((signed short int) 256))))) && (var_1_16 == ((signed char) var_1_17)) ; [L101] RET, EXPR property() [L101] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) [L19] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.7s, OverallIterations: 3, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 63 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 57 mSDsluCounter, 174 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 65 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 146 IncrementalHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 109 mSDtfsCounter, 146 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 462 GetRequests, 450 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=0, InterpolantAutomatonStates: 12, 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, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 347 NumberOfCodeBlocks, 347 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 458 ConstructedInterpolants, 21 QuantifiedInterpolants, 843 SizeOfPredicates, 6 NumberOfNonLiveVariables, 374 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 2652/2736 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-03 07:52:11,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...