/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-25.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-df9f019-m [2024-11-05 19:13:10,949 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 19:13:11,025 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-05 19:13:11,033 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 19:13:11,033 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 19:13:11,068 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 19:13:11,069 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 19:13:11,069 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 19:13:11,070 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 19:13:11,070 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 19:13:11,073 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 19:13:11,073 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 19:13:11,074 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 19:13:11,075 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 19:13:11,075 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 19:13:11,075 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 19:13:11,076 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 19:13:11,076 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-05 19:13:11,076 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-05 19:13:11,077 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 19:13:11,077 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 19:13:11,077 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 19:13:11,078 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 19:13:11,078 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 19:13:11,078 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 19:13:11,078 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 19:13:11,079 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 19:13:11,079 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-05 19:13:11,079 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 19:13:11,079 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 19:13:11,080 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 19:13:11,080 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 19:13:11,080 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 19:13:11,080 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 19:13:11,081 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 19:13:11,085 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 19:13:11,085 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 19:13:11,085 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 19:13:11,085 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 19:13:11,086 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 19:13:11,086 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 19:13:11,086 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 19:13:11,086 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 19:13:11,087 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 19:13:11,087 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-05 19:13:11,308 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 19:13:11,331 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 19:13:11,334 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 19:13:11,336 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 19:13:11,336 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 19:13:11,338 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-25.i [2024-11-05 19:13:12,871 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 19:13:13,077 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 19:13:13,078 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-25.i [2024-11-05 19:13:13,089 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98f34977c/fb08d585de6b4e6ea8b3c5991cfec079/FLAGf5921e4bb [2024-11-05 19:13:13,471 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98f34977c/fb08d585de6b4e6ea8b3c5991cfec079 [2024-11-05 19:13:13,474 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 19:13:13,475 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 19:13:13,478 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 19:13:13,478 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 19:13:13,483 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 19:13:13,484 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 07:13:13" (1/1) ... [2024-11-05 19:13:13,485 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1235211e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:13:13, skipping insertion in model container [2024-11-05 19:13:13,485 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 07:13:13" (1/1) ... [2024-11-05 19:13:13,512 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 19:13:13,683 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-25.i[916,929] [2024-11-05 19:13:13,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 19:13:13,733 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 19:13:13,745 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-25.i[916,929] [2024-11-05 19:13:13,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 19:13:13,783 INFO L204 MainTranslator]: Completed translation [2024-11-05 19:13:13,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:13:13 WrapperNode [2024-11-05 19:13:13,784 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 19:13:13,785 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 19:13:13,785 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 19:13:13,786 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 19:13:13,792 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:13:13" (1/1) ... [2024-11-05 19:13:13,801 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:13:13" (1/1) ... [2024-11-05 19:13:13,822 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2024-11-05 19:13:13,823 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 19:13:13,824 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 19:13:13,824 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 19:13:13,824 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 19:13:13,837 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:13:13" (1/1) ... [2024-11-05 19:13:13,838 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:13:13" (1/1) ... [2024-11-05 19:13:13,845 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:13:13" (1/1) ... [2024-11-05 19:13:13,863 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-05 19:13:13,864 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:13:13" (1/1) ... [2024-11-05 19:13:13,864 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:13:13" (1/1) ... [2024-11-05 19:13:13,872 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:13:13" (1/1) ... [2024-11-05 19:13:13,875 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:13:13" (1/1) ... [2024-11-05 19:13:13,877 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:13:13" (1/1) ... [2024-11-05 19:13:13,879 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:13:13" (1/1) ... [2024-11-05 19:13:13,882 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 19:13:13,883 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 19:13:13,883 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 19:13:13,883 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 19:13:13,884 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:13:13" (1/1) ... [2024-11-05 19:13:13,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 19:13:13,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 19:13:13,910 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-05 19:13:13,912 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-05 19:13:13,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 19:13:13,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 19:13:13,933 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-05 19:13:13,933 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-05 19:13:13,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 19:13:13,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 19:13:14,000 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 19:13:14,002 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 19:13:17,066 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-05 19:13:17,066 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 19:13:17,084 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 19:13:17,084 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-05 19:13:17,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 07:13:17 BoogieIcfgContainer [2024-11-05 19:13:17,085 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 19:13:17,089 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 19:13:17,089 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 19:13:17,093 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 19:13:17,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 07:13:13" (1/3) ... [2024-11-05 19:13:17,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69102e4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 07:13:17, skipping insertion in model container [2024-11-05 19:13:17,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:13:13" (2/3) ... [2024-11-05 19:13:17,096 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69102e4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 07:13:17, skipping insertion in model container [2024-11-05 19:13:17,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 07:13:17" (3/3) ... [2024-11-05 19:13:17,097 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-25.i [2024-11-05 19:13:17,113 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 19:13:17,113 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 19:13:17,175 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 19:13:17,182 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;@3b1c5ef3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 19:13:17,182 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 19:13:17,187 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 36 states have internal predecessors, (47), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-05 19:13:17,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-05 19:13:17,202 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 19:13:17,202 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 19:13:17,203 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 19:13:17,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 19:13:17,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1300205119, now seen corresponding path program 1 times [2024-11-05 19:13:17,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 19:13:17,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2125218478] [2024-11-05 19:13:17,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 19:13:17,225 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-05 19:13:17,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 19:13:17,229 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-05 19:13:17,231 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-05 19:13:17,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 19:13:17,463 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-05 19:13:17,478 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 19:13:17,536 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2024-11-05 19:13:17,536 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 19:13:17,738 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 18 proven. 20 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2024-11-05 19:13:17,740 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 19:13:17,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2125218478] [2024-11-05 19:13:17,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2125218478] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 19:13:17,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 19:13:17,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-05 19:13:17,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057235705] [2024-11-05 19:13:17,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 19:13:17,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-05 19:13:17,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 19:13:17,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-05 19:13:17,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 19:13:17,773 INFO L87 Difference]: Start difference. First operand has 58 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 36 states have internal predecessors, (47), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-05 19:13:17,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 19:13:17,806 INFO L93 Difference]: Finished difference Result 109 states and 188 transitions. [2024-11-05 19:13:17,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-05 19:13:17,808 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 125 [2024-11-05 19:13:17,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 19:13:17,816 INFO L225 Difference]: With dead ends: 109 [2024-11-05 19:13:17,816 INFO L226 Difference]: Without dead ends: 54 [2024-11-05 19:13:17,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 248 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-05 19:13:17,825 INFO L432 NwaCegarLoop]: 80 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, 80 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-05 19:13:17,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 19:13:17,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-05 19:13:17,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-05 19:13:17,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-05 19:13:17,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 80 transitions. [2024-11-05 19:13:17,864 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 80 transitions. Word has length 125 [2024-11-05 19:13:17,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 19:13:17,865 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 80 transitions. [2024-11-05 19:13:17,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-05 19:13:17,865 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 80 transitions. [2024-11-05 19:13:17,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-05 19:13:17,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 19:13:17,869 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 19:13:17,876 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-05 19:13:18,070 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-05 19:13:18,071 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 19:13:18,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 19:13:18,072 INFO L85 PathProgramCache]: Analyzing trace with hash -8922687, now seen corresponding path program 1 times [2024-11-05 19:13:18,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 19:13:18,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [19487574] [2024-11-05 19:13:18,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 19:13:18,073 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-05 19:13:18,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 19:13:18,076 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-05 19:13:18,077 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-05 19:13:18,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 19:13:18,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-05 19:13:18,249 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 19:13:18,492 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-05 19:13:18,494 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 19:13:18,847 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 54 proven. 3 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-05 19:13:18,848 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 19:13:18,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [19487574] [2024-11-05 19:13:18,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [19487574] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 19:13:18,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 19:13:18,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 12 [2024-11-05 19:13:18,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212678597] [2024-11-05 19:13:18,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 19:13:18,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-05 19:13:18,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 19:13:18,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-05 19:13:18,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-05 19:13:18,859 INFO L87 Difference]: Start difference. First operand 54 states and 80 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-05 19:13:20,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-05 19:13:20,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 19:13:20,982 INFO L93 Difference]: Finished difference Result 115 states and 165 transitions. [2024-11-05 19:13:21,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-05 19:13:21,003 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) Word has length 125 [2024-11-05 19:13:21,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 19:13:21,006 INFO L225 Difference]: With dead ends: 115 [2024-11-05 19:13:21,006 INFO L226 Difference]: Without dead ends: 64 [2024-11-05 19:13:21,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 238 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2024-11-05 19:13:21,008 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 112 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-05 19:13:21,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 178 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-05 19:13:21,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-05 19:13:21,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2024-11-05 19:13:21,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-05 19:13:21,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 85 transitions. [2024-11-05 19:13:21,026 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 85 transitions. Word has length 125 [2024-11-05 19:13:21,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 19:13:21,026 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 85 transitions. [2024-11-05 19:13:21,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-05 19:13:21,027 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 85 transitions. [2024-11-05 19:13:21,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-05 19:13:21,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 19:13:21,029 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 19:13:21,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-05 19:13:21,230 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-05 19:13:21,231 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 19:13:21,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 19:13:21,231 INFO L85 PathProgramCache]: Analyzing trace with hash -859300006, now seen corresponding path program 1 times [2024-11-05 19:13:21,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 19:13:21,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [351605923] [2024-11-05 19:13:21,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 19:13:21,232 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-05 19:13:21,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 19:13:21,236 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-05 19:13:21,237 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-05 19:13:21,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-05 19:13:21,375 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-05 19:13:21,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-05 19:13:21,505 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2024-11-05 19:13:21,506 WARN L124 FreeRefinementEngine]: Strategy FIXED_PREFERENCES was unsuccessful and could not determine trace feasibility [2024-11-05 19:13:21,506 INFO L325 BasicCegarLoop]: Counterexample might be feasible [2024-11-05 19:13:21,512 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-05 19:13:21,529 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-05 19:13:21,714 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-05 19:13:21,718 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-05 19:13:21,734 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-05 19:13:21,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.11 07:13:21 BoogieIcfgContainer [2024-11-05 19:13:21,737 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-05 19:13:21,737 INFO L158 Benchmark]: Toolchain (without parser) took 8261.95ms. Allocated memory was 195.0MB in the beginning and 321.9MB in the end (delta: 126.9MB). Free memory was 141.9MB in the beginning and 165.5MB in the end (delta: -23.5MB). Peak memory consumption was 104.5MB. Max. memory is 8.0GB. [2024-11-05 19:13:21,738 INFO L158 Benchmark]: CDTParser took 0.99ms. Allocated memory is still 195.0MB. Free memory is still 142.3MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-05 19:13:21,738 INFO L158 Benchmark]: CACSL2BoogieTranslator took 306.41ms. Allocated memory is still 195.0MB. Free memory was 141.6MB in the beginning and 126.9MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2024-11-05 19:13:21,738 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.82ms. Allocated memory is still 195.0MB. Free memory was 126.9MB in the beginning and 124.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-05 19:13:21,739 INFO L158 Benchmark]: Boogie Preprocessor took 57.92ms. Allocated memory is still 195.0MB. Free memory was 124.8MB in the beginning and 122.0MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-11-05 19:13:21,739 INFO L158 Benchmark]: RCFGBuilder took 3202.58ms. Allocated memory was 195.0MB in the beginning and 321.9MB in the end (delta: 126.9MB). Free memory was 122.0MB in the beginning and 286.0MB in the end (delta: -164.0MB). Peak memory consumption was 20.6MB. Max. memory is 8.0GB. [2024-11-05 19:13:21,740 INFO L158 Benchmark]: TraceAbstraction took 4648.15ms. Allocated memory is still 321.9MB. Free memory was 285.5MB in the beginning and 165.5MB in the end (delta: 120.1MB). Peak memory consumption was 120.6MB. Max. memory is 8.0GB. [2024-11-05 19:13:21,741 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.99ms. Allocated memory is still 195.0MB. Free memory is still 142.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 306.41ms. Allocated memory is still 195.0MB. Free memory was 141.6MB in the beginning and 126.9MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.82ms. Allocated memory is still 195.0MB. Free memory was 126.9MB in the beginning and 124.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 57.92ms. Allocated memory is still 195.0MB. Free memory was 124.8MB in the beginning and 122.0MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 3202.58ms. Allocated memory was 195.0MB in the beginning and 321.9MB in the end (delta: 126.9MB). Free memory was 122.0MB in the beginning and 286.0MB in the end (delta: -164.0MB). Peak memory consumption was 20.6MB. Max. memory is 8.0GB. * TraceAbstraction took 4648.15ms. Allocated memory is still 321.9MB. Free memory was 285.5MB in the beginning and 165.5MB in the end (delta: 120.1MB). Peak memory consumption was 120.6MB. 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] unsigned long int var_1_1 = 256; [L23] unsigned char var_1_2 = 0; [L24] unsigned short int var_1_3 = 10; [L25] unsigned short int var_1_4 = 500; [L26] unsigned long int var_1_5 = 0; [L27] unsigned long int var_1_6 = 1509114200; [L28] unsigned long int var_1_7 = 10; [L29] signed long int var_1_8 = 128; [L30] signed long int var_1_9 = 63; [L31] signed long int var_1_10 = 4; [L32] signed long int var_1_11 = 25; [L33] unsigned char var_1_12 = 1; [L34] unsigned char var_1_13 = 0; [L35] unsigned char var_1_14 = 1; [L109] isInitial = 1 [L110] FCALL initially() [L111] COND TRUE 1 [L112] FCALL updateLastVariables() [L113] CALL updateVariables() [L71] var_1_2 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_2 >= 0) [L20] COND FALSE !(!cond) [L72] RET assume_abort_if_not(var_1_2 >= 0) [L73] CALL assume_abort_if_not(var_1_2 <= 1) [L20] COND FALSE !(!cond) [L73] RET assume_abort_if_not(var_1_2 <= 1) [L74] var_1_3 = __VERIFIER_nondet_ushort() [L75] CALL assume_abort_if_not(var_1_3 >= 0) [L20] COND FALSE !(!cond) [L75] RET assume_abort_if_not(var_1_3 >= 0) [L76] CALL assume_abort_if_not(var_1_3 <= 65535) [L20] COND FALSE !(!cond) [L76] RET assume_abort_if_not(var_1_3 <= 65535) [L77] var_1_4 = __VERIFIER_nondet_ushort() [L78] CALL assume_abort_if_not(var_1_4 >= 0) [L20] COND FALSE !(!cond) [L78] RET assume_abort_if_not(var_1_4 >= 0) [L79] CALL assume_abort_if_not(var_1_4 <= 65535) [L20] COND FALSE !(!cond) [L79] RET assume_abort_if_not(var_1_4 <= 65535) [L80] var_1_5 = __VERIFIER_nondet_ulong() [L81] CALL assume_abort_if_not(var_1_5 >= 0) [L20] COND FALSE !(!cond) [L81] RET assume_abort_if_not(var_1_5 >= 0) [L82] CALL assume_abort_if_not(var_1_5 <= 1073741823) [L20] COND FALSE !(!cond) [L82] RET assume_abort_if_not(var_1_5 <= 1073741823) [L83] var_1_6 = __VERIFIER_nondet_ulong() [L84] CALL assume_abort_if_not(var_1_6 >= 1073741823) [L20] COND FALSE !(!cond) [L84] RET assume_abort_if_not(var_1_6 >= 1073741823) [L85] CALL assume_abort_if_not(var_1_6 <= 2147483647) [L20] COND FALSE !(!cond) [L85] RET assume_abort_if_not(var_1_6 <= 2147483647) [L86] var_1_7 = __VERIFIER_nondet_ulong() [L87] CALL assume_abort_if_not(var_1_7 >= 0) [L20] COND FALSE !(!cond) [L87] RET assume_abort_if_not(var_1_7 >= 0) [L88] CALL assume_abort_if_not(var_1_7 <= 1073741823) [L20] COND FALSE !(!cond) [L88] RET assume_abort_if_not(var_1_7 <= 1073741823) [L89] var_1_9 = __VERIFIER_nondet_long() [L90] CALL assume_abort_if_not(var_1_9 >= -2147483648) [L20] COND FALSE !(!cond) [L90] RET assume_abort_if_not(var_1_9 >= -2147483648) [L91] CALL assume_abort_if_not(var_1_9 <= 2147483647) [L20] COND FALSE !(!cond) [L91] RET assume_abort_if_not(var_1_9 <= 2147483647) [L92] var_1_10 = __VERIFIER_nondet_long() [L93] CALL assume_abort_if_not(var_1_10 >= -2147483648) [L20] COND FALSE !(!cond) [L93] RET assume_abort_if_not(var_1_10 >= -2147483648) [L94] CALL assume_abort_if_not(var_1_10 <= 2147483647) [L20] COND FALSE !(!cond) [L94] RET assume_abort_if_not(var_1_10 <= 2147483647) [L95] var_1_13 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_13 >= 0) [L20] COND FALSE !(!cond) [L96] RET assume_abort_if_not(var_1_13 >= 0) [L97] CALL assume_abort_if_not(var_1_13 <= 1) [L20] COND FALSE !(!cond) [L97] RET assume_abort_if_not(var_1_13 <= 1) [L98] var_1_14 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_14 >= 1) [L20] COND FALSE !(!cond) [L99] RET assume_abort_if_not(var_1_14 >= 1) [L100] CALL assume_abort_if_not(var_1_14 <= 1) [L20] COND FALSE !(!cond) [L100] RET assume_abort_if_not(var_1_14 <= 1) [L113] RET updateVariables() [L114] CALL step() [L39] COND FALSE !(var_1_9 != var_1_10) [L46] var_1_12 = var_1_14 [L48] unsigned short int stepLocal_0 = var_1_3; [L49] COND TRUE \read(var_1_12) [L50] COND TRUE stepLocal_0 <= var_1_4 [L51] var_1_1 = (((((var_1_3) > ((var_1_4 + var_1_5))) ? (var_1_3) : ((var_1_4 + var_1_5)))) + (var_1_6 - var_1_7)) [L56] unsigned long int stepLocal_1 = var_1_1; [L57] COND TRUE var_1_7 >= stepLocal_1 [L58] var_1_8 = ((((0.5f) < (var_1_9)) ? (0.5f) : (var_1_9))) [L62] COND TRUE var_1_10 >= ((((((((128.175f) > (var_1_9)) ? (128.175f) : (var_1_9)))) < (var_1_8)) ? (((((128.175f) > (var_1_9)) ? (128.175f) : (var_1_9)))) : (var_1_8))) [L63] var_1_11 = var_1_10 [L114] RET step() [L115] CALL, EXPR property() [L105-L106] return (((var_1_12 ? ((var_1_3 <= var_1_4) ? (var_1_1 == ((unsigned long int) (((((var_1_3) > ((var_1_4 + var_1_5))) ? (var_1_3) : ((var_1_4 + var_1_5)))) + (var_1_6 - var_1_7)))) : 1) : (var_1_1 == ((unsigned long int) var_1_7))) && ((var_1_7 >= var_1_1) ? (var_1_8 == ((signed long int) ((((0.5f) < (var_1_9)) ? (0.5f) : (var_1_9))))) : (var_1_8 == ((signed long int) ((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))))))) && ((var_1_10 >= ((((((((128.175f) > (var_1_9)) ? (128.175f) : (var_1_9)))) < (var_1_8)) ? (((((128.175f) > (var_1_9)) ? (128.175f) : (var_1_9)))) : (var_1_8)))) ? (var_1_11 == ((signed long int) var_1_10)) : ((! (var_1_7 <= var_1_6)) ? (var_1_11 == ((signed long int) var_1_9)) : 1))) && ((var_1_9 != var_1_10) ? ((var_1_2 || var_1_13) ? (var_1_12 == ((unsigned char) (var_1_13 || var_1_14))) : (var_1_12 == ((unsigned char) var_1_14))) : (var_1_12 == ((unsigned char) var_1_14))) ; [L115] RET, EXPR property() [L115] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) [L19] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 58 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.6s, OverallIterations: 3, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 113 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 112 mSDsluCounter, 258 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 126 mSDsCounter, 127 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 193 IncrementalHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 127 mSolverCounterUnsat, 132 mSDtfsCounter, 193 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 506 GetRequests, 486 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=2, InterpolantAutomatonStates: 14, 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, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 376 NumberOfCodeBlocks, 376 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 496 ConstructedInterpolants, 0 QuantifiedInterpolants, 607 SizeOfPredicates, 1 NumberOfNonLiveVariables, 396 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 3017/3040 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-05 19:13:21,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...