/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_fillercodestructure_filler-pr-cn_file-79.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 12:23:47,176 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 12:23:47,214 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-16 12:23:47,217 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 12:23:47,218 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 12:23:47,232 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 12:23:47,232 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 12:23:47,233 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 12:23:47,233 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 12:23:47,233 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 12:23:47,234 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 12:23:47,234 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 12:23:47,234 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 12:23:47,235 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 12:23:47,235 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 12:23:47,235 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 12:23:47,235 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 12:23:47,236 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 12:23:47,236 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 12:23:47,236 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 12:23:47,236 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 12:23:47,237 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 12:23:47,237 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 12:23:47,237 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 12:23:47,238 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 12:23:47,238 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 12:23:47,238 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 12:23:47,238 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 12:23:47,238 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 12:23:47,239 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 12:23:47,239 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 12:23:47,239 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 12:23:47,239 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 12:23:47,240 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 12:23:47,240 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 12:23:47,240 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 12:23:47,240 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 12:23:47,240 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 12:23:47,241 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 12:23:47,241 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 12:23:47,241 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 12:23:47,241 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 12:23:47,241 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 12:23:47,242 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 12:23:47,242 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 12:23:47,242 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 12:23:47,242 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-16 12:23:47,383 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 12:23:47,397 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 12:23:47,399 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 12:23:47,399 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 12:23:47,400 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 12:23:47,401 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-79.i [2023-12-16 12:23:48,509 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 12:23:48,717 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 12:23:48,717 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-79.i [2023-12-16 12:23:48,729 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6874d5a0/84327d9b668e4e77975eba714a4f98d7/FLAGe64b55f72 [2023-12-16 12:23:48,743 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6874d5a0/84327d9b668e4e77975eba714a4f98d7 [2023-12-16 12:23:48,746 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 12:23:48,747 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 12:23:48,748 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 12:23:48,748 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 12:23:48,752 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 12:23:48,753 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 12:23:48" (1/1) ... [2023-12-16 12:23:48,753 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11d6f026 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:23:48, skipping insertion in model container [2023-12-16 12:23:48,754 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 12:23:48" (1/1) ... [2023-12-16 12:23:48,791 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 12:23:48,916 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_fillercodestructure_filler-pr-cn_file-79.i[919,932] [2023-12-16 12:23:49,006 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 12:23:49,021 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 12:23:49,030 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_fillercodestructure_filler-pr-cn_file-79.i[919,932] [2023-12-16 12:23:49,078 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 12:23:49,096 INFO L206 MainTranslator]: Completed translation [2023-12-16 12:23:49,096 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:23:49 WrapperNode [2023-12-16 12:23:49,096 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 12:23:49,097 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 12:23:49,097 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 12:23:49,097 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 12:23:49,102 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:23:49" (1/1) ... [2023-12-16 12:23:49,111 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:23:49" (1/1) ... [2023-12-16 12:23:49,144 INFO L138 Inliner]: procedures = 27, calls = 65, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 284 [2023-12-16 12:23:49,144 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 12:23:49,145 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 12:23:49,145 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 12:23:49,145 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 12:23:49,159 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:23:49" (1/1) ... [2023-12-16 12:23:49,159 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:23:49" (1/1) ... [2023-12-16 12:23:49,164 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:23:49" (1/1) ... [2023-12-16 12:23:49,174 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-16 12:23:49,174 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:23:49" (1/1) ... [2023-12-16 12:23:49,174 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:23:49" (1/1) ... [2023-12-16 12:23:49,187 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:23:49" (1/1) ... [2023-12-16 12:23:49,190 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:23:49" (1/1) ... [2023-12-16 12:23:49,192 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:23:49" (1/1) ... [2023-12-16 12:23:49,194 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:23:49" (1/1) ... [2023-12-16 12:23:49,197 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 12:23:49,198 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 12:23:49,198 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 12:23:49,198 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 12:23:49,199 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:23:49" (1/1) ... [2023-12-16 12:23:49,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 12:23:49,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 12:23:49,242 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-16 12:23:49,249 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-16 12:23:49,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 12:23:49,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 12:23:49,268 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 12:23:49,269 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 12:23:49,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 12:23:49,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 12:23:49,363 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 12:23:49,364 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 12:23:58,018 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 12:23:58,051 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 12:23:58,051 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 12:23:58,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 12:23:58 BoogieIcfgContainer [2023-12-16 12:23:58,051 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 12:23:58,053 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 12:23:58,053 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 12:23:58,055 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 12:23:58,055 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 12:23:48" (1/3) ... [2023-12-16 12:23:58,056 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@342f6bc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 12:23:58, skipping insertion in model container [2023-12-16 12:23:58,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:23:49" (2/3) ... [2023-12-16 12:23:58,056 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@342f6bc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 12:23:58, skipping insertion in model container [2023-12-16 12:23:58,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 12:23:58" (3/3) ... [2023-12-16 12:23:58,057 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-79.i [2023-12-16 12:23:58,069 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 12:23:58,069 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 12:23:58,106 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 12:23:58,110 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;@106d048e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 12:23:58,110 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 12:23:58,114 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 64 states have internal predecessors, (85), 52 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2023-12-16 12:23:58,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2023-12-16 12:23:58,128 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 12:23:58,129 INFO L195 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 12:23:58,130 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 12:23:58,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 12:23:58,133 INFO L85 PathProgramCache]: Analyzing trace with hash 28742192, now seen corresponding path program 1 times [2023-12-16 12:23:58,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 12:23:58,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [206320070] [2023-12-16 12:23:58,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 12:23:58,145 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-16 12:23:58,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 12:23:58,147 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-16 12:23:58,150 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-16 12:23:58,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 12:23:58,849 INFO L262 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 12:23:58,859 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 12:23:58,935 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 1862 proven. 0 refuted. 0 times theorem prover too weak. 3442 trivial. 0 not checked. [2023-12-16 12:23:58,936 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 12:23:58,936 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 12:23:58,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [206320070] [2023-12-16 12:23:58,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [206320070] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 12:23:58,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 12:23:58,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 12:23:58,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533462946] [2023-12-16 12:23:58,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 12:23:58,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 12:23:58,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 12:23:58,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 12:23:58,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 12:23:58,975 INFO L87 Difference]: Start difference. First operand has 118 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 64 states have internal predecessors, (85), 52 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 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) [2023-12-16 12:24:03,148 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 [] [2023-12-16 12:24:03,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 12:24:03,149 INFO L93 Difference]: Finished difference Result 233 states and 428 transitions. [2023-12-16 12:24:03,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 12:24:03,188 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 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) Word has length 312 [2023-12-16 12:24:03,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 12:24:03,194 INFO L225 Difference]: With dead ends: 233 [2023-12-16 12:24:03,194 INFO L226 Difference]: Without dead ends: 116 [2023-12-16 12:24:03,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 311 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-16 12:24:03,199 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2023-12-16 12:24:03,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 180 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2023-12-16 12:24:03,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-12-16 12:24:03,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2023-12-16 12:24:03,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 62 states have (on average 1.2741935483870968) internal successors, (79), 62 states have internal predecessors, (79), 52 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2023-12-16 12:24:03,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 183 transitions. [2023-12-16 12:24:03,256 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 183 transitions. Word has length 312 [2023-12-16 12:24:03,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 12:24:03,257 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 183 transitions. [2023-12-16 12:24:03,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 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) [2023-12-16 12:24:03,257 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 183 transitions. [2023-12-16 12:24:03,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2023-12-16 12:24:03,262 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 12:24:03,263 INFO L195 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 12:24:03,285 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 [2023-12-16 12:24:03,463 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-16 12:24:03,467 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 12:24:03,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 12:24:03,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1683969020, now seen corresponding path program 1 times [2023-12-16 12:24:03,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 12:24:03,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1513472966] [2023-12-16 12:24:03,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 12:24:03,470 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-16 12:24:03,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 12:24:03,471 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-16 12:24:03,472 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-16 12:24:04,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 12:24:04,129 INFO L262 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 12:24:04,137 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 12:24:05,219 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2023-12-16 12:24:05,219 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 12:24:05,219 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 12:24:05,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1513472966] [2023-12-16 12:24:05,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1513472966] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 12:24:05,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 12:24:05,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 12:24:05,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839106204] [2023-12-16 12:24:05,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 12:24:05,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 12:24:05,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 12:24:05,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 12:24:05,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 12:24:05,222 INFO L87 Difference]: Start difference. First operand 116 states and 183 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2023-12-16 12:24:10,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-16 12:24:15,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-16 12:24:15,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 12:24:15,375 INFO L93 Difference]: Finished difference Result 369 states and 582 transitions. [2023-12-16 12:24:15,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 12:24:15,412 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 312 [2023-12-16 12:24:15,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 12:24:15,416 INFO L225 Difference]: With dead ends: 369 [2023-12-16 12:24:15,416 INFO L226 Difference]: Without dead ends: 254 [2023-12-16 12:24:15,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-16 12:24:15,418 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 199 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 107 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2023-12-16 12:24:15,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 577 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 126 Invalid, 2 Unknown, 0 Unchecked, 10.1s Time] [2023-12-16 12:24:15,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2023-12-16 12:24:15,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 229. [2023-12-16 12:24:15,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 122 states have (on average 1.2540983606557377) internal successors, (153), 122 states have internal predecessors, (153), 104 states have call successors, (104), 2 states have call predecessors, (104), 2 states have return successors, (104), 104 states have call predecessors, (104), 104 states have call successors, (104) [2023-12-16 12:24:15,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 361 transitions. [2023-12-16 12:24:15,457 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 361 transitions. Word has length 312 [2023-12-16 12:24:15,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 12:24:15,458 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 361 transitions. [2023-12-16 12:24:15,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2023-12-16 12:24:15,458 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 361 transitions. [2023-12-16 12:24:15,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2023-12-16 12:24:15,461 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 12:24:15,462 INFO L195 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 12:24:15,484 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-16 12:24:15,681 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-16 12:24:15,682 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 12:24:15,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 12:24:15,682 INFO L85 PathProgramCache]: Analyzing trace with hash 490016918, now seen corresponding path program 1 times [2023-12-16 12:24:15,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 12:24:15,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1338261964] [2023-12-16 12:24:15,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 12:24:15,684 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-16 12:24:15,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 12:24:15,685 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-16 12:24:15,689 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-16 12:24:16,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 12:24:16,285 INFO L262 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 12:24:16,291 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 12:24:17,256 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2023-12-16 12:24:17,256 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 12:24:17,256 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 12:24:17,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1338261964] [2023-12-16 12:24:17,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1338261964] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 12:24:17,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 12:24:17,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 12:24:17,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088612519] [2023-12-16 12:24:17,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 12:24:17,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 12:24:17,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 12:24:17,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 12:24:17,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 12:24:17,258 INFO L87 Difference]: Start difference. First operand 229 states and 361 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2023-12-16 12:24:19,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-16 12:24:23,773 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 [] [2023-12-16 12:24:25,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-16 12:24:29,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.70s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-16 12:24:29,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 12:24:29,668 INFO L93 Difference]: Finished difference Result 594 states and 935 transitions. [2023-12-16 12:24:29,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 12:24:29,711 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 314 [2023-12-16 12:24:29,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 12:24:29,715 INFO L225 Difference]: With dead ends: 594 [2023-12-16 12:24:29,715 INFO L226 Difference]: Without dead ends: 366 [2023-12-16 12:24:29,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-16 12:24:29,717 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 132 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 105 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2023-12-16 12:24:29,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 567 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 124 Invalid, 1 Unknown, 0 Unchecked, 12.3s Time] [2023-12-16 12:24:29,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2023-12-16 12:24:29,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 320. [2023-12-16 12:24:29,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 160 states have (on average 1.19375) internal successors, (191), 160 states have internal predecessors, (191), 156 states have call successors, (156), 3 states have call predecessors, (156), 3 states have return successors, (156), 156 states have call predecessors, (156), 156 states have call successors, (156) [2023-12-16 12:24:29,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 503 transitions. [2023-12-16 12:24:29,793 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 503 transitions. Word has length 314 [2023-12-16 12:24:29,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 12:24:29,797 INFO L495 AbstractCegarLoop]: Abstraction has 320 states and 503 transitions. [2023-12-16 12:24:29,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2023-12-16 12:24:29,797 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 503 transitions. [2023-12-16 12:24:29,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2023-12-16 12:24:29,802 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 12:24:29,803 INFO L195 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 12:24:29,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-16 12:24:30,026 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-16 12:24:30,027 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 12:24:30,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 12:24:30,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1198926824, now seen corresponding path program 1 times [2023-12-16 12:24:30,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 12:24:30,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [995931577] [2023-12-16 12:24:30,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 12:24:30,033 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-16 12:24:30,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 12:24:30,034 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-16 12:24:30,035 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-16 12:24:30,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 12:24:30,710 INFO L262 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 12:24:30,714 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 12:24:30,787 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2023-12-16 12:24:30,787 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 12:24:30,788 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 12:24:30,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [995931577] [2023-12-16 12:24:30,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [995931577] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 12:24:30,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 12:24:30,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 12:24:30,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177365817] [2023-12-16 12:24:30,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 12:24:30,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 12:24:30,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 12:24:30,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 12:24:30,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 12:24:30,792 INFO L87 Difference]: Start difference. First operand 320 states and 503 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2023-12-16 12:24:34,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-16 12:24:35,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 12:24:35,006 INFO L93 Difference]: Finished difference Result 556 states and 869 transitions. [2023-12-16 12:24:35,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 12:24:35,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 314 [2023-12-16 12:24:35,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 12:24:35,009 INFO L225 Difference]: With dead ends: 556 [2023-12-16 12:24:35,009 INFO L226 Difference]: Without dead ends: 328 [2023-12-16 12:24:35,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 12:24:35,016 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 40 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-12-16 12:24:35,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 325 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2023-12-16 12:24:35,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2023-12-16 12:24:35,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2023-12-16 12:24:35,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 166 states have (on average 1.1746987951807228) internal successors, (195), 166 states have internal predecessors, (195), 156 states have call successors, (156), 5 states have call predecessors, (156), 5 states have return successors, (156), 156 states have call predecessors, (156), 156 states have call successors, (156) [2023-12-16 12:24:35,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 507 transitions. [2023-12-16 12:24:35,041 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 507 transitions. Word has length 314 [2023-12-16 12:24:35,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 12:24:35,045 INFO L495 AbstractCegarLoop]: Abstraction has 328 states and 507 transitions. [2023-12-16 12:24:35,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2023-12-16 12:24:35,045 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 507 transitions. [2023-12-16 12:24:35,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2023-12-16 12:24:35,049 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 12:24:35,049 INFO L195 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 12:24:35,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-16 12:24:35,262 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-16 12:24:35,262 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 12:24:35,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 12:24:35,263 INFO L85 PathProgramCache]: Analyzing trace with hash 598122396, now seen corresponding path program 1 times [2023-12-16 12:24:35,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 12:24:35,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1220795389] [2023-12-16 12:24:35,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 12:24:35,263 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-16 12:24:35,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 12:24:35,264 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-16 12:24:35,270 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-16 12:24:35,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 12:24:35,901 INFO L262 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 12:24:35,905 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 12:24:36,731 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 2151 proven. 111 refuted. 0 times theorem prover too weak. 3042 trivial. 0 not checked. [2023-12-16 12:24:36,731 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 12:24:37,269 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 42 proven. 111 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2023-12-16 12:24:37,269 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 12:24:37,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1220795389] [2023-12-16 12:24:37,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1220795389] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 12:24:37,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 12:24:37,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2023-12-16 12:24:37,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905755546] [2023-12-16 12:24:37,270 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 12:24:37,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 12:24:37,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 12:24:37,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 12:24:37,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-12-16 12:24:37,271 INFO L87 Difference]: Start difference. First operand 328 states and 507 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 2 states have call successors, (89), 2 states have call predecessors, (89), 4 states have return successors, (90), 2 states have call predecessors, (90), 2 states have call successors, (90) [2023-12-16 12:24:41,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.54s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-16 12:24:41,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 12:24:41,991 INFO L93 Difference]: Finished difference Result 475 states and 716 transitions. [2023-12-16 12:24:42,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 12:24:42,032 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 2 states have call successors, (89), 2 states have call predecessors, (89), 4 states have return successors, (90), 2 states have call predecessors, (90), 2 states have call successors, (90) Word has length 315 [2023-12-16 12:24:42,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 12:24:42,034 INFO L225 Difference]: With dead ends: 475 [2023-12-16 12:24:42,034 INFO L226 Difference]: Without dead ends: 356 [2023-12-16 12:24:42,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 636 GetRequests, 621 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2023-12-16 12:24:42,035 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 126 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2023-12-16 12:24:42,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 255 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2023-12-16 12:24:42,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2023-12-16 12:24:42,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 340. [2023-12-16 12:24:42,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 175 states have (on average 1.1542857142857144) internal successors, (202), 175 states have internal predecessors, (202), 156 states have call successors, (156), 8 states have call predecessors, (156), 8 states have return successors, (156), 156 states have call predecessors, (156), 156 states have call successors, (156) [2023-12-16 12:24:42,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 514 transitions. [2023-12-16 12:24:42,061 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 514 transitions. Word has length 315 [2023-12-16 12:24:42,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 12:24:42,061 INFO L495 AbstractCegarLoop]: Abstraction has 340 states and 514 transitions. [2023-12-16 12:24:42,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 2 states have call successors, (89), 2 states have call predecessors, (89), 4 states have return successors, (90), 2 states have call predecessors, (90), 2 states have call successors, (90) [2023-12-16 12:24:42,062 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 514 transitions. [2023-12-16 12:24:42,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2023-12-16 12:24:42,063 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 12:24:42,063 INFO L195 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 12:24:42,092 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-16 12:24:42,280 WARN L477 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 [2023-12-16 12:24:42,280 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 12:24:42,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 12:24:42,281 INFO L85 PathProgramCache]: Analyzing trace with hash 601527118, now seen corresponding path program 1 times [2023-12-16 12:24:42,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 12:24:42,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [465832453] [2023-12-16 12:24:42,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 12:24:42,282 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-16 12:24:42,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 12:24:42,283 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) [2023-12-16 12:24:42,288 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 [2023-12-16 12:24:42,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 12:24:42,955 INFO L262 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-16 12:24:42,962 INFO L285 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2023-12-16 12:25:03,840 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 12:25:03,841 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 (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 12:25:03,842 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-16 12:25:03,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-16 12:25:04,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 12:25:04,042 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 316 with TraceHistMax 52,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-5-2-2-1 context. [2023-12-16 12:25:04,045 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-12-16 12:25:04,048 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 12:25:04,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 12:25:04 BoogieIcfgContainer [2023-12-16 12:25:04,050 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 12:25:04,051 INFO L158 Benchmark]: Toolchain (without parser) took 75304.02ms. Allocated memory is still 339.7MB. Free memory was 295.0MB in the beginning and 226.3MB in the end (delta: 68.7MB). Peak memory consumption was 69.8MB. Max. memory is 8.0GB. [2023-12-16 12:25:04,051 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 174.1MB. Free memory was 124.6MB in the beginning and 124.5MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 12:25:04,051 INFO L158 Benchmark]: CACSL2BoogieTranslator took 348.20ms. Allocated memory is still 339.7MB. Free memory was 295.0MB in the beginning and 276.6MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-16 12:25:04,051 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.26ms. Allocated memory is still 339.7MB. Free memory was 276.6MB in the beginning and 273.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 12:25:04,051 INFO L158 Benchmark]: Boogie Preprocessor took 52.94ms. Allocated memory is still 339.7MB. Free memory was 273.5MB in the beginning and 269.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-16 12:25:04,052 INFO L158 Benchmark]: RCFGBuilder took 8853.40ms. Allocated memory is still 339.7MB. Free memory was 268.8MB in the beginning and 237.8MB in the end (delta: 30.9MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2023-12-16 12:25:04,052 INFO L158 Benchmark]: TraceAbstraction took 65997.18ms. Allocated memory is still 339.7MB. Free memory was 236.8MB in the beginning and 226.3MB in the end (delta: 10.5MB). Peak memory consumption was 11.1MB. Max. memory is 8.0GB. [2023-12-16 12:25:04,053 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 174.1MB. Free memory was 124.6MB in the beginning and 124.5MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 348.20ms. Allocated memory is still 339.7MB. Free memory was 295.0MB in the beginning and 276.6MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.26ms. Allocated memory is still 339.7MB. Free memory was 276.6MB in the beginning and 273.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 52.94ms. Allocated memory is still 339.7MB. Free memory was 273.5MB in the beginning and 269.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 8853.40ms. Allocated memory is still 339.7MB. Free memory was 268.8MB in the beginning and 237.8MB in the end (delta: 30.9MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 65997.18ms. Allocated memory is still 339.7MB. Free memory was 236.8MB in the beginning and 226.3MB in the end (delta: 10.5MB). Peak memory consumption was 11.1MB. 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 316 with TraceHistMax 52,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-5-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 118 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 66.0s, OverallIterations: 6, TraceHistogramMax: 52, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 35.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 499 SdHoareTripleChecker+Valid, 35.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 497 mSDsluCounter, 1904 SdHoareTripleChecker+Invalid, 34.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1055 mSDsCounter, 359 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 540 IncrementalHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 359 mSolverCounterUnsat, 849 mSDtfsCounter, 540 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1888 GetRequests, 1862 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=340occurred in iteration=5, InterpolantAutomatonStates: 27, 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, 5 MinimizatonAttempts, 87 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 1567 NumberOfCodeBlocks, 1567 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 1876 ConstructedInterpolants, 0 QuantifiedInterpolants, 4005 SizeOfPredicates, 6 NumberOfNonLiveVariables, 2508 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 6 InterpolantComputations, 4 PerfectInterpolantSequences, 31602/31824 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