/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/bitvector-regression/recHanoi03-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-df9f019-m [2024-11-05 20:29:57,106 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 20:29:57,163 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:29:57,167 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 20:29:57,167 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 20:29:57,189 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 20:29:57,189 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 20:29:57,190 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 20:29:57,190 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 20:29:57,192 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 20:29:57,192 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 20:29:57,192 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 20:29:57,192 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 20:29:57,193 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 20:29:57,193 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 20:29:57,193 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 20:29:57,193 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 20:29:57,194 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-05 20:29:57,194 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-05 20:29:57,194 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 20:29:57,194 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 20:29:57,197 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 20:29:57,197 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 20:29:57,198 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 20:29:57,198 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 20:29:57,198 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 20:29:57,198 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 20:29:57,198 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-05 20:29:57,198 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 20:29:57,199 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 20:29:57,199 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 20:29:57,199 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 20:29:57,199 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 20:29:57,199 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 20:29:57,199 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 20:29:57,200 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 20:29:57,200 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 20:29:57,200 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 20:29:57,200 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 20:29:57,200 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 20:29:57,200 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 20:29:57,202 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 20:29:57,202 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 20:29:57,202 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 20:29:57,202 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:29:57,388 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 20:29:57,410 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 20:29:57,412 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 20:29:57,413 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 20:29:57,414 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 20:29:57,414 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector-regression/recHanoi03-1.c [2024-11-05 20:29:58,763 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 20:29:58,907 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 20:29:58,907 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector-regression/recHanoi03-1.c [2024-11-05 20:29:58,912 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9505a32e4/5bd4f11df7d64496965ba77e9b2e6af9/FLAG9c3691ff0 [2024-11-05 20:29:58,922 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9505a32e4/5bd4f11df7d64496965ba77e9b2e6af9 [2024-11-05 20:29:58,924 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 20:29:58,925 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 20:29:58,928 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 20:29:58,928 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 20:29:58,933 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 20:29:58,933 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:29:58" (1/1) ... [2024-11-05 20:29:58,934 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@564b0989 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:58, skipping insertion in model container [2024-11-05 20:29:58,934 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:29:58" (1/1) ... [2024-11-05 20:29:58,947 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 20:29:59,058 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector-regression/recHanoi03-1.c[838,851] [2024-11-05 20:29:59,060 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 20:29:59,072 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 20:29:59,082 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector-regression/recHanoi03-1.c[838,851] [2024-11-05 20:29:59,083 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 20:29:59,094 INFO L204 MainTranslator]: Completed translation [2024-11-05 20:29:59,096 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:59 WrapperNode [2024-11-05 20:29:59,096 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 20:29:59,097 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 20:29:59,097 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 20:29:59,097 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 20:29:59,102 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:29:59" (1/1) ... [2024-11-05 20:29:59,109 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:29:59" (1/1) ... [2024-11-05 20:29:59,154 INFO L138 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 24 [2024-11-05 20:29:59,154 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 20:29:59,155 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 20:29:59,156 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 20:29:59,156 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 20:29:59,162 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:59" (1/1) ... [2024-11-05 20:29:59,162 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:59" (1/1) ... [2024-11-05 20:29:59,163 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:59" (1/1) ... [2024-11-05 20:29:59,172 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:29:59,173 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:59" (1/1) ... [2024-11-05 20:29:59,173 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:59" (1/1) ... [2024-11-05 20:29:59,176 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:59" (1/1) ... [2024-11-05 20:29:59,177 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:59" (1/1) ... [2024-11-05 20:29:59,178 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:59" (1/1) ... [2024-11-05 20:29:59,178 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:59" (1/1) ... [2024-11-05 20:29:59,183 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 20:29:59,183 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 20:29:59,184 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 20:29:59,184 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 20:29:59,184 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:59" (1/1) ... [2024-11-05 20:29:59,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 20:29:59,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 20:29:59,209 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:29:59,217 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:29:59,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 20:29:59,237 INFO L130 BoogieDeclarations]: Found specification of procedure hanoi [2024-11-05 20:29:59,237 INFO L138 BoogieDeclarations]: Found implementation of procedure hanoi [2024-11-05 20:29:59,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 20:29:59,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 20:29:59,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 20:29:59,296 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 20:29:59,298 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 20:29:59,417 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-05 20:29:59,418 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 20:29:59,429 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 20:29:59,430 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-05 20:29:59,430 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:29:59 BoogieIcfgContainer [2024-11-05 20:29:59,430 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 20:29:59,432 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 20:29:59,432 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 20:29:59,435 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 20:29:59,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 08:29:58" (1/3) ... [2024-11-05 20:29:59,436 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aee2ab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:29:59, skipping insertion in model container [2024-11-05 20:29:59,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:59" (2/3) ... [2024-11-05 20:29:59,437 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aee2ab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:29:59, skipping insertion in model container [2024-11-05 20:29:59,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:29:59" (3/3) ... [2024-11-05 20:29:59,438 INFO L112 eAbstractionObserver]: Analyzing ICFG recHanoi03-1.c [2024-11-05 20:29:59,450 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 20:29:59,450 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 20:29:59,488 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 20:29:59,492 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;@73a53521, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 20:29:59,492 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 20:29:59,496 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-05 20:29:59,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-05 20:29:59,501 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:59,501 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:29:59,501 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:59,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:59,505 INFO L85 PathProgramCache]: Analyzing trace with hash -2087939196, now seen corresponding path program 1 times [2024-11-05 20:29:59,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:59,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [30825972] [2024-11-05 20:29:59,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:59,512 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:29:59,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:59,515 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:29:59,516 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:29:59,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:59,556 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-05 20:29:59,560 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:59,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:29:59,712 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:59,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:29:59,903 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:59,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [30825972] [2024-11-05 20:29:59,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [30825972] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:29:59,904 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:29:59,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2024-11-05 20:29:59,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986182948] [2024-11-05 20:29:59,906 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:29:59,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-05 20:29:59,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:59,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-05 20:29:59,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-05 20:29:59,930 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-05 20:30:00,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:30:00,060 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2024-11-05 20:30:00,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-05 20:30:00,063 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 11 [2024-11-05 20:30:00,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:30:00,071 INFO L225 Difference]: With dead ends: 26 [2024-11-05 20:30:00,071 INFO L226 Difference]: Without dead ends: 16 [2024-11-05 20:30:00,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-05 20:30:00,076 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 4 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 20:30:00,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 61 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 20:30:00,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-05 20:30:00,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-05 20:30:00,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 12 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-05 20:30:00,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2024-11-05 20:30:00,103 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2024-11-05 20:30:00,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:30:00,104 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2024-11-05 20:30:00,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-05 20:30:00,104 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2024-11-05 20:30:00,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-05 20:30:00,106 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:30:00,106 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:30:00,113 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:30:00,307 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:30:00,307 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:30:00,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:30:00,308 INFO L85 PathProgramCache]: Analyzing trace with hash -2053638732, now seen corresponding path program 1 times [2024-11-05 20:30:00,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:30:00,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [618645598] [2024-11-05 20:30:00,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:30:00,309 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:30:00,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:30:00,316 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:30:00,323 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:30:00,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:30:00,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-05 20:30:00,360 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:30:00,498 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-05 20:30:00,498 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:30:00,789 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-05 20:30:00,789 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:30:00,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [618645598] [2024-11-05 20:30:00,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [618645598] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:30:00,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:30:00,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-05 20:30:00,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711494911] [2024-11-05 20:30:00,790 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:30:00,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-05 20:30:00,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:30:00,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-05 20:30:00,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2024-11-05 20:30:00,793 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 12 states have internal predecessors, (22), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-05 20:30:01,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:30:01,019 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2024-11-05 20:30:01,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-05 20:30:01,020 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 12 states have internal predecessors, (22), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 17 [2024-11-05 20:30:01,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:30:01,020 INFO L225 Difference]: With dead ends: 28 [2024-11-05 20:30:01,020 INFO L226 Difference]: Without dead ends: 22 [2024-11-05 20:30:01,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2024-11-05 20:30:01,022 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 18 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 20:30:01,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 64 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 20:30:01,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-05 20:30:01,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-05 20:30:01,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-05 20:30:01,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2024-11-05 20:30:01,026 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 17 [2024-11-05 20:30:01,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:30:01,026 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2024-11-05 20:30:01,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 12 states have internal predecessors, (22), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-05 20:30:01,027 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2024-11-05 20:30:01,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-05 20:30:01,027 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:30:01,027 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:30:01,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-05 20:30:01,229 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:30:01,229 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:30:01,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:30:01,230 INFO L85 PathProgramCache]: Analyzing trace with hash -491101836, now seen corresponding path program 2 times [2024-11-05 20:30:01,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:30:01,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [236634298] [2024-11-05 20:30:01,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:30:01,231 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:30:01,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:30:01,232 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:30:01,234 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:30:01,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:30:01,254 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-05 20:30:01,256 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:30:01,423 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-05 20:30:01,423 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:30:02,241 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-05 20:30:02,242 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:30:02,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [236634298] [2024-11-05 20:30:02,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [236634298] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:30:02,242 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:30:02,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 26 [2024-11-05 20:30:02,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87028843] [2024-11-05 20:30:02,242 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:30:02,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-05 20:30:02,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:30:02,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-05 20:30:02,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2024-11-05 20:30:02,244 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 26 states, 25 states have (on average 1.36) internal successors, (34), 18 states have internal predecessors, (34), 6 states have call successors, (6), 1 states have call predecessors, (6), 8 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-05 20:30:02,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:30:02,623 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2024-11-05 20:30:02,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-05 20:30:02,624 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.36) internal successors, (34), 18 states have internal predecessors, (34), 6 states have call successors, (6), 1 states have call predecessors, (6), 8 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) Word has length 29 [2024-11-05 20:30:02,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:30:02,625 INFO L225 Difference]: With dead ends: 34 [2024-11-05 20:30:02,625 INFO L226 Difference]: Without dead ends: 28 [2024-11-05 20:30:02,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=171, Invalid=1089, Unknown=0, NotChecked=0, Total=1260 [2024-11-05 20:30:02,626 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 46 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 20:30:02,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 109 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 20:30:02,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-05 20:30:02,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-05 20:30:02,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 20 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 6 states have return successors, (7), 6 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-05 20:30:02,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2024-11-05 20:30:02,631 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 29 [2024-11-05 20:30:02,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:30:02,631 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2024-11-05 20:30:02,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.36) internal successors, (34), 18 states have internal predecessors, (34), 6 states have call successors, (6), 1 states have call predecessors, (6), 8 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-05 20:30:02,631 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2024-11-05 20:30:02,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-05 20:30:02,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:30:02,632 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:30:02,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-05 20:30:02,834 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:30:02,835 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:30:02,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:30:02,838 INFO L85 PathProgramCache]: Analyzing trace with hash -492655308, now seen corresponding path program 3 times [2024-11-05 20:30:02,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:30:02,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [476621546] [2024-11-05 20:30:02,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:30:02,838 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:30:02,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:30:02,841 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:30:02,842 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:30:02,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:30:02,869 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-05 20:30:02,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:30:03,105 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-05 20:30:03,105 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:30:04,604 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-05 20:30:04,604 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:30:04,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [476621546] [2024-11-05 20:30:04,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [476621546] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:30:04,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:30:04,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21] total 36 [2024-11-05 20:30:04,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656903875] [2024-11-05 20:30:04,605 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:30:04,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-05 20:30:04,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:30:04,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-05 20:30:04,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1141, Unknown=0, NotChecked=0, Total=1260 [2024-11-05 20:30:04,607 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand has 36 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 24 states have internal predecessors, (46), 8 states have call successors, (8), 1 states have call predecessors, (8), 12 states have return successors, (12), 12 states have call predecessors, (12), 8 states have call successors, (12) [2024-11-05 20:30:05,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:30:05,238 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2024-11-05 20:30:05,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-05 20:30:05,239 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 24 states have internal predecessors, (46), 8 states have call successors, (8), 1 states have call predecessors, (8), 12 states have return successors, (12), 12 states have call predecessors, (12), 8 states have call successors, (12) Word has length 41 [2024-11-05 20:30:05,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:30:05,239 INFO L225 Difference]: With dead ends: 40 [2024-11-05 20:30:05,239 INFO L226 Difference]: Without dead ends: 34 [2024-11-05 20:30:05,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=277, Invalid=2173, Unknown=0, NotChecked=0, Total=2450 [2024-11-05 20:30:05,241 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 90 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-05 20:30:05,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 176 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-05 20:30:05,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-05 20:30:05,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-05 20:30:05,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 24 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (9), 8 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-05 20:30:05,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2024-11-05 20:30:05,259 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 41 [2024-11-05 20:30:05,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:30:05,259 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2024-11-05 20:30:05,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 24 states have internal predecessors, (46), 8 states have call successors, (8), 1 states have call predecessors, (8), 12 states have return successors, (12), 12 states have call predecessors, (12), 8 states have call successors, (12) [2024-11-05 20:30:05,259 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2024-11-05 20:30:05,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-05 20:30:05,260 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:30:05,260 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:30:05,264 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:30:05,461 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:30:05,462 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:30:05,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:30:05,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1906255628, now seen corresponding path program 4 times [2024-11-05 20:30:05,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:30:05,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [748623386] [2024-11-05 20:30:05,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:30:05,463 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:30:05,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:30:05,464 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:30:05,467 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:30:05,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:30:05,529 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-05 20:30:05,532 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:30:05,828 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-11-05 20:30:05,828 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:30:08,406 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-05 20:30:08,406 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:30:08,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [748623386] [2024-11-05 20:30:08,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [748623386] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:30:08,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:30:08,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 27] total 46 [2024-11-05 20:30:08,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135750304] [2024-11-05 20:30:08,407 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:30:08,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-05 20:30:08,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:30:08,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-05 20:30:08,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1913, Unknown=0, NotChecked=0, Total=2070 [2024-11-05 20:30:08,409 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 46 states, 45 states have (on average 1.288888888888889) internal successors, (58), 30 states have internal predecessors, (58), 10 states have call successors, (10), 1 states have call predecessors, (10), 16 states have return successors, (16), 16 states have call predecessors, (16), 10 states have call successors, (16) [2024-11-05 20:30:09,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:30:09,337 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2024-11-05 20:30:09,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-05 20:30:09,338 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.288888888888889) internal successors, (58), 30 states have internal predecessors, (58), 10 states have call successors, (10), 1 states have call predecessors, (10), 16 states have return successors, (16), 16 states have call predecessors, (16), 10 states have call successors, (16) Word has length 53 [2024-11-05 20:30:09,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:30:09,339 INFO L225 Difference]: With dead ends: 46 [2024-11-05 20:30:09,339 INFO L226 Difference]: Without dead ends: 40 [2024-11-05 20:30:09,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=399, Invalid=3633, Unknown=0, NotChecked=0, Total=4032 [2024-11-05 20:30:09,340 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 102 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-05 20:30:09,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 308 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-05 20:30:09,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-05 20:30:09,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-05 20:30:09,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.037037037037037) internal successors, (28), 28 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 10 states have return successors, (11), 10 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-05 20:30:09,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2024-11-05 20:30:09,356 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 53 [2024-11-05 20:30:09,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:30:09,356 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2024-11-05 20:30:09,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 1.288888888888889) internal successors, (58), 30 states have internal predecessors, (58), 10 states have call successors, (10), 1 states have call predecessors, (10), 16 states have return successors, (16), 16 states have call predecessors, (16), 10 states have call successors, (16) [2024-11-05 20:30:09,356 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2024-11-05 20:30:09,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-05 20:30:09,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:30:09,357 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:30:09,364 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:30:09,558 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:30:09,558 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:30:09,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:30:09,559 INFO L85 PathProgramCache]: Analyzing trace with hash 788849844, now seen corresponding path program 5 times [2024-11-05 20:30:09,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:30:09,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [521517922] [2024-11-05 20:30:09,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:30:09,559 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:30:09,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:30:09,560 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:30:09,561 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:30:09,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:30:09,594 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-05 20:30:09,596 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:30:10,004 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-11-05 20:30:10,004 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:30:13,250 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-05 20:30:13,251 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:30:13,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [521517922] [2024-11-05 20:30:13,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [521517922] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:30:13,251 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:30:13,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 33] total 56 [2024-11-05 20:30:13,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552917241] [2024-11-05 20:30:13,251 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:30:13,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2024-11-05 20:30:13,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:30:13,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-11-05 20:30:13,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=2885, Unknown=0, NotChecked=0, Total=3080 [2024-11-05 20:30:13,253 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand has 56 states, 55 states have (on average 1.2727272727272727) internal successors, (70), 36 states have internal predecessors, (70), 12 states have call successors, (12), 1 states have call predecessors, (12), 20 states have return successors, (20), 20 states have call predecessors, (20), 12 states have call successors, (20) [2024-11-05 20:30:14,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:30:14,673 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2024-11-05 20:30:14,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-05 20:30:14,674 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 1.2727272727272727) internal successors, (70), 36 states have internal predecessors, (70), 12 states have call successors, (12), 1 states have call predecessors, (12), 20 states have return successors, (20), 20 states have call predecessors, (20), 12 states have call successors, (20) Word has length 65 [2024-11-05 20:30:14,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:30:14,675 INFO L225 Difference]: With dead ends: 52 [2024-11-05 20:30:14,675 INFO L226 Difference]: Without dead ends: 46 [2024-11-05 20:30:14,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 781 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=537, Invalid=5469, Unknown=0, NotChecked=0, Total=6006 [2024-11-05 20:30:14,678 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 126 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 957 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 1014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-05 20:30:14,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 516 Invalid, 1014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 957 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-05 20:30:14,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-05 20:30:14,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-05 20:30:14,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.032258064516129) internal successors, (32), 32 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 12 states have return successors, (13), 12 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-05 20:30:14,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2024-11-05 20:30:14,685 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 65 [2024-11-05 20:30:14,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:30:14,685 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2024-11-05 20:30:14,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 1.2727272727272727) internal successors, (70), 36 states have internal predecessors, (70), 12 states have call successors, (12), 1 states have call predecessors, (12), 20 states have return successors, (20), 20 states have call predecessors, (20), 12 states have call successors, (20) [2024-11-05 20:30:14,686 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2024-11-05 20:30:14,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-05 20:30:14,688 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:30:14,688 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:30:14,692 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:30:14,890 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:30:14,891 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:30:14,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:30:14,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1302253684, now seen corresponding path program 6 times [2024-11-05 20:30:14,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:30:14,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [21580360] [2024-11-05 20:30:14,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:30:14,892 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:30:14,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:30:14,895 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:30:14,896 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:30:14,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:30:14,962 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-05 20:30:14,964 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:30:15,504 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2024-11-05 20:30:15,505 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:30:19,533 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-05 20:30:19,534 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:30:19,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [21580360] [2024-11-05 20:30:19,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [21580360] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:30:19,534 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:30:19,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 39] total 66 [2024-11-05 20:30:19,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958392995] [2024-11-05 20:30:19,535 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:30:19,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2024-11-05 20:30:19,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:30:19,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2024-11-05 20:30:19,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=4057, Unknown=0, NotChecked=0, Total=4290 [2024-11-05 20:30:19,539 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand has 66 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 42 states have internal predecessors, (82), 14 states have call successors, (14), 1 states have call predecessors, (14), 24 states have return successors, (24), 24 states have call predecessors, (24), 14 states have call successors, (24) [2024-11-05 20:30:21,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:30:21,240 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2024-11-05 20:30:21,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-05 20:30:21,241 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 42 states have internal predecessors, (82), 14 states have call successors, (14), 1 states have call predecessors, (14), 24 states have return successors, (24), 24 states have call predecessors, (24), 14 states have call successors, (24) Word has length 77 [2024-11-05 20:30:21,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:30:21,242 INFO L225 Difference]: With dead ends: 58 [2024-11-05 20:30:21,242 INFO L226 Difference]: Without dead ends: 52 [2024-11-05 20:30:21,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1092 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=691, Invalid=7681, Unknown=0, NotChecked=0, Total=8372 [2024-11-05 20:30:21,248 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 150 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 1117 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-05 20:30:21,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 585 Invalid, 1184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1117 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-05 20:30:21,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-05 20:30:21,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-05 20:30:21,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 36 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 14 states have return successors, (15), 14 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 20:30:21,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2024-11-05 20:30:21,258 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 77 [2024-11-05 20:30:21,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:30:21,258 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2024-11-05 20:30:21,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 42 states have internal predecessors, (82), 14 states have call successors, (14), 1 states have call predecessors, (14), 24 states have return successors, (24), 24 states have call predecessors, (24), 14 states have call successors, (24) [2024-11-05 20:30:21,259 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2024-11-05 20:30:21,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-05 20:30:21,259 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:30:21,259 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:30:21,264 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:30:21,462 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:30:21,462 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:30:21,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:30:21,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1287742412, now seen corresponding path program 7 times [2024-11-05 20:30:21,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:30:21,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1395201771] [2024-11-05 20:30:21,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:30:21,463 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:30:21,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:30:21,465 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:30:21,466 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:30:21,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:30:21,522 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-05 20:30:21,525 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:30:22,261 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-11-05 20:30:22,261 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:30:27,691 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-05 20:30:27,692 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:30:27,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1395201771] [2024-11-05 20:30:27,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1395201771] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:30:27,692 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:30:27,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 45] total 76 [2024-11-05 20:30:27,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251752340] [2024-11-05 20:30:27,692 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:30:27,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2024-11-05 20:30:27,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:30:27,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2024-11-05 20:30:27,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=5429, Unknown=0, NotChecked=0, Total=5700 [2024-11-05 20:30:27,695 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand has 76 states, 75 states have (on average 1.2533333333333334) internal successors, (94), 48 states have internal predecessors, (94), 16 states have call successors, (16), 1 states have call predecessors, (16), 28 states have return successors, (28), 28 states have call predecessors, (28), 16 states have call successors, (28) [2024-11-05 20:30:29,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:30:29,913 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2024-11-05 20:30:29,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-05 20:30:29,914 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 75 states have (on average 1.2533333333333334) internal successors, (94), 48 states have internal predecessors, (94), 16 states have call successors, (16), 1 states have call predecessors, (16), 28 states have return successors, (28), 28 states have call predecessors, (28), 16 states have call successors, (28) Word has length 89 [2024-11-05 20:30:29,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:30:29,918 INFO L225 Difference]: With dead ends: 64 [2024-11-05 20:30:29,918 INFO L226 Difference]: Without dead ends: 58 [2024-11-05 20:30:29,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1455 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=861, Invalid=10269, Unknown=0, NotChecked=0, Total=11130 [2024-11-05 20:30:29,922 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 172 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 1408 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 1484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-05 20:30:29,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 737 Invalid, 1484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1408 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-05 20:30:29,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-05 20:30:29,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-05 20:30:29,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 40 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 16 states have return successors, (17), 16 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-05 20:30:29,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2024-11-05 20:30:29,929 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 89 [2024-11-05 20:30:29,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:30:29,929 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2024-11-05 20:30:29,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 75 states have (on average 1.2533333333333334) internal successors, (94), 48 states have internal predecessors, (94), 16 states have call successors, (16), 1 states have call predecessors, (16), 28 states have return successors, (28), 28 states have call predecessors, (28), 16 states have call successors, (28) [2024-11-05 20:30:29,929 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2024-11-05 20:30:29,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-05 20:30:29,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:30:29,930 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:30:29,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-05 20:30:30,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:30:30,134 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:30:30,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:30:30,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1760839668, now seen corresponding path program 8 times [2024-11-05 20:30:30,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:30:30,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [141189578] [2024-11-05 20:30:30,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:30:30,135 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:30:30,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:30:30,137 INFO L229 MonitoredProcess]: Starting monitored process 10 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:30:30,138 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 (10)] Waiting until timeout for monitored process [2024-11-05 20:30:30,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:30:30,202 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-11-05 20:30:30,205 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:30:30,812 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2024-11-05 20:30:30,812 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:30:37,474 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 570 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-05 20:30:37,474 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:30:37,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [141189578] [2024-11-05 20:30:37,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [141189578] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:30:37,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:30:37,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 51] total 86 [2024-11-05 20:30:37,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084928818] [2024-11-05 20:30:37,475 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:30:37,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2024-11-05 20:30:37,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:30:37,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2024-11-05 20:30:37,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=7001, Unknown=0, NotChecked=0, Total=7310 [2024-11-05 20:30:37,477 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand has 86 states, 85 states have (on average 1.2470588235294118) internal successors, (106), 54 states have internal predecessors, (106), 18 states have call successors, (18), 1 states have call predecessors, (18), 32 states have return successors, (32), 32 states have call predecessors, (32), 18 states have call successors, (32) [2024-11-05 20:30:40,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:30:40,061 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2024-11-05 20:30:40,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-11-05 20:30:40,062 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 85 states have (on average 1.2470588235294118) internal successors, (106), 54 states have internal predecessors, (106), 18 states have call successors, (18), 1 states have call predecessors, (18), 32 states have return successors, (32), 32 states have call predecessors, (32), 18 states have call successors, (32) Word has length 101 [2024-11-05 20:30:40,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:30:40,063 INFO L225 Difference]: With dead ends: 70 [2024-11-05 20:30:40,063 INFO L226 Difference]: Without dead ends: 64 [2024-11-05 20:30:40,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1870 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1047, Invalid=13233, Unknown=0, NotChecked=0, Total=14280 [2024-11-05 20:30:40,065 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 36 mSDsluCounter, 900 mSDsCounter, 0 mSdLazyCounter, 1748 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 1749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-05 20:30:40,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 923 Invalid, 1749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1748 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-05 20:30:40,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-05 20:30:40,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-05 20:30:40,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 44 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 18 states have return successors, (19), 18 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-05 20:30:40,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2024-11-05 20:30:40,073 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 101 [2024-11-05 20:30:40,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:30:40,074 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2024-11-05 20:30:40,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 85 states have (on average 1.2470588235294118) internal successors, (106), 54 states have internal predecessors, (106), 18 states have call successors, (18), 1 states have call predecessors, (18), 32 states have return successors, (32), 32 states have call predecessors, (32), 18 states have call successors, (32) [2024-11-05 20:30:40,074 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2024-11-05 20:30:40,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-05 20:30:40,076 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:30:40,076 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:30:40,081 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 (10)] Ended with exit code 0 [2024-11-05 20:30:40,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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:30:40,281 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:30:40,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:30:40,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1211116620, now seen corresponding path program 9 times [2024-11-05 20:30:40,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:30:40,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2070894910] [2024-11-05 20:30:40,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:30:40,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 [2024-11-05 20:30:40,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:30:40,286 INFO L229 MonitoredProcess]: Starting monitored process 11 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:30:40,287 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 (11)] Waiting until timeout for monitored process [2024-11-05 20:30:40,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:30:40,355 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-11-05 20:30:40,359 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:30:41,103 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2024-11-05 20:30:41,103 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:30:49,780 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 731 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-11-05 20:30:49,780 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:30:49,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2070894910] [2024-11-05 20:30:49,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2070894910] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:30:49,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:30:49,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 57] total 96 [2024-11-05 20:30:49,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246777427] [2024-11-05 20:30:49,781 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:30:49,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2024-11-05 20:30:49,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:30:49,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2024-11-05 20:30:49,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=8773, Unknown=0, NotChecked=0, Total=9120 [2024-11-05 20:30:49,783 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand has 96 states, 95 states have (on average 1.2421052631578948) internal successors, (118), 60 states have internal predecessors, (118), 20 states have call successors, (20), 1 states have call predecessors, (20), 36 states have return successors, (36), 36 states have call predecessors, (36), 20 states have call successors, (36) [2024-11-05 20:30:52,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:30:52,981 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2024-11-05 20:30:52,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-11-05 20:30:52,982 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 95 states have (on average 1.2421052631578948) internal successors, (118), 60 states have internal predecessors, (118), 20 states have call successors, (20), 1 states have call predecessors, (20), 36 states have return successors, (36), 36 states have call predecessors, (36), 20 states have call successors, (36) Word has length 113 [2024-11-05 20:30:52,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:30:52,983 INFO L225 Difference]: With dead ends: 76 [2024-11-05 20:30:52,983 INFO L226 Difference]: Without dead ends: 70 [2024-11-05 20:30:52,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2337 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=1249, Invalid=16573, Unknown=0, NotChecked=0, Total=17822 [2024-11-05 20:30:52,986 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 438 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 2122 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 1072 SdHoareTripleChecker+Invalid, 2333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 2122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-05 20:30:52,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 1072 Invalid, 2333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 2122 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-05 20:30:52,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-05 20:30:52,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-05 20:30:53,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 48 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 20 states have return successors, (21), 20 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-05 20:30:53,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2024-11-05 20:30:53,000 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 113 [2024-11-05 20:30:53,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:30:53,001 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2024-11-05 20:30:53,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 95 states have (on average 1.2421052631578948) internal successors, (118), 60 states have internal predecessors, (118), 20 states have call successors, (20), 1 states have call predecessors, (20), 36 states have return successors, (36), 36 states have call predecessors, (36), 20 states have call successors, (36) [2024-11-05 20:30:53,001 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2024-11-05 20:30:53,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-05 20:30:53,002 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:30:53,002 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:30:53,012 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 (11)] Forceful destruction successful, exit code 0 [2024-11-05 20:30:53,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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:30:53,208 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:30:53,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:30:53,208 INFO L85 PathProgramCache]: Analyzing trace with hash 685850484, now seen corresponding path program 10 times [2024-11-05 20:30:53,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:30:53,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1623667117] [2024-11-05 20:30:53,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:30:53,209 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:30:53,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:30:53,211 INFO L229 MonitoredProcess]: Starting monitored process 12 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:30:53,212 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 (12)] Waiting until timeout for monitored process [2024-11-05 20:30:53,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:30:53,292 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 84 conjuncts are in the unsatisfiable core [2024-11-05 20:30:53,295 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:30:54,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2024-11-05 20:30:54,337 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:31:05,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 912 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-05 20:31:05,243 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:31:05,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1623667117] [2024-11-05 20:31:05,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1623667117] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:31:05,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:31:05,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 63] total 106 [2024-11-05 20:31:05,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761367588] [2024-11-05 20:31:05,247 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:31:05,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 106 states [2024-11-05 20:31:05,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:31:05,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2024-11-05 20:31:05,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=385, Invalid=10745, Unknown=0, NotChecked=0, Total=11130 [2024-11-05 20:31:05,253 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand has 106 states, 105 states have (on average 1.2380952380952381) internal successors, (130), 66 states have internal predecessors, (130), 22 states have call successors, (22), 1 states have call predecessors, (22), 40 states have return successors, (40), 40 states have call predecessors, (40), 22 states have call successors, (40) [2024-11-05 20:31:09,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:31:09,264 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2024-11-05 20:31:09,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-11-05 20:31:09,264 INFO L78 Accepts]: Start accepts. Automaton has has 106 states, 105 states have (on average 1.2380952380952381) internal successors, (130), 66 states have internal predecessors, (130), 22 states have call successors, (22), 1 states have call predecessors, (22), 40 states have return successors, (40), 40 states have call predecessors, (40), 22 states have call successors, (40) Word has length 125 [2024-11-05 20:31:09,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:31:09,265 INFO L225 Difference]: With dead ends: 82 [2024-11-05 20:31:09,265 INFO L226 Difference]: Without dead ends: 76 [2024-11-05 20:31:09,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2856 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=1467, Invalid=20289, Unknown=0, NotChecked=0, Total=21756 [2024-11-05 20:31:09,268 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 284 mSDsluCounter, 1256 mSDsCounter, 0 mSdLazyCounter, 2635 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 1283 SdHoareTripleChecker+Invalid, 2762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 2635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-05 20:31:09,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 1283 Invalid, 2762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 2635 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-05 20:31:09,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-05 20:31:09,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-05 20:31:09,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 52 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 22 states have return successors, (23), 22 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-05 20:31:09,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2024-11-05 20:31:09,279 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 125 [2024-11-05 20:31:09,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:31:09,281 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2024-11-05 20:31:09,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 106 states, 105 states have (on average 1.2380952380952381) internal successors, (130), 66 states have internal predecessors, (130), 22 states have call successors, (22), 1 states have call predecessors, (22), 40 states have return successors, (40), 40 states have call predecessors, (40), 22 states have call successors, (40) [2024-11-05 20:31:09,281 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2024-11-05 20:31:09,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-05 20:31:09,282 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:31:09,282 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:31:09,291 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 (12)] Ended with exit code 0 [2024-11-05 20:31:09,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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:31:09,483 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:31:09,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:31:09,483 INFO L85 PathProgramCache]: Analyzing trace with hash -2059891916, now seen corresponding path program 11 times [2024-11-05 20:31:09,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:31:09,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1512788338] [2024-11-05 20:31:09,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:31:09,484 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:31:09,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:31:09,485 INFO L229 MonitoredProcess]: Starting monitored process 13 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:31:09,487 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 (13)] Waiting until timeout for monitored process [2024-11-05 20:31:09,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:31:09,607 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 92 conjuncts are in the unsatisfiable core [2024-11-05 20:31:09,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:31:10,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2024-11-05 20:31:10,812 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:31:23,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 1113 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-05 20:31:23,116 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:31:23,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1512788338] [2024-11-05 20:31:23,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1512788338] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:31:23,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:31:23,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 69] total 116 [2024-11-05 20:31:23,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244336874] [2024-11-05 20:31:23,118 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:31:23,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 116 states [2024-11-05 20:31:23,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:31:23,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2024-11-05 20:31:23,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=423, Invalid=12917, Unknown=0, NotChecked=0, Total=13340 [2024-11-05 20:31:23,121 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand has 116 states, 115 states have (on average 1.2347826086956522) internal successors, (142), 72 states have internal predecessors, (142), 24 states have call successors, (24), 1 states have call predecessors, (24), 44 states have return successors, (44), 44 states have call predecessors, (44), 24 states have call successors, (44) [2024-11-05 20:31:27,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:31:27,691 INFO L93 Difference]: Finished difference Result 88 states and 90 transitions. [2024-11-05 20:31:27,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-11-05 20:31:27,692 INFO L78 Accepts]: Start accepts. Automaton has has 116 states, 115 states have (on average 1.2347826086956522) internal successors, (142), 72 states have internal predecessors, (142), 24 states have call successors, (24), 1 states have call predecessors, (24), 44 states have return successors, (44), 44 states have call predecessors, (44), 24 states have call successors, (44) Word has length 137 [2024-11-05 20:31:27,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:31:27,693 INFO L225 Difference]: With dead ends: 88 [2024-11-05 20:31:27,693 INFO L226 Difference]: Without dead ends: 82 [2024-11-05 20:31:27,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3427 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=1701, Invalid=24381, Unknown=0, NotChecked=0, Total=26082 [2024-11-05 20:31:27,695 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 886 mSDsluCounter, 1618 mSDsCounter, 0 mSdLazyCounter, 3390 mSolverCounterSat, 439 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 912 SdHoareTripleChecker+Valid, 1647 SdHoareTripleChecker+Invalid, 3829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 439 IncrementalHoareTripleChecker+Valid, 3390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-05 20:31:27,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [912 Valid, 1647 Invalid, 3829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [439 Valid, 3390 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-05 20:31:27,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-05 20:31:27,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-05 20:31:27,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 55 states have (on average 1.018181818181818) internal successors, (56), 56 states have internal predecessors, (56), 2 states have call successors, (2), 1 states have call predecessors, (2), 24 states have return successors, (25), 24 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-05 20:31:27,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2024-11-05 20:31:27,703 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 137 [2024-11-05 20:31:27,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:31:27,703 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2024-11-05 20:31:27,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 116 states, 115 states have (on average 1.2347826086956522) internal successors, (142), 72 states have internal predecessors, (142), 24 states have call successors, (24), 1 states have call predecessors, (24), 44 states have return successors, (44), 44 states have call predecessors, (44), 24 states have call successors, (44) [2024-11-05 20:31:27,703 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2024-11-05 20:31:27,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-05 20:31:27,704 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:31:27,704 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:31:27,709 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 (13)] Ended with exit code 0 [2024-11-05 20:31:27,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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:31:27,905 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:31:27,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:31:27,905 INFO L85 PathProgramCache]: Analyzing trace with hash -706365708, now seen corresponding path program 12 times [2024-11-05 20:31:27,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:31:27,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1168639498] [2024-11-05 20:31:27,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:31:27,906 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:31:27,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:31:27,907 INFO L229 MonitoredProcess]: Starting monitored process 14 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:31:27,909 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 (14)] Waiting until timeout for monitored process [2024-11-05 20:31:28,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:31:28,029 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 100 conjuncts are in the unsatisfiable core [2024-11-05 20:31:28,032 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:31:29,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2024-11-05 20:31:29,443 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:31:43,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 1334 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-05 20:31:43,212 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:31:43,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1168639498] [2024-11-05 20:31:43,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1168639498] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:31:43,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:31:43,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 75] total 126 [2024-11-05 20:31:43,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498258957] [2024-11-05 20:31:43,212 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:31:43,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 126 states [2024-11-05 20:31:43,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:31:43,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2024-11-05 20:31:43,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=461, Invalid=15289, Unknown=0, NotChecked=0, Total=15750 [2024-11-05 20:31:43,216 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand has 126 states, 125 states have (on average 1.232) internal successors, (154), 78 states have internal predecessors, (154), 26 states have call successors, (26), 1 states have call predecessors, (26), 48 states have return successors, (48), 48 states have call predecessors, (48), 26 states have call successors, (48)