/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.smt.solver External_ModelsAndUnsatCoreMode --traceabstraction.command.for.external.solver 'mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3' -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount100_file-31.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-03 07:55:16,191 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-03 07:55:16,252 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-03 07:55:16,257 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-03 07:55:16,258 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-03 07:55:16,287 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-03 07:55:16,288 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-03 07:55:16,288 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-03 07:55:16,289 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-03 07:55:16,289 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-03 07:55:16,289 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-03 07:55:16,290 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-03 07:55:16,292 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-03 07:55:16,293 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-03 07:55:16,294 INFO L153 SettingsManager]: * Use SBE=true [2024-11-03 07:55:16,294 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-03 07:55:16,294 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-03 07:55:16,295 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-03 07:55:16,295 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-03 07:55:16,295 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-03 07:55:16,295 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-03 07:55:16,297 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-03 07:55:16,297 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-03 07:55:16,298 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-03 07:55:16,298 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-03 07:55:16,298 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-03 07:55:16,298 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-03 07:55:16,299 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-03 07:55:16,299 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-03 07:55:16,299 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-03 07:55:16,300 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-03 07:55:16,300 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-03 07:55:16,300 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-03 07:55:16,300 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-03 07:55:16,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-03 07:55:16,301 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-03 07:55:16,301 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-03 07:55:16,301 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-03 07:55:16,302 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-03 07:55:16,302 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-03 07:55:16,302 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-03 07:55:16,303 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-03 07:55:16,303 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-03 07:55:16,303 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-03 07:55:16,303 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Command for external solver -> mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-03 07:55:16,507 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-03 07:55:16,531 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-03 07:55:16,535 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-03 07:55:16,536 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-03 07:55:16,536 INFO L274 PluginConnector]: CDTParser initialized [2024-11-03 07:55:16,537 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount100_file-31.i [2024-11-03 07:55:17,989 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-03 07:55:18,188 INFO L384 CDTParser]: Found 1 translation units. [2024-11-03 07:55:18,189 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount100_file-31.i [2024-11-03 07:55:18,197 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd21f1e68/50c14690cb9b4c98a332ba7aa2bf06b7/FLAG36e5c12dc [2024-11-03 07:55:18,208 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd21f1e68/50c14690cb9b4c98a332ba7aa2bf06b7 [2024-11-03 07:55:18,210 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-03 07:55:18,211 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-03 07:55:18,212 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-03 07:55:18,212 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-03 07:55:18,217 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-03 07:55:18,217 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 07:55:18" (1/1) ... [2024-11-03 07:55:18,218 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b4b0a94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 07:55:18, skipping insertion in model container [2024-11-03 07:55:18,218 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 07:55:18" (1/1) ... [2024-11-03 07:55:18,248 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-03 07:55:18,399 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount100_file-31.i[916,929] [2024-11-03 07:55:18,497 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-03 07:55:18,511 INFO L200 MainTranslator]: Completed pre-run [2024-11-03 07:55:18,521 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount100_file-31.i[916,929] [2024-11-03 07:55:18,561 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-03 07:55:18,584 INFO L204 MainTranslator]: Completed translation [2024-11-03 07:55:18,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 07:55:18 WrapperNode [2024-11-03 07:55:18,588 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-03 07:55:18,589 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-03 07:55:18,589 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-03 07:55:18,590 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-03 07:55:18,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 07:55:18" (1/1) ... [2024-11-03 07:55:18,614 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 07:55:18" (1/1) ... [2024-11-03 07:55:18,650 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 201 [2024-11-03 07:55:18,651 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-03 07:55:18,652 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-03 07:55:18,652 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-03 07:55:18,652 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-03 07:55:18,666 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 07:55:18" (1/1) ... [2024-11-03 07:55:18,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 07:55:18" (1/1) ... [2024-11-03 07:55:18,678 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 07:55:18" (1/1) ... [2024-11-03 07:55:18,698 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-03 07:55:18,698 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 07:55:18" (1/1) ... [2024-11-03 07:55:18,698 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 07:55:18" (1/1) ... [2024-11-03 07:55:18,711 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 07:55:18" (1/1) ... [2024-11-03 07:55:18,715 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 07:55:18" (1/1) ... [2024-11-03 07:55:18,717 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 07:55:18" (1/1) ... [2024-11-03 07:55:18,719 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 07:55:18" (1/1) ... [2024-11-03 07:55:18,723 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-03 07:55:18,724 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-03 07:55:18,725 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-03 07:55:18,725 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-03 07:55:18,725 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 07:55:18" (1/1) ... [2024-11-03 07:55:18,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-03 07:55:18,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-03 07:55:18,767 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-03 07:55:18,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-03 07:55:18,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-03 07:55:18,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-03 07:55:18,797 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-03 07:55:18,797 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-03 07:55:18,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-03 07:55:18,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-03 07:55:18,914 INFO L238 CfgBuilder]: Building ICFG [2024-11-03 07:55:18,916 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-03 07:55:23,908 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-11-03 07:55:23,908 INFO L287 CfgBuilder]: Performing block encoding [2024-11-03 07:55:23,925 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-03 07:55:23,925 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-03 07:55:23,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 07:55:23 BoogieIcfgContainer [2024-11-03 07:55:23,926 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-03 07:55:23,929 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-03 07:55:23,929 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-03 07:55:23,932 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-03 07:55:23,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 07:55:18" (1/3) ... [2024-11-03 07:55:23,933 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b96bf6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 07:55:23, skipping insertion in model container [2024-11-03 07:55:23,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 07:55:18" (2/3) ... [2024-11-03 07:55:23,934 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b96bf6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 07:55:23, skipping insertion in model container [2024-11-03 07:55:23,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 07:55:23" (3/3) ... [2024-11-03 07:55:23,935 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-31.i [2024-11-03 07:55:23,949 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-03 07:55:23,949 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-03 07:55:24,011 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-03 07:55:24,016 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;@707295e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-03 07:55:24,016 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-03 07:55:24,020 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 56 states have (on average 1.4464285714285714) internal successors, (81), 57 states have internal predecessors, (81), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-03 07:55:24,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-03 07:55:24,034 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 07:55:24,034 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 07:55:24,035 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 07:55:24,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 07:55:24,039 INFO L85 PathProgramCache]: Analyzing trace with hash -306530566, now seen corresponding path program 1 times [2024-11-03 07:55:24,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 07:55:24,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [254100957] [2024-11-03 07:55:24,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 07:55:24,050 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-03 07:55:24,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 07:55:24,053 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-03 07:55:24,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-03 07:55:24,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 07:55:24,612 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-03 07:55:24,622 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 07:55:24,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 746 trivial. 0 not checked. [2024-11-03 07:55:24,677 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 07:55:25,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 14 proven. 36 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2024-11-03 07:55:25,230 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 07:55:25,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [254100957] [2024-11-03 07:55:25,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [254100957] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-03 07:55:25,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-03 07:55:25,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-03 07:55:25,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837745167] [2024-11-03 07:55:25,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-03 07:55:25,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-03 07:55:25,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 07:55:25,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-03 07:55:25,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-03 07:55:25,259 INFO L87 Difference]: Start difference. First operand has 85 states, 56 states have (on average 1.4464285714285714) internal successors, (81), 57 states have internal predecessors, (81), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-03 07:55:25,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 07:55:25,285 INFO L93 Difference]: Finished difference Result 163 states and 286 transitions. [2024-11-03 07:55:25,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-03 07:55:25,287 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 169 [2024-11-03 07:55:25,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 07:55:25,297 INFO L225 Difference]: With dead ends: 163 [2024-11-03 07:55:25,297 INFO L226 Difference]: Without dead ends: 81 [2024-11-03 07:55:25,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-03 07:55:25,306 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-03 07:55:25,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-03 07:55:25,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-03 07:55:25,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-03 07:55:25,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 53 states have internal predecessors, (74), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-03 07:55:25,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 126 transitions. [2024-11-03 07:55:25,349 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 126 transitions. Word has length 169 [2024-11-03 07:55:25,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 07:55:25,350 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 126 transitions. [2024-11-03 07:55:25,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-03 07:55:25,350 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 126 transitions. [2024-11-03 07:55:25,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-03 07:55:25,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 07:55:25,357 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 07:55:25,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-03 07:55:25,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-03 07:55:25,559 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 07:55:25,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 07:55:25,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1336568910, now seen corresponding path program 1 times [2024-11-03 07:55:25,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 07:55:25,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2082680464] [2024-11-03 07:55:25,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 07:55:25,560 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-03 07:55:25,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 07:55:25,562 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-03 07:55:25,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-03 07:55:26,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 07:55:26,051 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-03 07:55:26,058 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 07:55:27,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-03 07:55:27,883 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 07:55:28,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-03 07:55:28,973 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 07:55:28,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2082680464] [2024-11-03 07:55:28,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2082680464] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 07:55:28,974 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 07:55:28,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [] total 4 [2024-11-03 07:55:28,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038781369] [2024-11-03 07:55:28,975 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 07:55:28,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-03 07:55:28,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 07:55:28,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-03 07:55:28,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-03 07:55:28,982 INFO L87 Difference]: Start difference. First operand 81 states and 126 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2024-11-03 07:55:34,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-03 07:55:37,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.95s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-03 07:55:40,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.38s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-03 07:55:40,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 07:55:40,825 INFO L93 Difference]: Finished difference Result 277 states and 430 transitions. [2024-11-03 07:55:40,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-03 07:55:40,871 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 169 [2024-11-03 07:55:40,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 07:55:40,875 INFO L225 Difference]: With dead ends: 277 [2024-11-03 07:55:40,875 INFO L226 Difference]: Without dead ends: 199 [2024-11-03 07:55:40,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-03 07:55:40,877 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 130 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 64 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.7s IncrementalHoareTripleChecker+Time [2024-11-03 07:55:40,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 385 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 31 Invalid, 1 Unknown, 0 Unchecked, 11.7s Time] [2024-11-03 07:55:40,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-03 07:55:40,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 150. [2024-11-03 07:55:40,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 95 states have (on average 1.3263157894736841) internal successors, (126), 95 states have internal predecessors, (126), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-03 07:55:40,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 230 transitions. [2024-11-03 07:55:40,913 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 230 transitions. Word has length 169 [2024-11-03 07:55:40,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 07:55:40,914 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 230 transitions. [2024-11-03 07:55:40,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2024-11-03 07:55:40,915 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 230 transitions. [2024-11-03 07:55:40,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-03 07:55:40,917 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 07:55:40,917 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 07:55:40,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-03 07:55:41,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-03 07:55:41,122 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 07:55:41,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 07:55:41,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1515830209, now seen corresponding path program 1 times [2024-11-03 07:55:41,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 07:55:41,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [270153250] [2024-11-03 07:55:41,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 07:55:41,124 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-03 07:55:41,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 07:55:41,129 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-03 07:55:41,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-03 07:55:41,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 07:55:41,629 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-03 07:55:41,634 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 07:55:44,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 637 proven. 90 refuted. 0 times theorem prover too weak. 573 trivial. 0 not checked. [2024-11-03 07:55:44,820 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 07:55:46,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 27 proven. 48 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-03 07:55:46,411 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 07:55:46,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [270153250] [2024-11-03 07:55:46,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [270153250] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 07:55:46,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 07:55:46,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 14 [2024-11-03 07:55:46,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801676245] [2024-11-03 07:55:46,412 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 07:55:46,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-03 07:55:46,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 07:55:46,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-03 07:55:46,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-03 07:55:46,414 INFO L87 Difference]: Start difference. First operand 150 states and 230 transitions. Second operand has 14 states, 14 states have (on average 5.785714285714286) internal successors, (81), 14 states have internal predecessors, (81), 3 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2024-11-03 07:55:54,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.28s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-03 07:55:59,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 07:55:59,725 INFO L93 Difference]: Finished difference Result 520 states and 774 transitions. [2024-11-03 07:55:59,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-03 07:55:59,726 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.785714285714286) internal successors, (81), 14 states have internal predecessors, (81), 3 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) Word has length 170 [2024-11-03 07:55:59,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 07:55:59,730 INFO L225 Difference]: With dead ends: 520 [2024-11-03 07:55:59,730 INFO L226 Difference]: Without dead ends: 373 [2024-11-03 07:55:59,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 329 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=338, Invalid=1068, Unknown=0, NotChecked=0, Total=1406 [2024-11-03 07:55:59,733 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 273 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 824 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.5s IncrementalHoareTripleChecker+Time [2024-11-03 07:55:59,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 973 Invalid, 961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 824 Invalid, 0 Unknown, 0 Unchecked, 11.5s Time] [2024-11-03 07:55:59,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2024-11-03 07:55:59,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 191. [2024-11-03 07:55:59,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 123 states have (on average 1.2926829268292683) internal successors, (159), 124 states have internal predecessors, (159), 61 states have call successors, (61), 6 states have call predecessors, (61), 6 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2024-11-03 07:55:59,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 281 transitions. [2024-11-03 07:55:59,772 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 281 transitions. Word has length 170 [2024-11-03 07:55:59,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 07:55:59,773 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 281 transitions. [2024-11-03 07:55:59,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.785714285714286) internal successors, (81), 14 states have internal predecessors, (81), 3 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2024-11-03 07:55:59,773 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 281 transitions. [2024-11-03 07:55:59,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-03 07:55:59,775 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 07:55:59,776 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 07:55:59,797 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 (4)] Forceful destruction successful, exit code 0 [2024-11-03 07:55:59,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-03 07:55:59,977 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 07:55:59,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 07:55:59,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1499273409, now seen corresponding path program 1 times [2024-11-03 07:55:59,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 07:55:59,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1624315848] [2024-11-03 07:55:59,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 07:55:59,978 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-03 07:55:59,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 07:55:59,985 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 07:55:59,986 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 07:56:00,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 07:56:00,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-03 07:56:00,421 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 07:56:02,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-03 07:56:02,370 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 07:56:03,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-03 07:56:03,527 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 07:56:03,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1624315848] [2024-11-03 07:56:03,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1624315848] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 07:56:03,527 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 07:56:03,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 5] imperfect sequences [] total 5 [2024-11-03 07:56:03,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082390874] [2024-11-03 07:56:03,527 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 07:56:03,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-03 07:56:03,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 07:56:03,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-03 07:56:03,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-03 07:56:03,530 INFO L87 Difference]: Start difference. First operand 191 states and 281 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2024-11-03 07:56:07,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-03 07:56:11,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.44s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-03 07:56:16,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-03 07:56:16,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 07:56:16,833 INFO L93 Difference]: Finished difference Result 563 states and 820 transitions. [2024-11-03 07:56:16,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-03 07:56:16,834 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 170 [2024-11-03 07:56:16,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 07:56:16,838 INFO L225 Difference]: With dead ends: 563 [2024-11-03 07:56:16,838 INFO L226 Difference]: Without dead ends: 389 [2024-11-03 07:56:16,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-03 07:56:16,839 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 179 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 59 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.1s IncrementalHoareTripleChecker+Time [2024-11-03 07:56:16,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 558 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 40 Invalid, 2 Unknown, 0 Unchecked, 13.1s Time] [2024-11-03 07:56:16,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-11-03 07:56:16,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 310. [2024-11-03 07:56:16,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 193 states have (on average 1.2487046632124352) internal successors, (241), 193 states have internal predecessors, (241), 104 states have call successors, (104), 12 states have call predecessors, (104), 12 states have return successors, (104), 104 states have call predecessors, (104), 104 states have call successors, (104) [2024-11-03 07:56:16,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 449 transitions. [2024-11-03 07:56:16,878 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 449 transitions. Word has length 170 [2024-11-03 07:56:16,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 07:56:16,879 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 449 transitions. [2024-11-03 07:56:16,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2024-11-03 07:56:16,879 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 449 transitions. [2024-11-03 07:56:16,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-03 07:56:16,881 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 07:56:16,881 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 07:56:16,906 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 (5)] Ended with exit code 0 [2024-11-03 07:56:17,085 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 07:56:17,086 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 07:56:17,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 07:56:17,087 INFO L85 PathProgramCache]: Analyzing trace with hash 747396419, now seen corresponding path program 1 times [2024-11-03 07:56:17,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 07:56:17,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1470185857] [2024-11-03 07:56:17,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 07:56:17,087 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-03 07:56:17,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 07:56:17,088 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 07:56:17,089 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 07:56:17,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 07:56:17,525 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-03 07:56:17,529 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 07:56:17,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-03 07:56:17,864 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 07:56:18,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-03 07:56:18,728 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 07:56:18,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1470185857] [2024-11-03 07:56:18,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1470185857] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 07:56:18,729 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 07:56:18,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2024-11-03 07:56:18,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328831127] [2024-11-03 07:56:18,729 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 07:56:18,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-03 07:56:18,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 07:56:18,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-03 07:56:18,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-03 07:56:18,730 INFO L87 Difference]: Start difference. First operand 310 states and 449 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-03 07:56:23,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-03 07:56:27,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-03 07:56:30,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-03 07:56:34,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-03 07:56:38,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-03 07:56:42,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-03 07:56:46,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-03 07:56:49,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-03 07:56:49,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 07:56:49,101 INFO L93 Difference]: Finished difference Result 617 states and 890 transitions. [2024-11-03 07:56:49,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-03 07:56:49,171 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171 [2024-11-03 07:56:49,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 07:56:49,175 INFO L225 Difference]: With dead ends: 617 [2024-11-03 07:56:49,175 INFO L226 Difference]: Without dead ends: 366 [2024-11-03 07:56:49,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-03 07:56:49,177 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 74 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.3s IncrementalHoareTripleChecker+Time [2024-11-03 07:56:49,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 640 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 6 Unknown, 0 Unchecked, 30.3s Time] [2024-11-03 07:56:49,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-11-03 07:56:49,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 325. [2024-11-03 07:56:49,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 208 states have (on average 1.2692307692307692) internal successors, (264), 208 states have internal predecessors, (264), 104 states have call successors, (104), 12 states have call predecessors, (104), 12 states have return successors, (104), 104 states have call predecessors, (104), 104 states have call successors, (104) [2024-11-03 07:56:49,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 472 transitions. [2024-11-03 07:56:49,213 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 472 transitions. Word has length 171 [2024-11-03 07:56:49,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 07:56:49,214 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 472 transitions. [2024-11-03 07:56:49,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-03 07:56:49,214 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 472 transitions. [2024-11-03 07:56:49,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-03 07:56:49,217 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 07:56:49,217 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 07:56:49,240 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 07:56:49,418 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 07:56:49,418 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 07:56:49,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 07:56:49,419 INFO L85 PathProgramCache]: Analyzing trace with hash 804654721, now seen corresponding path program 1 times [2024-11-03 07:56:49,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 07:56:49,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [788988957] [2024-11-03 07:56:49,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 07:56:49,419 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-03 07:56:49,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 07:56:49,421 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 07:56:49,422 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 07:56:49,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 07:56:49,921 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-03 07:56:49,924 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 07:56:51,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-03 07:56:51,915 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 07:56:52,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-03 07:56:52,656 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 07:56:52,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [788988957] [2024-11-03 07:56:52,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [788988957] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 07:56:52,656 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 07:56:52,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 4] imperfect sequences [] total 9 [2024-11-03 07:56:52,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926145624] [2024-11-03 07:56:52,657 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 07:56:52,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-03 07:56:52,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 07:56:52,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-03 07:56:52,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-03 07:56:52,658 INFO L87 Difference]: Start difference. First operand 325 states and 472 transitions. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 2 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 2 states have call predecessors, (52), 2 states have call successors, (52)