/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-62.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-23 00:25:46,396 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-23 00:25:46,461 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-23 00:25:46,466 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-23 00:25:46,467 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-23 00:25:46,495 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-23 00:25:46,496 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-23 00:25:46,496 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-23 00:25:46,496 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-23 00:25:46,499 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-23 00:25:46,500 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-23 00:25:46,500 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-23 00:25:46,500 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-23 00:25:46,501 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-23 00:25:46,501 INFO L153 SettingsManager]: * Use SBE=true [2023-12-23 00:25:46,502 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-23 00:25:46,502 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-23 00:25:46,502 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-23 00:25:46,502 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-23 00:25:46,502 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-23 00:25:46,502 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-23 00:25:46,503 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-23 00:25:46,503 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-23 00:25:46,503 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-23 00:25:46,503 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-23 00:25:46,503 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-23 00:25:46,503 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-23 00:25:46,504 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-23 00:25:46,504 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-23 00:25:46,504 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-23 00:25:46,505 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-23 00:25:46,505 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-23 00:25:46,505 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-23 00:25:46,505 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-23 00:25:46,505 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-23 00:25:46,505 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-23 00:25:46,506 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-23 00:25:46,506 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-23 00:25:46,506 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-23 00:25:46,506 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-23 00:25:46,506 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-23 00:25:46,506 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-23 00:25:46,507 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-23 00:25:46,507 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-23 00:25:46,507 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-23 00:25:46,507 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-23 00:25:46,507 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 [2023-12-23 00:25:46,744 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-23 00:25:46,758 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-23 00:25:46,760 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-23 00:25:46,761 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-23 00:25:46,761 INFO L274 PluginConnector]: CDTParser initialized [2023-12-23 00:25:46,763 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-62.i [2023-12-23 00:25:48,012 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-23 00:25:48,216 INFO L384 CDTParser]: Found 1 translation units. [2023-12-23 00:25:48,217 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-62.i [2023-12-23 00:25:48,228 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/241576f5a/82d3ae3b03a24466af0747ba5882240a/FLAG9b30084ba [2023-12-23 00:25:48,249 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/241576f5a/82d3ae3b03a24466af0747ba5882240a [2023-12-23 00:25:48,251 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-23 00:25:48,252 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-23 00:25:48,253 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-23 00:25:48,253 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-23 00:25:48,257 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-23 00:25:48,258 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 12:25:48" (1/1) ... [2023-12-23 00:25:48,258 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ac8753a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 12:25:48, skipping insertion in model container [2023-12-23 00:25:48,258 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 12:25:48" (1/1) ... [2023-12-23 00:25:48,296 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-23 00:25:48,422 WARN L239 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_fillercode_fillercodesize_ps-cn-100_file-62.i[916,929] [2023-12-23 00:25:48,494 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-23 00:25:48,511 INFO L202 MainTranslator]: Completed pre-run [2023-12-23 00:25:48,521 WARN L239 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_fillercode_fillercodesize_ps-cn-100_file-62.i[916,929] [2023-12-23 00:25:48,562 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-23 00:25:48,578 INFO L206 MainTranslator]: Completed translation [2023-12-23 00:25:48,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 12:25:48 WrapperNode [2023-12-23 00:25:48,579 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-23 00:25:48,580 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-23 00:25:48,580 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-23 00:25:48,580 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-23 00:25:48,586 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 12:25:48" (1/1) ... [2023-12-23 00:25:48,619 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 12:25:48" (1/1) ... [2023-12-23 00:25:48,650 INFO L138 Inliner]: procedures = 27, calls = 61, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 269 [2023-12-23 00:25:48,651 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-23 00:25:48,651 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-23 00:25:48,651 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-23 00:25:48,652 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-23 00:25:48,662 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 12:25:48" (1/1) ... [2023-12-23 00:25:48,662 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 12:25:48" (1/1) ... [2023-12-23 00:25:48,666 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 12:25:48" (1/1) ... [2023-12-23 00:25:48,678 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]. [2023-12-23 00:25:48,678 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 12:25:48" (1/1) ... [2023-12-23 00:25:48,679 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 12:25:48" (1/1) ... [2023-12-23 00:25:48,702 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 12:25:48" (1/1) ... [2023-12-23 00:25:48,705 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 12:25:48" (1/1) ... [2023-12-23 00:25:48,707 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 12:25:48" (1/1) ... [2023-12-23 00:25:48,709 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 12:25:48" (1/1) ... [2023-12-23 00:25:48,721 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-23 00:25:48,722 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-23 00:25:48,722 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-23 00:25:48,722 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-23 00:25:48,722 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 12:25:48" (1/1) ... [2023-12-23 00:25:48,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-23 00:25:48,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-23 00:25:48,765 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) [2023-12-23 00:25:48,772 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 [2023-12-23 00:25:48,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-23 00:25:48,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-23 00:25:48,790 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-23 00:25:48,791 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-23 00:25:48,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-23 00:25:48,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-23 00:25:48,887 INFO L241 CfgBuilder]: Building ICFG [2023-12-23 00:25:48,889 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-23 00:26:26,999 INFO L282 CfgBuilder]: Performing block encoding [2023-12-23 00:26:27,045 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-23 00:26:27,046 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-23 00:26:27,046 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 12:26:27 BoogieIcfgContainer [2023-12-23 00:26:27,046 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-23 00:26:27,048 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-23 00:26:27,048 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-23 00:26:27,066 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-23 00:26:27,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 12:25:48" (1/3) ... [2023-12-23 00:26:27,067 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@117f4302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 12:26:27, skipping insertion in model container [2023-12-23 00:26:27,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 12:25:48" (2/3) ... [2023-12-23 00:26:27,067 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@117f4302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 12:26:27, skipping insertion in model container [2023-12-23 00:26:27,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 12:26:27" (3/3) ... [2023-12-23 00:26:27,068 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-62.i [2023-12-23 00:26:27,082 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-23 00:26:27,082 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-23 00:26:27,124 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-23 00:26:27,129 INFO L357 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, mHoare=true, 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;@4c6889e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-23 00:26:27,129 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-23 00:26:27,145 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 68 states have (on average 1.5) internal successors, (102), 69 states have internal predecessors, (102), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-23 00:26:27,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2023-12-23 00:26:27,159 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 00:26:27,160 INFO L195 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-23 00:26:27,160 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 00:26:27,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 00:26:27,167 INFO L85 PathProgramCache]: Analyzing trace with hash 2025624255, now seen corresponding path program 1 times [2023-12-23 00:26:27,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 00:26:27,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1778082972] [2023-12-23 00:26:27,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 00:26:27,179 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 [2023-12-23 00:26:27,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 00:26:27,185 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) [2023-12-23 00:26:27,187 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 [2023-12-23 00:26:29,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 00:26:29,352 INFO L262 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-23 00:26:29,363 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 00:26:29,417 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 2078 proven. 0 refuted. 0 times theorem prover too weak. 2434 trivial. 0 not checked. [2023-12-23 00:26:29,417 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 00:26:29,418 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 00:26:29,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1778082972] [2023-12-23 00:26:29,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1778082972] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 00:26:29,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 00:26:29,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-23 00:26:29,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823371593] [2023-12-23 00:26:29,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 00:26:29,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-23 00:26:29,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 00:26:29,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-23 00:26:29,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-23 00:26:29,465 INFO L87 Difference]: Start difference. First operand has 119 states, 68 states have (on average 1.5) internal successors, (102), 69 states have internal predecessors, (102), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2023-12-23 00:26:34,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 00:26:34,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 00:26:34,674 INFO L93 Difference]: Finished difference Result 234 states and 440 transitions. [2023-12-23 00:26:35,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-23 00:26:35,107 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) Word has length 293 [2023-12-23 00:26:35,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 00:26:35,113 INFO L225 Difference]: With dead ends: 234 [2023-12-23 00:26:35,114 INFO L226 Difference]: Without dead ends: 116 [2023-12-23 00:26:35,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-23 00:26:35,120 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2023-12-23 00:26:35,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 187 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 5.2s Time] [2023-12-23 00:26:35,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-12-23 00:26:35,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2023-12-23 00:26:35,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 66 states have internal predecessors, (94), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-23 00:26:35,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 190 transitions. [2023-12-23 00:26:35,167 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 190 transitions. Word has length 293 [2023-12-23 00:26:35,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 00:26:35,167 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 190 transitions. [2023-12-23 00:26:35,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2023-12-23 00:26:35,168 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 190 transitions. [2023-12-23 00:26:35,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2023-12-23 00:26:35,172 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 00:26:35,188 INFO L195 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-23 00:26:35,243 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 [2023-12-23 00:26:35,392 WARN L477 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 [2023-12-23 00:26:35,393 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 00:26:35,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 00:26:35,394 INFO L85 PathProgramCache]: Analyzing trace with hash -868741297, now seen corresponding path program 1 times [2023-12-23 00:26:35,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 00:26:35,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [584685767] [2023-12-23 00:26:35,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 00:26:35,396 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 [2023-12-23 00:26:35,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 00:26:35,397 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) [2023-12-23 00:26:35,399 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 [2023-12-23 00:26:37,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 00:26:37,583 INFO L262 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-23 00:26:37,591 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 00:26:46,883 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2023-12-23 00:26:46,884 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 00:26:46,884 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 00:26:46,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [584685767] [2023-12-23 00:26:46,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [584685767] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 00:26:46,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 00:26:46,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-23 00:26:46,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86242328] [2023-12-23 00:26:46,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 00:26:46,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-23 00:26:46,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 00:26:46,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-23 00:26:46,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-23 00:26:46,887 INFO L87 Difference]: Start difference. First operand 116 states and 190 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 2 states have internal predecessors, (56), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2023-12-23 00:26:52,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 00:26:56,348 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 [] [2023-12-23 00:27:00,364 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 [] [2023-12-23 00:27:00,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 00:27:00,832 INFO L93 Difference]: Finished difference Result 345 states and 566 transitions. [2023-12-23 00:27:00,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-23 00:27:00,834 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 2 states have internal predecessors, (56), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 293 [2023-12-23 00:27:00,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 00:27:00,839 INFO L225 Difference]: With dead ends: 345 [2023-12-23 00:27:00,839 INFO L226 Difference]: Without dead ends: 230 [2023-12-23 00:27:00,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-23 00:27:00,841 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 56 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.9s IncrementalHoareTripleChecker+Time [2023-12-23 00:27:00,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 404 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 3 Unknown, 0 Unchecked, 13.9s Time] [2023-12-23 00:27:00,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2023-12-23 00:27:00,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 228. [2023-12-23 00:27:00,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 129 states have (on average 1.4108527131782946) internal successors, (182), 129 states have internal predecessors, (182), 96 states have call successors, (96), 2 states have call predecessors, (96), 2 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2023-12-23 00:27:00,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 374 transitions. [2023-12-23 00:27:00,875 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 374 transitions. Word has length 293 [2023-12-23 00:27:00,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 00:27:00,876 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 374 transitions. [2023-12-23 00:27:00,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 2 states have internal predecessors, (56), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2023-12-23 00:27:00,877 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 374 transitions. [2023-12-23 00:27:00,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2023-12-23 00:27:00,880 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 00:27:00,880 INFO L195 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-23 00:27:00,939 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 [2023-12-23 00:27:01,108 WARN L477 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 [2023-12-23 00:27:01,109 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 00:27:01,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 00:27:01,109 INFO L85 PathProgramCache]: Analyzing trace with hash -734727791, now seen corresponding path program 1 times [2023-12-23 00:27:01,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 00:27:01,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2112434974] [2023-12-23 00:27:01,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 00:27:01,110 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 [2023-12-23 00:27:01,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 00:27:01,112 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) [2023-12-23 00:27:01,113 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 [2023-12-23 00:27:03,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 00:27:03,330 INFO L262 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-23 00:27:03,337 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 00:27:04,329 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2023-12-23 00:27:04,330 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 00:27:04,332 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 00:27:04,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2112434974] [2023-12-23 00:27:04,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2112434974] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 00:27:04,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 00:27:04,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-23 00:27:04,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189798520] [2023-12-23 00:27:04,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 00:27:04,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-23 00:27:04,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 00:27:04,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-23 00:27:04,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-23 00:27:04,340 INFO L87 Difference]: Start difference. First operand 228 states and 374 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2023-12-23 00:27:10,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 00:27:14,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 00:27:18,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 00:27:22,312 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 [] [2023-12-23 00:27:26,325 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 [] [2023-12-23 00:27:30,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 00:27:31,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 00:27:31,927 INFO L93 Difference]: Finished difference Result 483 states and 791 transitions. [2023-12-23 00:27:31,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-23 00:27:31,931 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 293 [2023-12-23 00:27:31,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 00:27:31,935 INFO L225 Difference]: With dead ends: 483 [2023-12-23 00:27:31,935 INFO L226 Difference]: Without dead ends: 368 [2023-12-23 00:27:31,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-23 00:27:31,936 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 220 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 3 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.5s IncrementalHoareTripleChecker+Time [2023-12-23 00:27:31,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 686 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 104 Invalid, 6 Unknown, 0 Unchecked, 27.5s Time] [2023-12-23 00:27:31,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2023-12-23 00:27:32,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 297. [2023-12-23 00:27:32,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 176 states have (on average 1.4431818181818181) internal successors, (254), 177 states have internal predecessors, (254), 117 states have call successors, (117), 3 states have call predecessors, (117), 3 states have return successors, (117), 116 states have call predecessors, (117), 117 states have call successors, (117) [2023-12-23 00:27:32,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 488 transitions. [2023-12-23 00:27:32,045 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 488 transitions. Word has length 293 [2023-12-23 00:27:32,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 00:27:32,049 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 488 transitions. [2023-12-23 00:27:32,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2023-12-23 00:27:32,050 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 488 transitions. [2023-12-23 00:27:32,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2023-12-23 00:27:32,055 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 00:27:32,055 INFO L195 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-23 00:27:32,106 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 [2023-12-23 00:27:32,256 WARN L477 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 [2023-12-23 00:27:32,257 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 00:27:32,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 00:27:32,257 INFO L85 PathProgramCache]: Analyzing trace with hash 372777595, now seen corresponding path program 1 times [2023-12-23 00:27:32,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 00:27:32,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1645527737] [2023-12-23 00:27:32,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 00:27:32,258 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 [2023-12-23 00:27:32,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 00:27:32,260 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) [2023-12-23 00:27:32,261 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 [2023-12-23 00:27:34,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 00:27:34,423 INFO L262 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-23 00:27:34,428 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 00:27:36,722 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 1247 proven. 21 refuted. 0 times theorem prover too weak. 3244 trivial. 0 not checked. [2023-12-23 00:27:36,723 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-23 00:27:39,136 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 120 proven. 21 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2023-12-23 00:27:39,137 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 00:27:39,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1645527737] [2023-12-23 00:27:39,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1645527737] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-23 00:27:39,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-23 00:27:39,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-12-23 00:27:39,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333614524] [2023-12-23 00:27:39,139 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-23 00:27:39,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-23 00:27:39,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 00:27:39,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-23 00:27:39,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-12-23 00:27:39,144 INFO L87 Difference]: Start difference. First operand 297 states and 488 transitions. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 3 states have call successors, (55), 2 states have call predecessors, (55), 4 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) [2023-12-23 00:27:46,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 00:27:52,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 00:27:56,404 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 [] [2023-12-23 00:28:00,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 00:28:00,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 00:28:00,446 INFO L93 Difference]: Finished difference Result 607 states and 987 transitions. [2023-12-23 00:28:00,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-23 00:28:00,912 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 3 states have call successors, (55), 2 states have call predecessors, (55), 4 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) Word has length 294 [2023-12-23 00:28:00,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 00:28:00,915 INFO L225 Difference]: With dead ends: 607 [2023-12-23 00:28:00,915 INFO L226 Difference]: Without dead ends: 311 [2023-12-23 00:28:00,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 593 GetRequests, 579 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2023-12-23 00:28:00,918 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 175 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 199 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.3s IncrementalHoareTripleChecker+Time [2023-12-23 00:28:00,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 284 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 261 Invalid, 3 Unknown, 0 Unchecked, 20.3s Time] [2023-12-23 00:28:00,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2023-12-23 00:28:00,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 305. [2023-12-23 00:28:00,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 182 states have (on average 1.4120879120879122) internal successors, (257), 183 states have internal predecessors, (257), 117 states have call successors, (117), 5 states have call predecessors, (117), 5 states have return successors, (117), 116 states have call predecessors, (117), 117 states have call successors, (117) [2023-12-23 00:28:00,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 491 transitions. [2023-12-23 00:28:00,942 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 491 transitions. Word has length 294 [2023-12-23 00:28:00,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 00:28:00,942 INFO L495 AbstractCegarLoop]: Abstraction has 305 states and 491 transitions. [2023-12-23 00:28:00,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 3 states have call successors, (55), 2 states have call predecessors, (55), 4 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) [2023-12-23 00:28:00,943 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 491 transitions. [2023-12-23 00:28:00,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2023-12-23 00:28:00,944 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 00:28:00,944 INFO L195 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-23 00:28:00,996 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 [2023-12-23 00:28:01,160 WARN L477 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 [2023-12-23 00:28:01,161 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 00:28:01,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 00:28:01,161 INFO L85 PathProgramCache]: Analyzing trace with hash -907086083, now seen corresponding path program 1 times [2023-12-23 00:28:01,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 00:28:01,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2082954596] [2023-12-23 00:28:01,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 00:28:01,162 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 [2023-12-23 00:28:01,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 00:28:01,163 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) [2023-12-23 00:28:01,169 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 [2023-12-23 00:28:07,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 00:28:07,305 INFO L262 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-23 00:28:07,313 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 00:30:40,323 WARN L293 SmtUtils]: Spent 6.22s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 00:30:48,488 WARN L293 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 00:30:54,489 WARN L293 SmtUtils]: Spent 6.00s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 00:31:01,772 WARN L293 SmtUtils]: Spent 7.28s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 00:31:08,586 WARN L293 SmtUtils]: Spent 6.81s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 00:31:27,212 WARN L293 SmtUtils]: Spent 6.52s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 00:31:32,867 WARN L293 SmtUtils]: Spent 5.65s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 00:32:00,116 WARN L293 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 00:32:08,305 WARN L293 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 00:32:16,529 WARN L293 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 00:32:24,266 WARN L293 SmtUtils]: Spent 7.74s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 00:32:39,151 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode .cse9)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_12~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0))) (.cse7 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (and (fp.geq c_~var_1_6~0 .cse0) (fp.geq c_~var_1_8~0 .cse0) (fp.leq c_~var_1_7~0 .cse1) (fp.geq c_~var_1_7~0 .cse0) (let ((.cse3 (= c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode c_~var_1_8~0))) (.cse2 (fp.gt .cse6 c_~var_1_7~0))) (or (and (not .cse2) (let ((.cse4 (fp.lt c_~var_1_7~0 c_~var_1_8~0))) (or (and .cse3 (not .cse4)) (and .cse4 (= c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode c_~var_1_7~0)))))) (and (let ((.cse5 (fp.lt .cse6 c_~var_1_8~0))) (or (and .cse5 (= c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode .cse6))) (and .cse3 (not .cse5)))) .cse2))) (fp.leq .cse6 (fp.mul c_currentRoundingMode c_~var_1_7~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 29.0 5.0))))) (fp.leq c_~var_1_8~0 .cse1) (fp.leq c_~var_1_12~0 .cse7) (let ((.cse8 ((_ to_fp 8 24) c_currentRoundingMode 2305843009213691390.0))) (or (and (fp.leq c_~var_1_11~0 .cse8) (fp.geq c_~var_1_11~0 .cse9)) (and (fp.geq c_~var_1_11~0 (fp.neg .cse8)) (fp.leq c_~var_1_11~0 (fp.neg .cse9))))) (fp.geq c_~var_1_12~0 .cse9) (fp.leq c_~var_1_6~0 ((_ to_fp 11 53) c_currentRoundingMode .cse7)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2023-12-23 00:32:43,226 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse9 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode .cse9)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_12~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0))) (.cse7 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (and (fp.geq c_~var_1_6~0 .cse0) (fp.geq c_~var_1_8~0 .cse0) (fp.leq c_~var_1_7~0 .cse1) (fp.geq c_~var_1_7~0 .cse0) (let ((.cse3 (= c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode c_~var_1_8~0))) (.cse2 (fp.gt .cse6 c_~var_1_7~0))) (or (and (not .cse2) (let ((.cse4 (fp.lt c_~var_1_7~0 c_~var_1_8~0))) (or (and .cse3 (not .cse4)) (and .cse4 (= c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode c_~var_1_7~0)))))) (and (let ((.cse5 (fp.lt .cse6 c_~var_1_8~0))) (or (and .cse5 (= c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode .cse6))) (and .cse3 (not .cse5)))) .cse2))) (fp.leq .cse6 (fp.mul c_currentRoundingMode c_~var_1_7~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 29.0 5.0))))) (fp.leq c_~var_1_8~0 .cse1) (fp.leq c_~var_1_12~0 .cse7) (let ((.cse8 ((_ to_fp 8 24) c_currentRoundingMode 2305843009213691390.0))) (or (and (fp.leq c_~var_1_11~0 .cse8) (fp.geq c_~var_1_11~0 .cse9)) (and (fp.geq c_~var_1_11~0 (fp.neg .cse8)) (fp.leq c_~var_1_11~0 (fp.neg .cse9))))) (fp.geq c_~var_1_12~0 .cse9) (fp.leq c_~var_1_6~0 ((_ to_fp 11 53) c_currentRoundingMode .cse7)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2023-12-23 00:32:53,671 WARN L293 SmtUtils]: Spent 5.99s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 00:32:59,415 WARN L293 SmtUtils]: Spent 5.74s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 00:33:11,504 WARN L293 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 00:33:23,455 WARN L293 SmtUtils]: Spent 7.81s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 00:33:30,974 WARN L293 SmtUtils]: Spent 7.52s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 00:33:37,883 WARN L293 SmtUtils]: Spent 6.91s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 00:33:46,090 WARN L293 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 00:34:01,690 WARN L293 SmtUtils]: Spent 7.76s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 00:34:11,575 WARN L293 SmtUtils]: Spent 6.33s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 00:34:29,898 WARN L293 SmtUtils]: Spent 5.76s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 00:34:36,301 WARN L293 SmtUtils]: Spent 6.40s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 00:34:41,483 WARN L293 SmtUtils]: Spent 5.18s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 00:34:49,570 WARN L293 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 00:34:55,790 WARN L293 SmtUtils]: Spent 6.22s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 00:35:02,402 WARN L293 SmtUtils]: Spent 6.61s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 00:35:09,563 WARN L293 SmtUtils]: Spent 7.16s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 00:35:20,343 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse11 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode .cse11)) (.cse8 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_12~0)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0))) (.cse9 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (and (fp.geq c_~var_1_6~0 .cse0) (fp.geq c_~var_1_8~0 .cse0) (let ((.cse1 ((_ zero_extend 24) c_~var_1_21~0))) (let ((.cse2 (bvsgt .cse1 (_ bv32 32)))) (or (and (= c_~var_1_19~0 ((_ extract 7 0) .cse1)) .cse2) (and (= c_~var_1_19~0 (_ bv32 8)) (not .cse2))))) (fp.leq c_~var_1_7~0 .cse3) (fp.geq c_~var_1_7~0 .cse0) (let ((.cse5 (= c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode c_~var_1_8~0))) (.cse4 (fp.gt .cse8 c_~var_1_7~0))) (or (and (not .cse4) (let ((.cse6 (fp.lt c_~var_1_7~0 c_~var_1_8~0))) (or (and .cse5 (not .cse6)) (and .cse6 (= c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode c_~var_1_7~0)))))) (and (let ((.cse7 (fp.lt .cse8 c_~var_1_8~0))) (or (and .cse7 (= c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode .cse8))) (and .cse5 (not .cse7)))) .cse4))) (fp.leq .cse8 (fp.mul c_currentRoundingMode c_~var_1_7~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 29.0 5.0))))) (fp.leq c_~var_1_8~0 .cse3) (fp.leq c_~var_1_12~0 .cse9) (let ((.cse10 ((_ to_fp 8 24) c_currentRoundingMode 2305843009213691390.0))) (or (and (fp.leq c_~var_1_11~0 .cse10) (fp.geq c_~var_1_11~0 .cse11)) (and (fp.geq c_~var_1_11~0 (fp.neg .cse10)) (fp.leq c_~var_1_11~0 (fp.neg .cse11))))) (fp.geq c_~var_1_12~0 .cse11) (fp.leq c_~var_1_6~0 ((_ to_fp 11 53) c_currentRoundingMode .cse9)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2023-12-23 00:35:24,399 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse11 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode .cse11)) (.cse8 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_12~0)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0))) (.cse9 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (and (fp.geq c_~var_1_6~0 .cse0) (fp.geq c_~var_1_8~0 .cse0) (let ((.cse1 ((_ zero_extend 24) c_~var_1_21~0))) (let ((.cse2 (bvsgt .cse1 (_ bv32 32)))) (or (and (= c_~var_1_19~0 ((_ extract 7 0) .cse1)) .cse2) (and (= c_~var_1_19~0 (_ bv32 8)) (not .cse2))))) (fp.leq c_~var_1_7~0 .cse3) (fp.geq c_~var_1_7~0 .cse0) (let ((.cse5 (= c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode c_~var_1_8~0))) (.cse4 (fp.gt .cse8 c_~var_1_7~0))) (or (and (not .cse4) (let ((.cse6 (fp.lt c_~var_1_7~0 c_~var_1_8~0))) (or (and .cse5 (not .cse6)) (and .cse6 (= c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode c_~var_1_7~0)))))) (and (let ((.cse7 (fp.lt .cse8 c_~var_1_8~0))) (or (and .cse7 (= c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode .cse8))) (and .cse5 (not .cse7)))) .cse4))) (fp.leq .cse8 (fp.mul c_currentRoundingMode c_~var_1_7~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 29.0 5.0))))) (fp.leq c_~var_1_8~0 .cse3) (fp.leq c_~var_1_12~0 .cse9) (let ((.cse10 ((_ to_fp 8 24) c_currentRoundingMode 2305843009213691390.0))) (or (and (fp.leq c_~var_1_11~0 .cse10) (fp.geq c_~var_1_11~0 .cse11)) (and (fp.geq c_~var_1_11~0 (fp.neg .cse10)) (fp.leq c_~var_1_11~0 (fp.neg .cse11))))) (fp.geq c_~var_1_12~0 .cse11) (fp.leq c_~var_1_6~0 ((_ to_fp 11 53) c_currentRoundingMode .cse9)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2023-12-23 00:35:36,028 WARN L293 SmtUtils]: Spent 6.98s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 00:35:43,045 WARN L293 SmtUtils]: Spent 7.02s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 00:35:53,486 WARN L293 SmtUtils]: Spent 6.35s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 00:36:14,018 WARN L293 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 00:36:20,529 WARN L293 SmtUtils]: Spent 6.51s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 00:36:25,829 WARN L293 SmtUtils]: Spent 5.30s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 00:36:32,154 WARN L293 SmtUtils]: Spent 6.32s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 00:36:42,773 WARN L293 SmtUtils]: Spent 5.92s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 00:36:48,243 WARN L293 SmtUtils]: Spent 5.47s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 00:37:09,374 WARN L293 SmtUtils]: Spent 5.77s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 00:37:22,480 WARN L293 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 00:37:28,977 WARN L293 SmtUtils]: Spent 6.50s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 00:37:38,770 WARN L293 SmtUtils]: Spent 5.98s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 00:37:48,687 WARN L293 SmtUtils]: Spent 6.30s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Received shutdown request... [2023-12-23 00:40:27,917 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-23 00:40:27,917 WARN L340 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)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-23 00:40:28,991 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 [2023-12-23 00:40:29,140 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-23 00:40:29,223 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-23 00:40:29,223 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 295 with TraceHistMax 48,while TraceCheckSpWp was constructing forward predicates,while PredicateUnifier was unifying predicates,while executing Executor. [2023-12-23 00:40:29,226 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-12-23 00:40:29,228 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-23 00:40:29,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 12:40:29 BoogieIcfgContainer [2023-12-23 00:40:29,229 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-23 00:40:29,229 INFO L158 Benchmark]: Toolchain (without parser) took 880977.59ms. Allocated memory is still 303.0MB. Free memory was 250.4MB in the beginning and 262.2MB in the end (delta: -11.8MB). Peak memory consumption was 158.5MB. Max. memory is 8.0GB. [2023-12-23 00:40:29,230 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 230.7MB. Free memory is still 180.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-23 00:40:29,230 INFO L158 Benchmark]: CACSL2BoogieTranslator took 326.05ms. Allocated memory is still 303.0MB. Free memory was 250.0MB in the beginning and 232.2MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-23 00:40:29,230 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.24ms. Allocated memory is still 303.0MB. Free memory was 232.2MB in the beginning and 229.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-23 00:40:29,230 INFO L158 Benchmark]: Boogie Preprocessor took 69.55ms. Allocated memory is still 303.0MB. Free memory was 229.0MB in the beginning and 224.5MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-23 00:40:29,230 INFO L158 Benchmark]: RCFGBuilder took 38324.67ms. Allocated memory is still 303.0MB. Free memory was 224.5MB in the beginning and 249.7MB in the end (delta: -25.2MB). Peak memory consumption was 24.7MB. Max. memory is 8.0GB. [2023-12-23 00:40:29,230 INFO L158 Benchmark]: TraceAbstraction took 842181.53ms. Allocated memory is still 303.0MB. Free memory was 248.7MB in the beginning and 262.2MB in the end (delta: -13.5MB). Peak memory consumption was 155.8MB. Max. memory is 8.0GB. [2023-12-23 00:40:29,231 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### [2023-12-23 00:40:29,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 230.7MB. Free memory is still 180.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 326.05ms. Allocated memory is still 303.0MB. Free memory was 250.0MB in the beginning and 232.2MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 71.24ms. Allocated memory is still 303.0MB. Free memory was 232.2MB in the beginning and 229.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 69.55ms. Allocated memory is still 303.0MB. Free memory was 229.0MB in the beginning and 224.5MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 38324.67ms. Allocated memory is still 303.0MB. Free memory was 224.5MB in the beginning and 249.7MB in the end (delta: -25.2MB). Peak memory consumption was 24.7MB. Max. memory is 8.0GB. * TraceAbstraction took 842181.53ms. Allocated memory is still 303.0MB. Free memory was 248.7MB in the beginning and 262.2MB in the end (delta: -13.5MB). Peak memory consumption was 155.8MB. 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 - TimeoutResultAtElement [Line: 19]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 19). Cancelled while NwaCegarLoop was analyzing trace of length 295 with TraceHistMax 48,while TraceCheckSpWp was constructing forward predicates,while PredicateUnifier was unifying predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 119 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 842.1s, OverallIterations: 5, TraceHistogramMax: 48, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 69.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 13 mSolverCounterUnknown, 452 SdHoareTripleChecker+Valid, 66.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 451 mSDsluCounter, 1561 SdHoareTripleChecker+Invalid, 65.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 731 mSDsCounter, 203 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 387 IncrementalHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 203 mSolverCounterUnsat, 830 mSDtfsCounter, 387 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1469 GetRequests, 1452 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=305occurred in iteration=4, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 79 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 8.0s SatisfiabilityAnalysisTime, 15.5s InterpolantComputationTime, 1173 NumberOfCodeBlocks, 1173 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 1462 ConstructedInterpolants, 0 QuantifiedInterpolants, 2262 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1847 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 22518/22560 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: Timeout Completed graceful shutdown