/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/floats-esbmc-regression/nearbyint.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-03 09:19:11,570 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-03 09:19:11,624 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 09:19:11,628 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-03 09:19:11,629 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-03 09:19:11,652 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-03 09:19:11,652 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-03 09:19:11,652 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-03 09:19:11,653 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-03 09:19:11,654 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-03 09:19:11,654 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-03 09:19:11,654 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-03 09:19:11,655 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-03 09:19:11,655 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-03 09:19:11,655 INFO L153 SettingsManager]: * Use SBE=true [2024-11-03 09:19:11,656 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-03 09:19:11,656 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-03 09:19:11,656 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-03 09:19:11,656 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-03 09:19:11,657 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-03 09:19:11,657 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-03 09:19:11,660 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-03 09:19:11,660 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-03 09:19:11,660 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-03 09:19:11,661 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-03 09:19:11,661 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-03 09:19:11,661 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-03 09:19:11,661 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-03 09:19:11,661 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-03 09:19:11,661 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-03 09:19:11,662 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-03 09:19:11,662 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-03 09:19:11,662 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-03 09:19:11,662 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-03 09:19:11,662 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-03 09:19:11,663 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-03 09:19:11,663 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-03 09:19:11,664 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-03 09:19:11,664 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-03 09:19:11,664 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-03 09:19:11,664 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-03 09:19:11,664 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-03 09:19:11,664 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-03 09:19:11,665 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-03 09:19:11,665 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 09:19:11,844 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-03 09:19:11,865 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-03 09:19:11,867 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-03 09:19:11,868 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-03 09:19:11,868 INFO L274 PluginConnector]: CDTParser initialized [2024-11-03 09:19:11,869 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/floats-esbmc-regression/nearbyint.i [2024-11-03 09:19:13,058 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-03 09:19:13,243 INFO L384 CDTParser]: Found 1 translation units. [2024-11-03 09:19:13,244 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/floats-esbmc-regression/nearbyint.i [2024-11-03 09:19:13,254 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59377329d/60354d5a5a184da2aa39349dbdf6521c/FLAGf3debf664 [2024-11-03 09:19:13,622 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59377329d/60354d5a5a184da2aa39349dbdf6521c [2024-11-03 09:19:13,624 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-03 09:19:13,625 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-03 09:19:13,627 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-03 09:19:13,627 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-03 09:19:13,630 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-03 09:19:13,631 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 09:19:13" (1/1) ... [2024-11-03 09:19:13,631 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51656d89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:19:13, skipping insertion in model container [2024-11-03 09:19:13,632 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 09:19:13" (1/1) ... [2024-11-03 09:19:13,660 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-03 09:19:13,910 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-esbmc-regression/nearbyint.i[38068,38081] [2024-11-03 09:19:13,922 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-03 09:19:13,932 INFO L200 MainTranslator]: Completed pre-run [2024-11-03 09:19:13,953 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-esbmc-regression/nearbyint.i[38068,38081] [2024-11-03 09:19:13,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-03 09:19:14,042 INFO L204 MainTranslator]: Completed translation [2024-11-03 09:19:14,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:19:14 WrapperNode [2024-11-03 09:19:14,043 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-03 09:19:14,044 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-03 09:19:14,044 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-03 09:19:14,044 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-03 09:19:14,048 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:19:14" (1/1) ... [2024-11-03 09:19:14,062 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:19:14" (1/1) ... [2024-11-03 09:19:14,083 INFO L138 Inliner]: procedures = 463, calls = 36, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 139 [2024-11-03 09:19:14,083 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-03 09:19:14,083 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-03 09:19:14,084 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-03 09:19:14,084 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-03 09:19:14,091 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:19:14" (1/1) ... [2024-11-03 09:19:14,091 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:19:14" (1/1) ... [2024-11-03 09:19:14,093 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:19:14" (1/1) ... [2024-11-03 09:19:14,102 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 4]. The 0 writes are split as follows [0, 0]. [2024-11-03 09:19:14,102 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:19:14" (1/1) ... [2024-11-03 09:19:14,102 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:19:14" (1/1) ... [2024-11-03 09:19:14,107 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:19:14" (1/1) ... [2024-11-03 09:19:14,109 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:19:14" (1/1) ... [2024-11-03 09:19:14,114 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:19:14" (1/1) ... [2024-11-03 09:19:14,115 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:19:14" (1/1) ... [2024-11-03 09:19:14,118 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-03 09:19:14,122 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-03 09:19:14,122 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-03 09:19:14,122 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-03 09:19:14,122 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:19:14" (1/1) ... [2024-11-03 09:19:14,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-03 09:19:14,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-03 09:19:14,152 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 09:19:14,154 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 09:19:14,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-03 09:19:14,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-03 09:19:14,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-03 09:19:14,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-03 09:19:14,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-03 09:19:14,172 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-03 09:19:14,172 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-03 09:19:14,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-03 09:19:14,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-03 09:19:14,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-03 09:19:14,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-03 09:19:14,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-03 09:19:14,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-03 09:19:14,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2024-11-03 09:19:14,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2024-11-03 09:19:14,285 INFO L238 CfgBuilder]: Building ICFG [2024-11-03 09:19:14,286 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-03 09:19:14,499 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-11-03 09:19:14,499 INFO L287 CfgBuilder]: Performing block encoding [2024-11-03 09:19:14,510 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-03 09:19:14,511 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-03 09:19:14,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 09:19:14 BoogieIcfgContainer [2024-11-03 09:19:14,511 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-03 09:19:14,515 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-03 09:19:14,515 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-03 09:19:14,517 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-03 09:19:14,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 09:19:13" (1/3) ... [2024-11-03 09:19:14,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@90906d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 09:19:14, skipping insertion in model container [2024-11-03 09:19:14,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:19:14" (2/3) ... [2024-11-03 09:19:14,520 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@90906d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 09:19:14, skipping insertion in model container [2024-11-03 09:19:14,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 09:19:14" (3/3) ... [2024-11-03 09:19:14,521 INFO L112 eAbstractionObserver]: Analyzing ICFG nearbyint.i [2024-11-03 09:19:14,533 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-03 09:19:14,533 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-03 09:19:14,581 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-03 09:19:14,585 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;@741fa97c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-03 09:19:14,585 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-03 09:19:14,588 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 43 states have internal predecessors, (50), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-03 09:19:14,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-03 09:19:14,593 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:19:14,594 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 09:19:14,595 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:19:14,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:19:14,600 INFO L85 PathProgramCache]: Analyzing trace with hash 60099875, now seen corresponding path program 1 times [2024-11-03 09:19:14,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:19:14,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2067151883] [2024-11-03 09:19:14,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:19:14,608 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 09:19:14,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:19:14,610 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 09:19:14,611 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 09:19:14,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:19:14,679 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-03 09:19:14,685 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:19:14,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 09:19:14,795 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:19:14,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 09:19:14,939 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:19:14,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2067151883] [2024-11-03 09:19:14,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2067151883] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 09:19:14,940 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 09:19:14,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2024-11-03 09:19:14,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497517299] [2024-11-03 09:19:14,943 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 09:19:14,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-03 09:19:14,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:19:14,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-03 09:19:14,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-03 09:19:14,960 INFO L87 Difference]: Start difference. First operand has 63 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 43 states have internal predecessors, (50), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 9 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-03 09:19:15,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:19:15,224 INFO L93 Difference]: Finished difference Result 143 states and 238 transitions. [2024-11-03 09:19:15,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-03 09:19:15,226 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 13 [2024-11-03 09:19:15,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:19:15,232 INFO L225 Difference]: With dead ends: 143 [2024-11-03 09:19:15,232 INFO L226 Difference]: Without dead ends: 78 [2024-11-03 09:19:15,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-03 09:19:15,238 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 35 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-03 09:19:15,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 304 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-03 09:19:15,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-03 09:19:15,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 64. [2024-11-03 09:19:15,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 43 states have internal predecessors, (49), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 18 states have call predecessors, (21), 20 states have call successors, (21) [2024-11-03 09:19:15,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 91 transitions. [2024-11-03 09:19:15,270 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 91 transitions. Word has length 13 [2024-11-03 09:19:15,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:19:15,271 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 91 transitions. [2024-11-03 09:19:15,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-03 09:19:15,271 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 91 transitions. [2024-11-03 09:19:15,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-03 09:19:15,272 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:19:15,272 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 09:19:15,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-03 09:19:15,474 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 09:19:15,475 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:19:15,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:19:15,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1942099019, now seen corresponding path program 1 times [2024-11-03 09:19:15,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:19:15,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2038306558] [2024-11-03 09:19:15,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:19:15,476 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 09:19:15,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:19:15,479 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 09:19:15,479 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 09:19:15,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:19:15,518 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-03 09:19:15,520 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:19:15,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 09:19:15,599 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:19:15,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 09:19:15,797 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:19:15,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2038306558] [2024-11-03 09:19:15,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2038306558] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 09:19:15,797 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 09:19:15,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 11 [2024-11-03 09:19:15,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278808834] [2024-11-03 09:19:15,798 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 09:19:15,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-03 09:19:15,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:19:15,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-03 09:19:15,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-03 09:19:15,799 INFO L87 Difference]: Start difference. First operand 64 states and 91 transitions. Second operand has 11 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-03 09:19:16,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:19:16,026 INFO L93 Difference]: Finished difference Result 137 states and 198 transitions. [2024-11-03 09:19:16,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-03 09:19:16,027 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2024-11-03 09:19:16,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:19:16,028 INFO L225 Difference]: With dead ends: 137 [2024-11-03 09:19:16,028 INFO L226 Difference]: Without dead ends: 75 [2024-11-03 09:19:16,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-11-03 09:19:16,030 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 20 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-03 09:19:16,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 633 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-03 09:19:16,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-03 09:19:16,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 65. [2024-11-03 09:19:16,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 40 states have (on average 1.25) internal successors, (50), 44 states have internal predecessors, (50), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 18 states have call predecessors, (21), 20 states have call successors, (21) [2024-11-03 09:19:16,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 92 transitions. [2024-11-03 09:19:16,046 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 92 transitions. Word has length 14 [2024-11-03 09:19:16,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:19:16,046 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 92 transitions. [2024-11-03 09:19:16,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-03 09:19:16,047 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 92 transitions. [2024-11-03 09:19:16,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-03 09:19:16,047 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:19:16,047 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 09:19:16,051 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 09:19:16,248 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 09:19:16,248 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:19:16,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:19:16,253 INFO L85 PathProgramCache]: Analyzing trace with hash -39663284, now seen corresponding path program 1 times [2024-11-03 09:19:16,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:19:16,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [943574112] [2024-11-03 09:19:16,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:19:16,254 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 09:19:16,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:19:16,257 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 09:19:16,257 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 09:19:16,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:19:16,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-03 09:19:16,298 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:19:16,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 09:19:16,348 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:19:16,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 09:19:16,448 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:19:16,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [943574112] [2024-11-03 09:19:16,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [943574112] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 09:19:16,448 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 09:19:16,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2024-11-03 09:19:16,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980244398] [2024-11-03 09:19:16,449 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 09:19:16,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-03 09:19:16,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:19:16,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-03 09:19:16,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-03 09:19:16,450 INFO L87 Difference]: Start difference. First operand 65 states and 92 transitions. Second operand has 9 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-03 09:19:16,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:19:16,652 INFO L93 Difference]: Finished difference Result 148 states and 217 transitions. [2024-11-03 09:19:16,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-03 09:19:16,653 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2024-11-03 09:19:16,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:19:16,654 INFO L225 Difference]: With dead ends: 148 [2024-11-03 09:19:16,654 INFO L226 Difference]: Without dead ends: 85 [2024-11-03 09:19:16,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-03 09:19:16,655 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 14 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-03 09:19:16,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 417 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-03 09:19:16,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-03 09:19:16,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 71. [2024-11-03 09:19:16,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 48 states have internal predecessors, (55), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (22), 19 states have call predecessors, (22), 20 states have call successors, (22) [2024-11-03 09:19:16,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 98 transitions. [2024-11-03 09:19:16,663 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 98 transitions. Word has length 14 [2024-11-03 09:19:16,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:19:16,663 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 98 transitions. [2024-11-03 09:19:16,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-03 09:19:16,663 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 98 transitions. [2024-11-03 09:19:16,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-03 09:19:16,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:19:16,664 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 09:19:16,670 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 09:19:16,864 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 09:19:16,865 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:19:16,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:19:16,865 INFO L85 PathProgramCache]: Analyzing trace with hash 158343587, now seen corresponding path program 1 times [2024-11-03 09:19:16,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:19:16,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1042947093] [2024-11-03 09:19:16,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:19:16,866 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 09:19:16,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:19:16,868 INFO L229 MonitoredProcess]: Starting monitored process 5 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 09:19:16,869 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 (5)] Waiting until timeout for monitored process [2024-11-03 09:19:16,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:19:16,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-03 09:19:16,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:19:16,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 09:19:16,931 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:19:16,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 09:19:16,962 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:19:16,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1042947093] [2024-11-03 09:19:16,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1042947093] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 09:19:16,962 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 09:19:16,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2024-11-03 09:19:16,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171621437] [2024-11-03 09:19:16,963 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 09:19:16,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-03 09:19:16,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:19:16,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-03 09:19:16,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-03 09:19:16,964 INFO L87 Difference]: Start difference. First operand 71 states and 98 transitions. Second operand has 7 states, 5 states have (on average 2.8) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-03 09:19:17,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:19:17,056 INFO L93 Difference]: Finished difference Result 163 states and 233 transitions. [2024-11-03 09:19:17,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-03 09:19:17,057 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.8) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2024-11-03 09:19:17,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:19:17,058 INFO L225 Difference]: With dead ends: 163 [2024-11-03 09:19:17,058 INFO L226 Difference]: Without dead ends: 94 [2024-11-03 09:19:17,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-03 09:19:17,059 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 30 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-03 09:19:17,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 300 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-03 09:19:17,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-03 09:19:17,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 73. [2024-11-03 09:19:17,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 50 states have internal predecessors, (56), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (24), 19 states have call predecessors, (24), 21 states have call successors, (24) [2024-11-03 09:19:17,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 102 transitions. [2024-11-03 09:19:17,070 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 102 transitions. Word has length 15 [2024-11-03 09:19:17,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:19:17,070 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 102 transitions. [2024-11-03 09:19:17,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.8) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-03 09:19:17,070 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 102 transitions. [2024-11-03 09:19:17,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-03 09:19:17,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:19:17,072 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 09:19:17,077 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 (5)] Forceful destruction successful, exit code 0 [2024-11-03 09:19:17,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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 09:19:17,274 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:19:17,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:19:17,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1150558910, now seen corresponding path program 1 times [2024-11-03 09:19:17,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:19:17,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [498735058] [2024-11-03 09:19:17,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:19:17,275 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 09:19:17,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:19:17,299 INFO L229 MonitoredProcess]: Starting monitored process 6 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 09:19:17,300 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 (6)] Waiting until timeout for monitored process [2024-11-03 09:19:17,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:19:17,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-03 09:19:17,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:19:17,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 09:19:17,377 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:19:17,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 09:19:17,422 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:19:17,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [498735058] [2024-11-03 09:19:17,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [498735058] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 09:19:17,423 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 09:19:17,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2024-11-03 09:19:17,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039820243] [2024-11-03 09:19:17,423 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 09:19:17,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-03 09:19:17,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:19:17,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-03 09:19:17,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-03 09:19:17,424 INFO L87 Difference]: Start difference. First operand 73 states and 102 transitions. Second operand has 7 states, 5 states have (on average 2.8) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-03 09:19:17,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:19:17,520 INFO L93 Difference]: Finished difference Result 161 states and 229 transitions. [2024-11-03 09:19:17,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-03 09:19:17,520 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.8) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2024-11-03 09:19:17,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:19:17,521 INFO L225 Difference]: With dead ends: 161 [2024-11-03 09:19:17,521 INFO L226 Difference]: Without dead ends: 92 [2024-11-03 09:19:17,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-03 09:19:17,522 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 31 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-03 09:19:17,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 387 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-03 09:19:17,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-03 09:19:17,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 73. [2024-11-03 09:19:17,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 50 states have internal predecessors, (56), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 19 states have call predecessors, (23), 21 states have call successors, (23) [2024-11-03 09:19:17,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 101 transitions. [2024-11-03 09:19:17,536 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 101 transitions. Word has length 15 [2024-11-03 09:19:17,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:19:17,537 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 101 transitions. [2024-11-03 09:19:17,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.8) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-03 09:19:17,537 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 101 transitions. [2024-11-03 09:19:17,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-03 09:19:17,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:19:17,537 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 09:19:17,542 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 (6)] Forceful destruction successful, exit code 0 [2024-11-03 09:19:17,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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 09:19:17,738 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:19:17,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:19:17,739 INFO L85 PathProgramCache]: Analyzing trace with hash 715308360, now seen corresponding path program 1 times [2024-11-03 09:19:17,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:19:17,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [559952244] [2024-11-03 09:19:17,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:19:17,739 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 09:19:17,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:19:17,740 INFO L229 MonitoredProcess]: Starting monitored process 7 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 09:19:17,741 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 (7)] Waiting until timeout for monitored process [2024-11-03 09:19:17,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:19:17,769 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-03 09:19:17,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:19:17,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 09:19:17,808 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:19:17,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 09:19:17,886 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:19:17,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [559952244] [2024-11-03 09:19:17,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [559952244] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 09:19:17,886 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 09:19:17,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2024-11-03 09:19:17,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535547304] [2024-11-03 09:19:17,886 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 09:19:17,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-03 09:19:17,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:19:17,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-03 09:19:17,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-03 09:19:17,887 INFO L87 Difference]: Start difference. First operand 73 states and 101 transitions. Second operand has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-03 09:19:18,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:19:18,044 INFO L93 Difference]: Finished difference Result 163 states and 234 transitions. [2024-11-03 09:19:18,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-03 09:19:18,045 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2024-11-03 09:19:18,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:19:18,046 INFO L225 Difference]: With dead ends: 163 [2024-11-03 09:19:18,046 INFO L226 Difference]: Without dead ends: 94 [2024-11-03 09:19:18,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-03 09:19:18,049 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 25 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-03 09:19:18,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 376 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-03 09:19:18,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-03 09:19:18,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 78. [2024-11-03 09:19:18,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 50 states have (on average 1.2) internal successors, (60), 54 states have internal predecessors, (60), 22 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (25), 19 states have call predecessors, (25), 21 states have call successors, (25) [2024-11-03 09:19:18,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 107 transitions. [2024-11-03 09:19:18,057 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 107 transitions. Word has length 15 [2024-11-03 09:19:18,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:19:18,057 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 107 transitions. [2024-11-03 09:19:18,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-03 09:19:18,057 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 107 transitions. [2024-11-03 09:19:18,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-03 09:19:18,058 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:19:18,058 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 09:19:18,063 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 (7)] Forceful destruction successful, exit code 0 [2024-11-03 09:19:18,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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 09:19:18,262 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:19:18,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:19:18,262 INFO L85 PathProgramCache]: Analyzing trace with hash 778725574, now seen corresponding path program 1 times [2024-11-03 09:19:18,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:19:18,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [4502376] [2024-11-03 09:19:18,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:19:18,262 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 09:19:18,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:19:18,263 INFO L229 MonitoredProcess]: Starting monitored process 8 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 09:19:18,264 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 (8)] Waiting until timeout for monitored process [2024-11-03 09:19:18,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:19:18,294 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-03 09:19:18,295 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:19:18,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 09:19:18,351 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:19:18,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 09:19:18,477 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:19:18,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [4502376] [2024-11-03 09:19:18,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [4502376] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 09:19:18,477 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 09:19:18,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 11 [2024-11-03 09:19:18,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399096596] [2024-11-03 09:19:18,477 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 09:19:18,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-03 09:19:18,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:19:18,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-03 09:19:18,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-03 09:19:18,478 INFO L87 Difference]: Start difference. First operand 78 states and 107 transitions. Second operand has 11 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-03 09:19:18,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:19:18,663 INFO L93 Difference]: Finished difference Result 162 states and 223 transitions. [2024-11-03 09:19:18,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-03 09:19:18,663 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2024-11-03 09:19:18,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:19:18,664 INFO L225 Difference]: With dead ends: 162 [2024-11-03 09:19:18,665 INFO L226 Difference]: Without dead ends: 88 [2024-11-03 09:19:18,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-11-03 09:19:18,666 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 10 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-03 09:19:18,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 678 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-03 09:19:18,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-03 09:19:18,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 82. [2024-11-03 09:19:18,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 57 states have internal predecessors, (64), 22 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (25), 20 states have call predecessors, (25), 21 states have call successors, (25) [2024-11-03 09:19:18,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 111 transitions. [2024-11-03 09:19:18,671 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 111 transitions. Word has length 16 [2024-11-03 09:19:18,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:19:18,672 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 111 transitions. [2024-11-03 09:19:18,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-03 09:19:18,672 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 111 transitions. [2024-11-03 09:19:18,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-03 09:19:18,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:19:18,672 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 09:19:18,676 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 (8)] Forceful destruction successful, exit code 0 [2024-11-03 09:19:18,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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 09:19:18,873 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:19:18,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:19:18,874 INFO L85 PathProgramCache]: Analyzing trace with hash -2097712175, now seen corresponding path program 1 times [2024-11-03 09:19:18,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:19:18,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1712867822] [2024-11-03 09:19:18,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:19:18,874 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 09:19:18,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:19:18,884 INFO L229 MonitoredProcess]: Starting monitored process 9 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 09:19:18,885 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 (9)] Waiting until timeout for monitored process [2024-11-03 09:19:18,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-03 09:19:18,914 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-03 09:19:18,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-03 09:19:18,940 INFO L130 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2024-11-03 09:19:18,940 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-03 09:19:18,941 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-03 09:19:18,949 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 (9)] Ended with exit code 0 [2024-11-03 09:19:19,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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 09:19:19,144 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 09:19:19,156 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-03 09:19:19,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 09:19:19 BoogieIcfgContainer [2024-11-03 09:19:19,158 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-03 09:19:19,158 INFO L158 Benchmark]: Toolchain (without parser) took 5533.17ms. Allocated memory was 220.2MB in the beginning and 285.2MB in the end (delta: 65.0MB). Free memory was 181.7MB in the beginning and 151.8MB in the end (delta: 29.9MB). Peak memory consumption was 97.1MB. Max. memory is 8.0GB. [2024-11-03 09:19:19,159 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 220.2MB. Free memory is still 177.3MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-03 09:19:19,159 INFO L158 Benchmark]: CACSL2BoogieTranslator took 416.08ms. Allocated memory was 220.2MB in the beginning and 285.2MB in the end (delta: 65.0MB). Free memory was 181.4MB in the beginning and 245.9MB in the end (delta: -64.5MB). Peak memory consumption was 47.5MB. Max. memory is 8.0GB. [2024-11-03 09:19:19,159 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.37ms. Allocated memory is still 285.2MB. Free memory was 245.9MB in the beginning and 242.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-11-03 09:19:19,159 INFO L158 Benchmark]: Boogie Preprocessor took 34.50ms. Allocated memory is still 285.2MB. Free memory was 242.8MB in the beginning and 240.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-11-03 09:19:19,159 INFO L158 Benchmark]: RCFGBuilder took 389.62ms. Allocated memory is still 285.2MB. Free memory was 240.1MB in the beginning and 221.8MB in the end (delta: 18.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2024-11-03 09:19:19,159 INFO L158 Benchmark]: TraceAbstraction took 4643.10ms. Allocated memory is still 285.2MB. Free memory was 221.3MB in the beginning and 151.8MB in the end (delta: 69.5MB). Peak memory consumption was 69.5MB. Max. memory is 8.0GB. [2024-11-03 09:19:19,160 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 220.2MB. Free memory is still 177.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 416.08ms. Allocated memory was 220.2MB in the beginning and 285.2MB in the end (delta: 65.0MB). Free memory was 181.4MB in the beginning and 245.9MB in the end (delta: -64.5MB). Peak memory consumption was 47.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.37ms. Allocated memory is still 285.2MB. Free memory was 245.9MB in the beginning and 242.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.50ms. Allocated memory is still 285.2MB. Free memory was 242.8MB in the beginning and 240.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 389.62ms. Allocated memory is still 285.2MB. Free memory was 240.1MB in the beginning and 221.8MB in the end (delta: 18.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 4643.10ms. Allocated memory is still 285.2MB. Free memory was 221.3MB in the beginning and 151.8MB in the end (delta: 69.5MB). Peak memory consumption was 69.5MB. 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: 997]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of nearbyint at line 1006. Possible FailurePath: [L1000] int const modes[] = {0x400, 0, 0xc00, 0x800}; [L1000] int const modes[] = {0x400, 0, 0xc00, 0x800}; [L1000] int const modes[] = {0x400, 0, 0xc00, 0x800}; [L1000] int const modes[] = {0x400, 0, 0xc00, 0x800}; [L1000] int const modes[] = {0x400, 0, 0xc00, 0x800}; [L1002] int i = 0; VAL [i=0, modes={3:0}] [L1002] COND TRUE i < sizeof(modes) / sizeof(int) [L1003] EXPR modes[i] [L1003] FCALL fesetround(modes[i]) VAL [i=0, modes={3:0}] [L1004] modes[i] [L1005] case 0x400: [L1006] CALL __VERIFIER_assert(nearbyint(12.9) == 12.) VAL [\old(cond)=0] [L997] COND TRUE !(cond) VAL [\old(cond)=0] [L997] reach_error() VAL [\old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 63 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.6s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 214 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 165 mSDsluCounter, 3095 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2494 mSDsCounter, 78 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 670 IncrementalHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 78 mSolverCounterUnsat, 601 mSDtfsCounter, 670 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 202 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=7, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 100 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 118 NumberOfCodeBlocks, 118 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 190 ConstructedInterpolants, 10 QuantifiedInterpolants, 819 SizeOfPredicates, 38 NumberOfNonLiveVariables, 324 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 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 09:19:19,178 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...