/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.smt.solver External_ModelsAndUnsatCoreMode --traceabstraction.command.for.external.solver 'mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3' -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount50_file-4.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-df9f019-m [2024-11-05 20:19:37,867 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 20:19:37,944 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-05 20:19:37,950 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 20:19:37,950 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 20:19:37,977 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 20:19:37,978 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 20:19:37,978 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 20:19:37,978 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 20:19:37,979 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 20:19:37,979 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 20:19:37,979 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 20:19:37,980 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 20:19:37,983 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 20:19:37,983 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 20:19:37,984 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 20:19:37,984 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 20:19:37,984 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-05 20:19:37,984 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-05 20:19:37,984 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 20:19:37,985 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 20:19:37,986 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 20:19:37,987 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 20:19:37,987 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 20:19:37,987 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 20:19:37,987 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 20:19:37,987 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 20:19:37,988 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-05 20:19:37,988 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 20:19:37,988 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 20:19:37,989 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 20:19:37,989 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 20:19:37,989 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 20:19:37,989 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 20:19:37,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 20:19:37,990 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 20:19:37,990 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 20:19:37,990 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 20:19:37,990 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 20:19:37,990 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 20:19:37,990 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 20:19:37,991 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 20:19:37,991 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 20:19:37,991 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 20:19:37,992 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Command for external solver -> mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:19:38,213 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 20:19:38,235 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 20:19:38,238 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 20:19:38,239 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 20:19:38,239 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 20:19:38,241 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount50_file-4.i [2024-11-05 20:19:39,618 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 20:19:39,829 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 20:19:39,829 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount50_file-4.i [2024-11-05 20:19:39,840 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8c4a9761/ea7f440f214a43ca860ea053a2861e44/FLAGdc27997ab [2024-11-05 20:19:39,855 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8c4a9761/ea7f440f214a43ca860ea053a2861e44 [2024-11-05 20:19:39,858 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 20:19:39,859 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 20:19:39,861 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 20:19:39,861 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 20:19:39,867 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 20:19:39,869 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:19:39" (1/1) ... [2024-11-05 20:19:39,870 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60861187 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:19:39, skipping insertion in model container [2024-11-05 20:19:39,870 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:19:39" (1/1) ... [2024-11-05 20:19:39,900 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 20:19:40,070 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount50_file-4.i[914,927] [2024-11-05 20:19:40,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 20:19:40,137 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 20:19:40,148 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount50_file-4.i[914,927] [2024-11-05 20:19:40,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 20:19:40,196 INFO L204 MainTranslator]: Completed translation [2024-11-05 20:19:40,196 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:19:40 WrapperNode [2024-11-05 20:19:40,197 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 20:19:40,198 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 20:19:40,198 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 20:19:40,198 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 20:19:40,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:19:40" (1/1) ... [2024-11-05 20:19:40,212 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:19:40" (1/1) ... [2024-11-05 20:19:40,236 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 140 [2024-11-05 20:19:40,237 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 20:19:40,237 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 20:19:40,238 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 20:19:40,238 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 20:19:40,251 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:19:40" (1/1) ... [2024-11-05 20:19:40,251 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:19:40" (1/1) ... [2024-11-05 20:19:40,257 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:19:40" (1/1) ... [2024-11-05 20:19:40,278 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-05 20:19:40,278 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:19:40" (1/1) ... [2024-11-05 20:19:40,279 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:19:40" (1/1) ... [2024-11-05 20:19:40,286 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:19:40" (1/1) ... [2024-11-05 20:19:40,290 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:19:40" (1/1) ... [2024-11-05 20:19:40,292 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:19:40" (1/1) ... [2024-11-05 20:19:40,293 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:19:40" (1/1) ... [2024-11-05 20:19:40,297 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 20:19:40,298 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 20:19:40,298 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 20:19:40,298 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 20:19:40,299 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:19:40" (1/1) ... [2024-11-05 20:19:40,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 20:19:40,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 20:19:40,327 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-05 20:19:40,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-05 20:19:40,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 20:19:40,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 20:19:40,375 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-05 20:19:40,375 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-05 20:19:40,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 20:19:40,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 20:19:40,471 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 20:19:40,474 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 20:19:41,047 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-05 20:19:41,047 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 20:19:41,064 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 20:19:41,064 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-05 20:19:41,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:19:41 BoogieIcfgContainer [2024-11-05 20:19:41,064 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 20:19:41,067 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 20:19:41,067 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 20:19:41,069 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 20:19:41,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 08:19:39" (1/3) ... [2024-11-05 20:19:41,069 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57f93490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:19:41, skipping insertion in model container [2024-11-05 20:19:41,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:19:40" (2/3) ... [2024-11-05 20:19:41,070 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57f93490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:19:41, skipping insertion in model container [2024-11-05 20:19:41,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:19:41" (3/3) ... [2024-11-05 20:19:41,071 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-4.i [2024-11-05 20:19:41,086 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 20:19:41,087 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 20:19:41,141 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 20:19:41,146 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@410fa86c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 20:19:41,147 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 20:19:41,150 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 42 states have internal predecessors, (57), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-05 20:19:41,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-05 20:19:41,159 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:19:41,160 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:19:41,161 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:19:41,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:19:41,164 INFO L85 PathProgramCache]: Analyzing trace with hash -246695732, now seen corresponding path program 1 times [2024-11-05 20:19:41,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:19:41,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [617544058] [2024-11-05 20:19:41,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:19:41,172 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:19:41,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:19:41,175 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:19:41,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-05 20:19:41,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:19:41,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-05 20:19:41,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:19:41,461 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2024-11-05 20:19:41,461 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:19:41,596 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 26 proven. 12 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2024-11-05 20:19:41,597 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:19:41,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [617544058] [2024-11-05 20:19:41,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [617544058] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 20:19:41,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 20:19:41,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-05 20:19:41,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017847908] [2024-11-05 20:19:41,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 20:19:41,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-05 20:19:41,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:19:41,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-05 20:19:41,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 20:19:41,627 INFO L87 Difference]: Start difference. First operand has 64 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 42 states have internal predecessors, (57), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-05 20:19:41,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:19:41,657 INFO L93 Difference]: Finished difference Result 121 states and 208 transitions. [2024-11-05 20:19:41,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-05 20:19:41,660 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 129 [2024-11-05 20:19:41,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:19:41,668 INFO L225 Difference]: With dead ends: 121 [2024-11-05 20:19:41,668 INFO L226 Difference]: Without dead ends: 60 [2024-11-05 20:19:41,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 20:19:41,678 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 20:19:41,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 20:19:41,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-05 20:19:41,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-11-05 20:19:41,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-05 20:19:41,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 89 transitions. [2024-11-05 20:19:41,717 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 89 transitions. Word has length 129 [2024-11-05 20:19:41,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:19:41,717 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 89 transitions. [2024-11-05 20:19:41,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-05 20:19:41,718 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 89 transitions. [2024-11-05 20:19:41,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-05 20:19:41,721 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:19:41,721 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:19:41,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-05 20:19:41,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:19:41,923 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:19:41,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:19:41,924 INFO L85 PathProgramCache]: Analyzing trace with hash -157864659, now seen corresponding path program 1 times [2024-11-05 20:19:41,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:19:41,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2063398327] [2024-11-05 20:19:41,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:19:41,925 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:19:41,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:19:41,928 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:19:41,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-05 20:19:42,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:19:42,156 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-05 20:19:42,162 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:19:43,071 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-05 20:19:43,074 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:19:43,305 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-05 20:19:43,306 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:19:43,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2063398327] [2024-11-05 20:19:43,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2063398327] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:19:43,306 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:19:43,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 5] imperfect sequences [] total 8 [2024-11-05 20:19:43,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48796633] [2024-11-05 20:19:43,307 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:19:43,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 20:19:43,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:19:43,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 20:19:43,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-05 20:19:43,313 INFO L87 Difference]: Start difference. First operand 60 states and 89 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-11-05 20:19:44,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:19:44,290 INFO L93 Difference]: Finished difference Result 175 states and 262 transitions. [2024-11-05 20:19:44,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-05 20:19:44,304 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) Word has length 130 [2024-11-05 20:19:44,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:19:44,307 INFO L225 Difference]: With dead ends: 175 [2024-11-05 20:19:44,308 INFO L226 Difference]: Without dead ends: 118 [2024-11-05 20:19:44,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-05 20:19:44,310 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 81 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-05 20:19:44,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 384 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-05 20:19:44,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-05 20:19:44,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 101. [2024-11-05 20:19:44,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 58 states have internal predecessors, (71), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-05 20:19:44,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 151 transitions. [2024-11-05 20:19:44,338 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 151 transitions. Word has length 130 [2024-11-05 20:19:44,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:19:44,339 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 151 transitions. [2024-11-05 20:19:44,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-11-05 20:19:44,340 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 151 transitions. [2024-11-05 20:19:44,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-05 20:19:44,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:19:44,342 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:19:44,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-05 20:19:44,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:19:44,543 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:19:44,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:19:44,544 INFO L85 PathProgramCache]: Analyzing trace with hash -416030097, now seen corresponding path program 1 times [2024-11-05 20:19:44,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:19:44,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [226763236] [2024-11-05 20:19:44,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:19:44,544 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:19:44,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:19:44,546 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:19:44,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-05 20:19:44,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:19:44,752 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-05 20:19:44,761 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:19:45,496 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 179 proven. 99 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2024-11-05 20:19:45,496 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:19:45,958 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 102 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2024-11-05 20:19:45,959 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:19:45,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [226763236] [2024-11-05 20:19:45,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [226763236] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:19:45,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:19:45,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2024-11-05 20:19:45,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35900690] [2024-11-05 20:19:45,961 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:19:45,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-05 20:19:45,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:19:45,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-05 20:19:45,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-11-05 20:19:45,965 INFO L87 Difference]: Start difference. First operand 101 states and 151 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 3 states have call successors, (38), 3 states have call predecessors, (38), 7 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) [2024-11-05 20:19:47,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:19:47,052 INFO L93 Difference]: Finished difference Result 200 states and 276 transitions. [2024-11-05 20:19:47,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-05 20:19:47,053 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 3 states have call successors, (38), 3 states have call predecessors, (38), 7 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) Word has length 130 [2024-11-05 20:19:47,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:19:47,056 INFO L225 Difference]: With dead ends: 200 [2024-11-05 20:19:47,057 INFO L226 Difference]: Without dead ends: 140 [2024-11-05 20:19:47,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 245 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=351, Unknown=0, NotChecked=0, Total=506 [2024-11-05 20:19:47,060 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 151 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-05 20:19:47,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 237 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-05 20:19:47,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-05 20:19:47,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 120. [2024-11-05 20:19:47,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 73 states have (on average 1.095890410958904) internal successors, (80), 73 states have internal predecessors, (80), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-05 20:19:47,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 160 transitions. [2024-11-05 20:19:47,093 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 160 transitions. Word has length 130 [2024-11-05 20:19:47,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:19:47,094 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 160 transitions. [2024-11-05 20:19:47,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 3 states have call successors, (38), 3 states have call predecessors, (38), 7 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) [2024-11-05 20:19:47,096 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 160 transitions. [2024-11-05 20:19:47,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-05 20:19:47,099 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:19:47,099 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:19:47,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-05 20:19:47,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:19:47,300 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:19:47,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:19:47,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1983351693, now seen corresponding path program 1 times [2024-11-05 20:19:47,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:19:47,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [214716356] [2024-11-05 20:19:47,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:19:47,302 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:19:47,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:19:47,303 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:19:47,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-05 20:19:47,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:19:47,458 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-05 20:19:47,462 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:19:47,706 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 93 proven. 54 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2024-11-05 20:19:47,706 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:19:47,913 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 3 proven. 54 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-05 20:19:47,913 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:19:47,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [214716356] [2024-11-05 20:19:47,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [214716356] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:19:47,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:19:47,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2024-11-05 20:19:47,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199492836] [2024-11-05 20:19:47,914 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:19:47,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-05 20:19:47,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:19:47,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-05 20:19:47,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-05 20:19:47,919 INFO L87 Difference]: Start difference. First operand 120 states and 160 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2024-11-05 20:19:49,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:19:49,037 INFO L93 Difference]: Finished difference Result 265 states and 349 transitions. [2024-11-05 20:19:49,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-05 20:19:49,038 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) Word has length 131 [2024-11-05 20:19:49,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:19:49,041 INFO L225 Difference]: With dead ends: 265 [2024-11-05 20:19:49,041 INFO L226 Difference]: Without dead ends: 196 [2024-11-05 20:19:49,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 253 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2024-11-05 20:19:49,043 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 100 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-05 20:19:49,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 350 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-05 20:19:49,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-05 20:19:49,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 176. [2024-11-05 20:19:49,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 106 states have (on average 1.0943396226415094) internal successors, (116), 106 states have internal predecessors, (116), 60 states have call successors, (60), 9 states have call predecessors, (60), 9 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-05 20:19:49,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 236 transitions. [2024-11-05 20:19:49,079 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 236 transitions. Word has length 131 [2024-11-05 20:19:49,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:19:49,080 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 236 transitions. [2024-11-05 20:19:49,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2024-11-05 20:19:49,080 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 236 transitions. [2024-11-05 20:19:49,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-05 20:19:49,083 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:19:49,083 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:19:49,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-05 20:19:49,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:19:49,284 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:19:49,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:19:49,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1985198735, now seen corresponding path program 1 times [2024-11-05 20:19:49,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:19:49,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1390695958] [2024-11-05 20:19:49,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:19:49,285 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:19:49,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:19:49,288 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:19:49,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-05 20:19:49,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:19:49,475 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-05 20:19:49,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:19:50,044 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 93 proven. 54 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2024-11-05 20:19:50,044 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:19:50,356 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 3 proven. 54 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-05 20:19:50,356 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:19:50,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1390695958] [2024-11-05 20:19:50,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1390695958] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:19:50,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:19:50,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2024-11-05 20:19:50,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406073361] [2024-11-05 20:19:50,357 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:19:50,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-05 20:19:50,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:19:50,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-05 20:19:50,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-05 20:19:50,359 INFO L87 Difference]: Start difference. First operand 176 states and 236 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (40), 3 states have call predecessors, (40), 5 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-11-05 20:19:51,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:19:51,154 INFO L93 Difference]: Finished difference Result 268 states and 351 transitions. [2024-11-05 20:19:51,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-05 20:19:51,168 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (40), 3 states have call predecessors, (40), 5 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) Word has length 131 [2024-11-05 20:19:51,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:19:51,170 INFO L225 Difference]: With dead ends: 268 [2024-11-05 20:19:51,170 INFO L226 Difference]: Without dead ends: 143 [2024-11-05 20:19:51,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 252 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2024-11-05 20:19:51,172 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 66 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-05 20:19:51,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 193 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-05 20:19:51,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-05 20:19:51,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 114. [2024-11-05 20:19:51,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 67 states have (on average 1.0746268656716418) internal successors, (72), 67 states have internal predecessors, (72), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-05 20:19:51,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 152 transitions. [2024-11-05 20:19:51,187 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 152 transitions. Word has length 131 [2024-11-05 20:19:51,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:19:51,188 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 152 transitions. [2024-11-05 20:19:51,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (40), 3 states have call predecessors, (40), 5 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-11-05 20:19:51,188 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 152 transitions. [2024-11-05 20:19:51,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-05 20:19:51,189 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:19:51,190 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:19:51,198 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 (6)] Ended with exit code 0 [2024-11-05 20:19:51,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:19:51,391 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:19:51,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:19:51,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1191285994, now seen corresponding path program 1 times [2024-11-05 20:19:51,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:19:51,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1904660892] [2024-11-05 20:19:51,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:19:51,392 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:19:51,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:19:51,393 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:19:51,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-05 20:19:51,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:19:51,572 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 20:19:51,574 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:19:51,803 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-05 20:19:51,803 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:19:51,916 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-05 20:19:51,917 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:19:51,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1904660892] [2024-11-05 20:19:51,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1904660892] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:19:51,918 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:19:51,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2024-11-05 20:19:51,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677678364] [2024-11-05 20:19:51,919 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:19:51,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-05 20:19:51,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:19:51,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-05 20:19:51,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-05 20:19:51,922 INFO L87 Difference]: Start difference. First operand 114 states and 152 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-11-05 20:19:52,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:19:52,527 INFO L93 Difference]: Finished difference Result 239 states and 318 transitions. [2024-11-05 20:19:52,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-05 20:19:52,528 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) Word has length 131 [2024-11-05 20:19:52,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:19:52,531 INFO L225 Difference]: With dead ends: 239 [2024-11-05 20:19:52,531 INFO L226 Difference]: Without dead ends: 176 [2024-11-05 20:19:52,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-05 20:19:52,532 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 134 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-05 20:19:52,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 204 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-05 20:19:52,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-05 20:19:52,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 174. [2024-11-05 20:19:52,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 104 states have (on average 1.0673076923076923) internal successors, (111), 104 states have internal predecessors, (111), 60 states have call successors, (60), 9 states have call predecessors, (60), 9 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-05 20:19:52,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 231 transitions. [2024-11-05 20:19:52,561 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 231 transitions. Word has length 131 [2024-11-05 20:19:52,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:19:52,562 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 231 transitions. [2024-11-05 20:19:52,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-11-05 20:19:52,562 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 231 transitions. [2024-11-05 20:19:52,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-05 20:19:52,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:19:52,564 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:19:52,573 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 (7)] Ended with exit code 0 [2024-11-05 20:19:52,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:19:52,765 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:19:52,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:19:52,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1871344364, now seen corresponding path program 1 times [2024-11-05 20:19:52,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:19:52,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1226419285] [2024-11-05 20:19:52,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:19:52,765 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:19:52,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:19:52,769 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:19:52,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-05 20:19:52,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:19:52,921 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-05 20:19:52,923 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:19:53,609 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 387 proven. 33 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2024-11-05 20:19:53,609 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:19:55,664 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 24 proven. 33 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-05 20:19:55,664 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:19:55,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1226419285] [2024-11-05 20:19:55,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1226419285] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:19:55,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:19:55,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2024-11-05 20:19:55,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846382489] [2024-11-05 20:19:55,664 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:19:55,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-05 20:19:55,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:19:55,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-05 20:19:55,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-11-05 20:19:55,666 INFO L87 Difference]: Start difference. First operand 174 states and 231 transitions. Second operand has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 4 states have call successors, (40), 3 states have call predecessors, (40), 5 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) [2024-11-05 20:19:56,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:19:56,687 INFO L93 Difference]: Finished difference Result 257 states and 333 transitions. [2024-11-05 20:19:56,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-05 20:19:56,688 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 4 states have call successors, (40), 3 states have call predecessors, (40), 5 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) Word has length 131 [2024-11-05 20:19:56,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:19:56,690 INFO L225 Difference]: With dead ends: 257 [2024-11-05 20:19:56,690 INFO L226 Difference]: Without dead ends: 134 [2024-11-05 20:19:56,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 251 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=250, Invalid=506, Unknown=0, NotChecked=0, Total=756 [2024-11-05 20:19:56,691 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 194 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-05 20:19:56,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 184 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-05 20:19:56,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-05 20:19:56,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 122. [2024-11-05 20:19:56,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 73 states have (on average 1.0410958904109588) internal successors, (76), 73 states have internal predecessors, (76), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-05 20:19:56,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 156 transitions. [2024-11-05 20:19:56,712 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 156 transitions. Word has length 131 [2024-11-05 20:19:56,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:19:56,712 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 156 transitions. [2024-11-05 20:19:56,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 4 states have call successors, (40), 3 states have call predecessors, (40), 5 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) [2024-11-05 20:19:56,713 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 156 transitions. [2024-11-05 20:19:56,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-05 20:19:56,714 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:19:56,714 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:19:56,725 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 (8)] Ended with exit code 0 [2024-11-05 20:19:56,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:19:56,915 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:19:56,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:19:56,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1995455282, now seen corresponding path program 1 times [2024-11-05 20:19:56,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:19:56,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1162373966] [2024-11-05 20:19:56,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:19:56,916 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:19:56,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:19:56,917 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:19:56,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-05 20:19:57,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:19:57,065 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-05 20:19:57,068 INFO L278 TraceCheckSpWp]: Computing forward predicates...