/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/soft_float_1-2a.c.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-df9f019-m [2024-11-05 20:29:10,187 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 20:29:10,253 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:10,261 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 20:29:10,262 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 20:29:10,293 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 20:29:10,294 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 20:29:10,294 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 20:29:10,295 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 20:29:10,296 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 20:29:10,296 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 20:29:10,296 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 20:29:10,298 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 20:29:10,298 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 20:29:10,298 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 20:29:10,299 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 20:29:10,299 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 20:29:10,299 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-05 20:29:10,299 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-05 20:29:10,299 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 20:29:10,300 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 20:29:10,303 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 20:29:10,304 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 20:29:10,304 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 20:29:10,304 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 20:29:10,304 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 20:29:10,304 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 20:29:10,304 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-05 20:29:10,305 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 20:29:10,305 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 20:29:10,305 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 20:29:10,305 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 20:29:10,305 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 20:29:10,306 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 20:29:10,306 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 20:29:10,306 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 20:29:10,306 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 20:29:10,306 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 20:29:10,307 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 20:29:10,307 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 20:29:10,308 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 20:29:10,309 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 20:29:10,309 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 20:29:10,309 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 20:29:10,309 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:10,532 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 20:29:10,554 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 20:29:10,558 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 20:29:10,559 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 20:29:10,560 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 20:29:10,562 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/soft_float_1-2a.c.cil.c [2024-11-05 20:29:12,042 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 20:29:12,253 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 20:29:12,253 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/soft_float_1-2a.c.cil.c [2024-11-05 20:29:12,267 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7da3421f4/be2400671325494988b71d1ad5ec375c/FLAG7f040a7c2 [2024-11-05 20:29:12,281 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7da3421f4/be2400671325494988b71d1ad5ec375c [2024-11-05 20:29:12,284 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 20:29:12,285 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 20:29:12,286 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 20:29:12,287 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 20:29:12,295 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 20:29:12,296 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:29:12" (1/1) ... [2024-11-05 20:29:12,297 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73cf921e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:12, skipping insertion in model container [2024-11-05 20:29:12,297 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:29:12" (1/1) ... [2024-11-05 20:29:12,334 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 20:29:12,499 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/soft_float_1-2a.c.cil.c[755,768] [2024-11-05 20:29:12,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 20:29:12,572 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 20:29:12,581 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/soft_float_1-2a.c.cil.c[755,768] [2024-11-05 20:29:12,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 20:29:12,624 INFO L204 MainTranslator]: Completed translation [2024-11-05 20:29:12,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:12 WrapperNode [2024-11-05 20:29:12,625 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 20:29:12,626 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 20:29:12,626 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 20:29:12,626 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 20:29:12,633 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:12" (1/1) ... [2024-11-05 20:29:12,642 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:12" (1/1) ... [2024-11-05 20:29:12,660 INFO L138 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 149 [2024-11-05 20:29:12,661 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 20:29:12,662 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 20:29:12,662 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 20:29:12,662 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 20:29:12,674 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:12" (1/1) ... [2024-11-05 20:29:12,675 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:12" (1/1) ... [2024-11-05 20:29:12,680 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:12" (1/1) ... [2024-11-05 20:29:12,691 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:12,692 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:12" (1/1) ... [2024-11-05 20:29:12,692 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:12" (1/1) ... [2024-11-05 20:29:12,706 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:12" (1/1) ... [2024-11-05 20:29:12,714 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:12" (1/1) ... [2024-11-05 20:29:12,717 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:12" (1/1) ... [2024-11-05 20:29:12,719 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:12" (1/1) ... [2024-11-05 20:29:12,723 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 20:29:12,724 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 20:29:12,724 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 20:29:12,725 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 20:29:12,725 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:12" (1/1) ... [2024-11-05 20:29:12,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 20:29:12,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 20:29:12,753 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:12,756 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:12,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 20:29:12,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 20:29:12,785 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-11-05 20:29:12,785 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-11-05 20:29:12,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 20:29:12,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 20:29:12,785 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-05 20:29:12,785 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-05 20:29:12,883 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 20:29:12,888 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 20:29:13,303 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2024-11-05 20:29:13,303 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 20:29:13,321 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 20:29:13,321 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-05 20:29:13,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:29:13 BoogieIcfgContainer [2024-11-05 20:29:13,322 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 20:29:13,326 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 20:29:13,326 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 20:29:13,330 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 20:29:13,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 08:29:12" (1/3) ... [2024-11-05 20:29:13,332 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ad3a131 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:29:13, skipping insertion in model container [2024-11-05 20:29:13,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:12" (2/3) ... [2024-11-05 20:29:13,332 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ad3a131 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:29:13, skipping insertion in model container [2024-11-05 20:29:13,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:29:13" (3/3) ... [2024-11-05 20:29:13,351 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_1-2a.c.cil.c [2024-11-05 20:29:13,373 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 20:29:13,376 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 20:29:13,430 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 20:29:13,439 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;@30f70003, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 20:29:13,439 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 20:29:13,443 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 60 states have (on average 1.6) internal successors, (96), 63 states have internal predecessors, (96), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-05 20:29:13,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-05 20:29:13,449 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:13,450 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:29:13,450 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:13,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:13,454 INFO L85 PathProgramCache]: Analyzing trace with hash -760882007, now seen corresponding path program 1 times [2024-11-05 20:29:13,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:13,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1209535981] [2024-11-05 20:29:13,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:13,464 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:13,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:13,465 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:13,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 (2)] Waiting until timeout for monitored process [2024-11-05 20:29:13,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:13,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-05 20:29:13,573 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:13,672 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-05 20:29:13,673 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:13,760 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-05 20:29:13,761 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:13,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1209535981] [2024-11-05 20:29:13,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1209535981] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:29:13,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:29:13,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2024-11-05 20:29:13,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398300455] [2024-11-05 20:29:13,765 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:29:13,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 20:29:13,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:13,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 20:29:13,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-05 20:29:13,795 INFO L87 Difference]: Start difference. First operand has 72 states, 60 states have (on average 1.6) internal successors, (96), 63 states have internal predecessors, (96), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-05 20:29:13,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:13,908 INFO L93 Difference]: Finished difference Result 154 states and 253 transitions. [2024-11-05 20:29:13,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 20:29:13,913 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2024-11-05 20:29:13,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:13,923 INFO L225 Difference]: With dead ends: 154 [2024-11-05 20:29:13,923 INFO L226 Difference]: Without dead ends: 81 [2024-11-05 20:29:13,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-05 20:29:13,933 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 5 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:13,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 491 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 20:29:13,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-05 20:29:13,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2024-11-05 20:29:13,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 66 states have (on average 1.4545454545454546) internal successors, (96), 68 states have internal predecessors, (96), 10 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (14), 10 states have call predecessors, (14), 9 states have call successors, (14) [2024-11-05 20:29:13,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 120 transitions. [2024-11-05 20:29:13,981 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 120 transitions. Word has length 32 [2024-11-05 20:29:13,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:13,982 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 120 transitions. [2024-11-05 20:29:13,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-05 20:29:13,982 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 120 transitions. [2024-11-05 20:29:13,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-05 20:29:13,984 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:13,985 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:29:13,988 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:29:14,185 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:29:14,186 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:14,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:14,187 INFO L85 PathProgramCache]: Analyzing trace with hash 975798983, now seen corresponding path program 1 times [2024-11-05 20:29:14,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:14,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2054106565] [2024-11-05 20:29:14,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:14,187 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:14,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:14,191 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:29:14,193 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:29:14,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:14,248 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-05 20:29:14,250 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:14,304 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-05 20:29:14,305 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:14,363 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-05 20:29:14,363 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:14,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2054106565] [2024-11-05 20:29:14,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2054106565] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:29:14,363 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:29:14,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2024-11-05 20:29:14,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845711569] [2024-11-05 20:29:14,364 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:29:14,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 20:29:14,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:14,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 20:29:14,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-05 20:29:14,369 INFO L87 Difference]: Start difference. First operand 80 states and 120 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-05 20:29:14,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:14,487 INFO L93 Difference]: Finished difference Result 167 states and 254 transitions. [2024-11-05 20:29:14,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 20:29:14,490 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2024-11-05 20:29:14,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:14,492 INFO L225 Difference]: With dead ends: 167 [2024-11-05 20:29:14,492 INFO L226 Difference]: Without dead ends: 125 [2024-11-05 20:29:14,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-05 20:29:14,494 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 46 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:14,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 435 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 20:29:14,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-05 20:29:14,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2024-11-05 20:29:14,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 105 states have (on average 1.457142857142857) internal successors, (153), 106 states have internal predecessors, (153), 14 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (18), 16 states have call predecessors, (18), 13 states have call successors, (18) [2024-11-05 20:29:14,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 185 transitions. [2024-11-05 20:29:14,516 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 185 transitions. Word has length 36 [2024-11-05 20:29:14,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:14,516 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 185 transitions. [2024-11-05 20:29:14,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-05 20:29:14,516 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 185 transitions. [2024-11-05 20:29:14,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-05 20:29:14,518 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:14,518 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:29:14,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-05 20:29:14,722 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:29:14,723 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:14,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:14,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1655857353, now seen corresponding path program 1 times [2024-11-05 20:29:14,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:14,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [650095442] [2024-11-05 20:29:14,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:14,724 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:14,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:14,727 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:29:14,728 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:29:14,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:14,781 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-05 20:29:14,784 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:14,849 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-05 20:29:14,849 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:14,914 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-05 20:29:14,914 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:14,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [650095442] [2024-11-05 20:29:14,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [650095442] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:29:14,915 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:29:14,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2024-11-05 20:29:14,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298895762] [2024-11-05 20:29:14,915 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:29:14,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-05 20:29:14,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:14,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-05 20:29:14,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-05 20:29:14,918 INFO L87 Difference]: Start difference. First operand 123 states and 185 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-05 20:29:15,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:15,039 INFO L93 Difference]: Finished difference Result 155 states and 231 transitions. [2024-11-05 20:29:15,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-05 20:29:15,040 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2024-11-05 20:29:15,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:15,042 INFO L225 Difference]: With dead ends: 155 [2024-11-05 20:29:15,042 INFO L226 Difference]: Without dead ends: 116 [2024-11-05 20:29:15,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-05 20:29:15,043 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 33 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:15,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 511 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 20:29:15,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-05 20:29:15,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2024-11-05 20:29:15,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 98 states have (on average 1.4387755102040816) internal successors, (141), 99 states have internal predecessors, (141), 12 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (16), 14 states have call predecessors, (16), 11 states have call successors, (16) [2024-11-05 20:29:15,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 169 transitions. [2024-11-05 20:29:15,056 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 169 transitions. Word has length 36 [2024-11-05 20:29:15,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:15,056 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 169 transitions. [2024-11-05 20:29:15,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-05 20:29:15,057 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 169 transitions. [2024-11-05 20:29:15,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-05 20:29:15,058 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:15,058 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:29:15,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-05 20:29:15,259 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:29:15,260 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:15,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:15,260 INFO L85 PathProgramCache]: Analyzing trace with hash -371678158, now seen corresponding path program 1 times [2024-11-05 20:29:15,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:15,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1733097111] [2024-11-05 20:29:15,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:15,261 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:15,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:15,262 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:29:15,263 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:29:15,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:15,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-05 20:29:15,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:15,393 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-05 20:29:15,394 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:15,448 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-05 20:29:15,449 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:15,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1733097111] [2024-11-05 20:29:15,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1733097111] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:29:15,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:29:15,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-11-05 20:29:15,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632696872] [2024-11-05 20:29:15,450 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:29:15,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 20:29:15,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:15,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 20:29:15,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-05 20:29:15,454 INFO L87 Difference]: Start difference. First operand 114 states and 169 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-05 20:29:15,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:15,617 INFO L93 Difference]: Finished difference Result 256 states and 383 transitions. [2024-11-05 20:29:15,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-05 20:29:15,620 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 40 [2024-11-05 20:29:15,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:15,622 INFO L225 Difference]: With dead ends: 256 [2024-11-05 20:29:15,622 INFO L226 Difference]: Without dead ends: 181 [2024-11-05 20:29:15,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-05 20:29:15,627 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 28 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:15,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 590 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 20:29:15,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-05 20:29:15,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 178. [2024-11-05 20:29:15,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 156 states have (on average 1.3846153846153846) internal successors, (216), 155 states have internal predecessors, (216), 18 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (24), 24 states have call predecessors, (24), 17 states have call successors, (24) [2024-11-05 20:29:15,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 258 transitions. [2024-11-05 20:29:15,649 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 258 transitions. Word has length 40 [2024-11-05 20:29:15,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:15,650 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 258 transitions. [2024-11-05 20:29:15,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-05 20:29:15,650 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 258 transitions. [2024-11-05 20:29:15,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-05 20:29:15,652 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:15,652 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:29:15,657 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:29:15,853 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:29:15,853 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:15,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:15,854 INFO L85 PathProgramCache]: Analyzing trace with hash -2082074321, now seen corresponding path program 1 times [2024-11-05 20:29:15,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:15,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [766524418] [2024-11-05 20:29:15,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:15,855 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:15,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:15,857 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:29:15,858 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:29:15,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:15,913 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-05 20:29:15,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:15,945 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-05 20:29:15,945 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:16,001 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-05 20:29:16,001 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:16,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [766524418] [2024-11-05 20:29:16,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [766524418] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:29:16,001 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:29:16,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2024-11-05 20:29:16,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804632259] [2024-11-05 20:29:16,002 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:29:16,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 20:29:16,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:16,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 20:29:16,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-05 20:29:16,004 INFO L87 Difference]: Start difference. First operand 178 states and 258 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-05 20:29:16,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:16,057 INFO L93 Difference]: Finished difference Result 310 states and 451 transitions. [2024-11-05 20:29:16,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-05 20:29:16,058 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2024-11-05 20:29:16,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:16,060 INFO L225 Difference]: With dead ends: 310 [2024-11-05 20:29:16,061 INFO L226 Difference]: Without dead ends: 244 [2024-11-05 20:29:16,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-05 20:29:16,064 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 30 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:16,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 565 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 20:29:16,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-11-05 20:29:16,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 242. [2024-11-05 20:29:16,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 220 states have (on average 1.3227272727272728) internal successors, (291), 217 states have internal predecessors, (291), 18 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (24), 24 states have call predecessors, (24), 17 states have call successors, (24) [2024-11-05 20:29:16,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 333 transitions. [2024-11-05 20:29:16,083 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 333 transitions. Word has length 43 [2024-11-05 20:29:16,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:16,083 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 333 transitions. [2024-11-05 20:29:16,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-05 20:29:16,084 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 333 transitions. [2024-11-05 20:29:16,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-05 20:29:16,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:16,087 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:29:16,091 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:29:16,289 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:29:16,290 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:16,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:16,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1563397194, now seen corresponding path program 1 times [2024-11-05 20:29:16,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:16,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [221430333] [2024-11-05 20:29:16,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:16,291 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:16,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:16,292 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:29:16,293 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:29:16,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:16,341 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-05 20:29:16,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:16,491 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-05 20:29:16,491 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:16,594 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-05 20:29:16,594 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:16,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [221430333] [2024-11-05 20:29:16,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [221430333] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 20:29:16,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 20:29:16,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2024-11-05 20:29:16,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472953479] [2024-11-05 20:29:16,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 20:29:16,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 20:29:16,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:16,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 20:29:16,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-05 20:29:16,597 INFO L87 Difference]: Start difference. First operand 242 states and 333 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-05 20:29:16,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:16,801 INFO L93 Difference]: Finished difference Result 349 states and 487 transitions. [2024-11-05 20:29:16,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 20:29:16,802 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2024-11-05 20:29:16,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:16,805 INFO L225 Difference]: With dead ends: 349 [2024-11-05 20:29:16,805 INFO L226 Difference]: Without dead ends: 313 [2024-11-05 20:29:16,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-05 20:29:16,807 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 25 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:16,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 432 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 20:29:16,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-11-05 20:29:16,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 295. [2024-11-05 20:29:16,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 268 states have (on average 1.3097014925373134) internal successors, (351), 266 states have internal predecessors, (351), 23 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (29), 29 states have call predecessors, (29), 22 states have call successors, (29) [2024-11-05 20:29:16,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 403 transitions. [2024-11-05 20:29:16,824 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 403 transitions. Word has length 44 [2024-11-05 20:29:16,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:16,825 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 403 transitions. [2024-11-05 20:29:16,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-05 20:29:16,825 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 403 transitions. [2024-11-05 20:29:16,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-05 20:29:16,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:16,828 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:29:16,833 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:29:17,029 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:29:17,029 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:17,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:17,030 INFO L85 PathProgramCache]: Analyzing trace with hash -956562740, now seen corresponding path program 1 times [2024-11-05 20:29:17,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:17,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2124009122] [2024-11-05 20:29:17,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:17,030 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:17,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:17,031 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:29:17,032 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:29:17,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:17,080 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 20:29:17,082 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:17,108 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-05 20:29:17,108 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:17,159 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-05 20:29:17,160 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:17,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2124009122] [2024-11-05 20:29:17,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2124009122] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:29:17,160 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:29:17,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2024-11-05 20:29:17,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420028558] [2024-11-05 20:29:17,160 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:29:17,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 20:29:17,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:17,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 20:29:17,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-05 20:29:17,162 INFO L87 Difference]: Start difference. First operand 295 states and 403 transitions. Second operand has 8 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-05 20:29:17,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:17,202 INFO L93 Difference]: Finished difference Result 302 states and 409 transitions. [2024-11-05 20:29:17,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-05 20:29:17,203 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2024-11-05 20:29:17,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:17,205 INFO L225 Difference]: With dead ends: 302 [2024-11-05 20:29:17,206 INFO L226 Difference]: Without dead ends: 295 [2024-11-05 20:29:17,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-05 20:29:17,207 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 6 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:17,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 482 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 20:29:17,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-11-05 20:29:17,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2024-11-05 20:29:17,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 268 states have (on average 1.2985074626865671) internal successors, (348), 266 states have internal predecessors, (348), 23 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (29), 29 states have call predecessors, (29), 22 states have call successors, (29) [2024-11-05 20:29:17,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 400 transitions. [2024-11-05 20:29:17,233 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 400 transitions. Word has length 44 [2024-11-05 20:29:17,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:17,233 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 400 transitions. [2024-11-05 20:29:17,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-05 20:29:17,234 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 400 transitions. [2024-11-05 20:29:17,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-05 20:29:17,237 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:17,238 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:29:17,242 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:29:17,438 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:29:17,439 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:17,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:17,439 INFO L85 PathProgramCache]: Analyzing trace with hash -3100185, now seen corresponding path program 2 times [2024-11-05 20:29:17,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:17,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [519042575] [2024-11-05 20:29:17,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:17,440 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:17,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:17,443 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:29:17,456 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:29:17,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:17,504 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-05 20:29:17,506 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:17,603 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-05 20:29:17,603 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:17,677 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-05 20:29:17,678 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:17,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [519042575] [2024-11-05 20:29:17,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [519042575] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:29:17,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:29:17,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2024-11-05 20:29:17,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017641306] [2024-11-05 20:29:17,678 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:29:17,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-05 20:29:17,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:17,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-05 20:29:17,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-05 20:29:17,679 INFO L87 Difference]: Start difference. First operand 295 states and 400 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-05 20:29:17,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:17,847 INFO L93 Difference]: Finished difference Result 393 states and 520 transitions. [2024-11-05 20:29:17,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-05 20:29:17,849 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 44 [2024-11-05 20:29:17,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:17,852 INFO L225 Difference]: With dead ends: 393 [2024-11-05 20:29:17,852 INFO L226 Difference]: Without dead ends: 352 [2024-11-05 20:29:17,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-05 20:29:17,853 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 18 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:17,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 808 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 20:29:17,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-11-05 20:29:17,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 291. [2024-11-05 20:29:17,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 264 states have (on average 1.303030303030303) internal successors, (344), 262 states have internal predecessors, (344), 23 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (29), 29 states have call predecessors, (29), 22 states have call successors, (29) [2024-11-05 20:29:17,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 396 transitions. [2024-11-05 20:29:17,869 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 396 transitions. Word has length 44 [2024-11-05 20:29:17,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:17,869 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 396 transitions. [2024-11-05 20:29:17,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-05 20:29:17,869 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 396 transitions. [2024-11-05 20:29:17,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-05 20:29:17,870 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:17,870 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:29:17,875 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:29:18,071 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:29:18,071 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:18,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:18,072 INFO L85 PathProgramCache]: Analyzing trace with hash -261265623, now seen corresponding path program 1 times [2024-11-05 20:29:18,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:18,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1043678571] [2024-11-05 20:29:18,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:18,072 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:18,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:18,075 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:29:18,076 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:29:18,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:18,121 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-05 20:29:18,123 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:18,245 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-05 20:29:18,246 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:18,334 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-05 20:29:18,334 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:18,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1043678571] [2024-11-05 20:29:18,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1043678571] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:29:18,334 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:29:18,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2024-11-05 20:29:18,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098339817] [2024-11-05 20:29:18,335 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:29:18,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-05 20:29:18,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:18,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-05 20:29:18,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-05 20:29:18,336 INFO L87 Difference]: Start difference. First operand 291 states and 396 transitions. Second operand has 10 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-05 20:29:19,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:19,264 INFO L93 Difference]: Finished difference Result 297 states and 401 transitions. [2024-11-05 20:29:19,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-05 20:29:19,264 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2024-11-05 20:29:19,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:19,266 INFO L225 Difference]: With dead ends: 297 [2024-11-05 20:29:19,266 INFO L226 Difference]: Without dead ends: 295 [2024-11-05 20:29:19,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-05 20:29:19,267 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 3 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:19,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 640 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-05 20:29:19,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-11-05 20:29:19,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2024-11-05 20:29:19,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 267 states have (on average 1.299625468164794) internal successors, (347), 265 states have internal predecessors, (347), 23 states have call successors, (23), 3 states have call predecessors, (23), 4 states have return successors, (29), 29 states have call predecessors, (29), 22 states have call successors, (29) [2024-11-05 20:29:19,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 399 transitions. [2024-11-05 20:29:19,292 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 399 transitions. Word has length 44 [2024-11-05 20:29:19,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:19,292 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 399 transitions. [2024-11-05 20:29:19,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-05 20:29:19,292 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 399 transitions. [2024-11-05 20:29:19,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-05 20:29:19,295 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:19,295 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:29:19,299 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:29:19,498 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:29:19,498 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:19,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:19,499 INFO L85 PathProgramCache]: Analyzing trace with hash 561980754, now seen corresponding path program 1 times [2024-11-05 20:29:19,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:19,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1854621120] [2024-11-05 20:29:19,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:19,499 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:19,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:19,500 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:29:19,501 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:29:19,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:19,551 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-05 20:29:19,553 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:19,579 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-05 20:29:19,579 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:19,619 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-05 20:29:19,620 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:19,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1854621120] [2024-11-05 20:29:19,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1854621120] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:29:19,620 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:29:19,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2024-11-05 20:29:19,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436307619] [2024-11-05 20:29:19,620 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:29:19,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 20:29:19,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:19,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 20:29:19,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-05 20:29:19,621 INFO L87 Difference]: Start difference. First operand 295 states and 399 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-05 20:29:19,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:19,677 INFO L93 Difference]: Finished difference Result 631 states and 850 transitions. [2024-11-05 20:29:19,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-05 20:29:19,678 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2024-11-05 20:29:19,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:19,681 INFO L225 Difference]: With dead ends: 631 [2024-11-05 20:29:19,682 INFO L226 Difference]: Without dead ends: 579 [2024-11-05 20:29:19,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-05 20:29:19,684 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 56 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:19,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 394 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 20:29:19,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2024-11-05 20:29:19,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 314. [2024-11-05 20:29:19,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 285 states have (on average 1.3017543859649123) internal successors, (371), 282 states have internal predecessors, (371), 24 states have call successors, (24), 3 states have call predecessors, (24), 4 states have return successors, (30), 30 states have call predecessors, (30), 23 states have call successors, (30) [2024-11-05 20:29:19,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 425 transitions. [2024-11-05 20:29:19,709 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 425 transitions. Word has length 45 [2024-11-05 20:29:19,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:19,709 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 425 transitions. [2024-11-05 20:29:19,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-05 20:29:19,709 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 425 transitions. [2024-11-05 20:29:19,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-05 20:29:19,710 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:19,710 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:29:19,714 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 (11)] Ended with exit code 0 [2024-11-05 20:29:19,911 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:29:19,911 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:19,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:19,912 INFO L85 PathProgramCache]: Analyzing trace with hash 2079579127, now seen corresponding path program 1 times [2024-11-05 20:29:19,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:19,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1373266635] [2024-11-05 20:29:19,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:19,912 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:19,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:19,913 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:29:19,914 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:29:19,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:19,960 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-05 20:29:19,962 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:19,975 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-05 20:29:19,976 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:19,992 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-05 20:29:19,992 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:19,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1373266635] [2024-11-05 20:29:19,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1373266635] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:29:19,992 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:29:19,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2024-11-05 20:29:19,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482270346] [2024-11-05 20:29:19,993 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:29:19,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 20:29:19,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:19,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 20:29:19,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-05 20:29:19,994 INFO L87 Difference]: Start difference. First operand 314 states and 425 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-05 20:29:20,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:20,012 INFO L93 Difference]: Finished difference Result 329 states and 441 transitions. [2024-11-05 20:29:20,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 20:29:20,013 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2024-11-05 20:29:20,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:20,015 INFO L225 Difference]: With dead ends: 329 [2024-11-05 20:29:20,015 INFO L226 Difference]: Without dead ends: 268 [2024-11-05 20:29:20,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-05 20:29:20,016 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:20,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 288 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 20:29:20,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-11-05 20:29:20,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2024-11-05 20:29:20,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 239 states have (on average 1.3138075313807531) internal successors, (314), 238 states have internal predecessors, (314), 24 states have call successors, (24), 3 states have call predecessors, (24), 4 states have return successors, (28), 28 states have call predecessors, (28), 23 states have call successors, (28) [2024-11-05 20:29:20,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 366 transitions. [2024-11-05 20:29:20,031 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 366 transitions. Word has length 48 [2024-11-05 20:29:20,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:20,032 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 366 transitions. [2024-11-05 20:29:20,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-05 20:29:20,032 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 366 transitions. [2024-11-05 20:29:20,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-05 20:29:20,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:20,033 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:29:20,038 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 (12)] Forceful destruction successful, exit code 0 [2024-11-05 20:29:20,234 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:29:20,234 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:20,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:20,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1609971577, now seen corresponding path program 1 times [2024-11-05 20:29:20,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:20,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1337595438] [2024-11-05 20:29:20,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:20,235 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:20,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:20,237 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:29:20,238 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:29:20,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:20,286 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-05 20:29:20,288 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:20,315 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-05 20:29:20,315 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:20,346 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-05 20:29:20,347 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:20,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1337595438] [2024-11-05 20:29:20,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1337595438] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:29:20,347 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:29:20,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2024-11-05 20:29:20,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328647973] [2024-11-05 20:29:20,347 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:29:20,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-05 20:29:20,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:20,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-05 20:29:20,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-05 20:29:20,348 INFO L87 Difference]: Start difference. First operand 268 states and 366 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-05 20:29:20,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:20,458 INFO L93 Difference]: Finished difference Result 336 states and 461 transitions. [2024-11-05 20:29:20,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 20:29:20,459 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2024-11-05 20:29:20,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:20,461 INFO L225 Difference]: With dead ends: 336 [2024-11-05 20:29:20,461 INFO L226 Difference]: Without dead ends: 294 [2024-11-05 20:29:20,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-05 20:29:20,462 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 50 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:20,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 447 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 20:29:20,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-11-05 20:29:20,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 268. [2024-11-05 20:29:20,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 239 states have (on average 1.3054393305439331) internal successors, (312), 238 states have internal predecessors, (312), 24 states have call successors, (24), 3 states have call predecessors, (24), 4 states have return successors, (28), 28 states have call predecessors, (28), 23 states have call successors, (28) [2024-11-05 20:29:20,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 364 transitions. [2024-11-05 20:29:20,480 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 364 transitions. Word has length 49 [2024-11-05 20:29:20,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:20,481 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 364 transitions. [2024-11-05 20:29:20,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-05 20:29:20,481 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 364 transitions. [2024-11-05 20:29:20,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-05 20:29:20,482 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:20,483 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:29:20,488 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:29:20,685 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:29:20,686 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:20,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:20,686 INFO L85 PathProgramCache]: Analyzing trace with hash -908906999, now seen corresponding path program 1 times [2024-11-05 20:29:20,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:20,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1405835301] [2024-11-05 20:29:20,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:20,687 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:20,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:20,688 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:29:20,688 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:29:20,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:20,733 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 20:29:20,734 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:20,751 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-05 20:29:20,751 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:20,769 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-05 20:29:20,770 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:20,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1405835301] [2024-11-05 20:29:20,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1405835301] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:29:20,770 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:29:20,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2024-11-05 20:29:20,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336911466] [2024-11-05 20:29:20,770 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:29:20,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 20:29:20,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:20,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 20:29:20,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-05 20:29:20,771 INFO L87 Difference]: Start difference. First operand 268 states and 364 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-05 20:29:20,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:20,850 INFO L93 Difference]: Finished difference Result 383 states and 514 transitions. [2024-11-05 20:29:20,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 20:29:20,851 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2024-11-05 20:29:20,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:20,853 INFO L225 Difference]: With dead ends: 383 [2024-11-05 20:29:20,853 INFO L226 Difference]: Without dead ends: 349 [2024-11-05 20:29:20,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-05 20:29:20,854 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 40 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:20,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 313 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 20:29:20,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-11-05 20:29:20,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 276. [2024-11-05 20:29:20,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 247 states have (on average 1.2995951417004048) internal successors, (321), 246 states have internal predecessors, (321), 24 states have call successors, (24), 3 states have call predecessors, (24), 4 states have return successors, (28), 28 states have call predecessors, (28), 23 states have call successors, (28) [2024-11-05 20:29:20,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 373 transitions. [2024-11-05 20:29:20,868 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 373 transitions. Word has length 49 [2024-11-05 20:29:20,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:20,869 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 373 transitions. [2024-11-05 20:29:20,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-05 20:29:20,869 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 373 transitions. [2024-11-05 20:29:20,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-05 20:29:20,870 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:20,870 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:29:20,874 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 (14)] Ended with exit code 0 [2024-11-05 20:29:21,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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:29:21,071 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:21,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:21,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1552744902, now seen corresponding path program 1 times [2024-11-05 20:29:21,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:21,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1720972315] [2024-11-05 20:29:21,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:21,072 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:21,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:21,073 INFO L229 MonitoredProcess]: Starting monitored process 15 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:21,074 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 (15)] Waiting until timeout for monitored process [2024-11-05 20:29:21,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:21,129 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-05 20:29:21,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:21,180 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-05 20:29:21,180 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:21,302 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-05 20:29:21,302 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:21,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1720972315] [2024-11-05 20:29:21,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1720972315] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:29:21,303 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:29:21,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2024-11-05 20:29:21,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253277595] [2024-11-05 20:29:21,303 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:29:21,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-05 20:29:21,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:21,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-05 20:29:21,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-05 20:29:21,304 INFO L87 Difference]: Start difference. First operand 276 states and 373 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-05 20:29:21,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:21,819 INFO L93 Difference]: Finished difference Result 413 states and 561 transitions. [2024-11-05 20:29:21,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-05 20:29:21,819 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2024-11-05 20:29:21,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:21,821 INFO L225 Difference]: With dead ends: 413 [2024-11-05 20:29:21,821 INFO L226 Difference]: Without dead ends: 389 [2024-11-05 20:29:21,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2024-11-05 20:29:21,822 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 71 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:21,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 678 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-05 20:29:21,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-11-05 20:29:21,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 335. [2024-11-05 20:29:21,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 298 states have (on average 1.2953020134228188) internal successors, (386), 299 states have internal predecessors, (386), 32 states have call successors, (32), 3 states have call predecessors, (32), 4 states have return successors, (36), 36 states have call predecessors, (36), 31 states have call successors, (36) [2024-11-05 20:29:21,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 454 transitions. [2024-11-05 20:29:21,837 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 454 transitions. Word has length 50 [2024-11-05 20:29:21,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:21,837 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 454 transitions. [2024-11-05 20:29:21,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-05 20:29:21,837 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 454 transitions. [2024-11-05 20:29:21,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-05 20:29:21,838 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:21,838 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:29:21,844 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 (15)] Forceful destruction successful, exit code 0 [2024-11-05 20:29:22,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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:29:22,042 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:22,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:22,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1182826734, now seen corresponding path program 1 times [2024-11-05 20:29:22,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:22,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [806957159] [2024-11-05 20:29:22,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:22,043 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:22,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:22,046 INFO L229 MonitoredProcess]: Starting monitored process 16 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:22,047 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 (16)] Waiting until timeout for monitored process [2024-11-05 20:29:22,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:22,101 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-05 20:29:22,102 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:22,129 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-05 20:29:22,129 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:22,170 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-05 20:29:22,171 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:22,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [806957159] [2024-11-05 20:29:22,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [806957159] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:29:22,171 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:29:22,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2024-11-05 20:29:22,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466487666] [2024-11-05 20:29:22,171 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:29:22,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 20:29:22,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:22,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 20:29:22,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-05 20:29:22,172 INFO L87 Difference]: Start difference. First operand 335 states and 454 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-05 20:29:22,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:22,219 INFO L93 Difference]: Finished difference Result 376 states and 507 transitions. [2024-11-05 20:29:22,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 20:29:22,220 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2024-11-05 20:29:22,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:22,222 INFO L225 Difference]: With dead ends: 376 [2024-11-05 20:29:22,222 INFO L226 Difference]: Without dead ends: 339 [2024-11-05 20:29:22,224 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-05 20:29:22,224 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 54 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:22,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 321 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 20:29:22,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2024-11-05 20:29:22,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2024-11-05 20:29:22,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 302 states have (on average 1.2582781456953642) internal successors, (380), 303 states have internal predecessors, (380), 32 states have call successors, (32), 3 states have call predecessors, (32), 4 states have return successors, (36), 36 states have call predecessors, (36), 31 states have call successors, (36) [2024-11-05 20:29:22,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 448 transitions. [2024-11-05 20:29:22,241 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 448 transitions. Word has length 50 [2024-11-05 20:29:22,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:22,241 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 448 transitions. [2024-11-05 20:29:22,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-05 20:29:22,241 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 448 transitions. [2024-11-05 20:29:22,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-05 20:29:22,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:22,243 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:29:22,247 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 (16)] Forceful destruction successful, exit code 0 [2024-11-05 20:29:22,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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:29:22,443 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:22,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:22,444 INFO L85 PathProgramCache]: Analyzing trace with hash -767329765, now seen corresponding path program 1 times [2024-11-05 20:29:22,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:22,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [785823271] [2024-11-05 20:29:22,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:22,444 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:22,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:22,447 INFO L229 MonitoredProcess]: Starting monitored process 17 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:22,449 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 (17)] Waiting until timeout for monitored process [2024-11-05 20:29:22,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:22,493 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-05 20:29:22,494 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:22,514 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-05 20:29:22,515 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:22,558 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-05 20:29:22,558 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:22,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [785823271] [2024-11-05 20:29:22,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [785823271] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 20:29:22,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 20:29:22,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2024-11-05 20:29:22,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219374626] [2024-11-05 20:29:22,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 20:29:22,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 20:29:22,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:22,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 20:29:22,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-05 20:29:22,560 INFO L87 Difference]: Start difference. First operand 339 states and 448 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-05 20:29:22,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:22,632 INFO L93 Difference]: Finished difference Result 562 states and 740 transitions. [2024-11-05 20:29:22,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-05 20:29:22,633 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 50 [2024-11-05 20:29:22,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:22,635 INFO L225 Difference]: With dead ends: 562 [2024-11-05 20:29:22,635 INFO L226 Difference]: Without dead ends: 226 [2024-11-05 20:29:22,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-05 20:29:22,636 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 26 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:22,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 246 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 20:29:22,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-05 20:29:22,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 214. [2024-11-05 20:29:22,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 185 states have (on average 1.2216216216216216) internal successors, (226), 190 states have internal predecessors, (226), 23 states have call successors, (23), 3 states have call predecessors, (23), 5 states have return successors, (26), 24 states have call predecessors, (26), 22 states have call successors, (26) [2024-11-05 20:29:22,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 275 transitions. [2024-11-05 20:29:22,649 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 275 transitions. Word has length 50 [2024-11-05 20:29:22,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:22,649 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 275 transitions. [2024-11-05 20:29:22,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-05 20:29:22,650 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 275 transitions. [2024-11-05 20:29:22,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-05 20:29:22,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:22,650 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:29:22,654 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 (17)] Forceful destruction successful, exit code 0 [2024-11-05 20:29:22,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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:29:22,853 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:22,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:22,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1332385442, now seen corresponding path program 1 times [2024-11-05 20:29:22,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:22,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [795082882] [2024-11-05 20:29:22,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:22,854 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:22,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:22,855 INFO L229 MonitoredProcess]: Starting monitored process 18 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:22,856 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 (18)] Waiting until timeout for monitored process [2024-11-05 20:29:22,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:22,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-05 20:29:22,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:22,917 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-05 20:29:22,917 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:22,931 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-05 20:29:22,932 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:22,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [795082882] [2024-11-05 20:29:22,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [795082882] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:29:22,932 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:29:22,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2024-11-05 20:29:22,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047505570] [2024-11-05 20:29:22,932 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:29:22,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 20:29:22,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:22,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 20:29:22,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-05 20:29:22,934 INFO L87 Difference]: Start difference. First operand 214 states and 275 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-05 20:29:22,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:22,951 INFO L93 Difference]: Finished difference Result 223 states and 283 transitions. [2024-11-05 20:29:22,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 20:29:22,952 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2024-11-05 20:29:22,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:22,953 INFO L225 Difference]: With dead ends: 223 [2024-11-05 20:29:22,953 INFO L226 Difference]: Without dead ends: 182 [2024-11-05 20:29:22,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-05 20:29:22,954 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:22,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 279 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 20:29:22,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-11-05 20:29:22,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 176. [2024-11-05 20:29:22,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 150 states have (on average 1.2333333333333334) internal successors, (185), 156 states have internal predecessors, (185), 20 states have call successors, (20), 3 states have call predecessors, (20), 5 states have return successors, (20), 19 states have call predecessors, (20), 18 states have call successors, (20) [2024-11-05 20:29:22,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 225 transitions. [2024-11-05 20:29:22,964 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 225 transitions. Word has length 52 [2024-11-05 20:29:22,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:22,964 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 225 transitions. [2024-11-05 20:29:22,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-05 20:29:22,964 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 225 transitions. [2024-11-05 20:29:22,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-05 20:29:22,965 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:22,965 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:29:22,969 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 (18)] Forceful destruction successful, exit code 0 [2024-11-05 20:29:23,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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:29:23,166 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:23,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:23,166 INFO L85 PathProgramCache]: Analyzing trace with hash -444512686, now seen corresponding path program 1 times [2024-11-05 20:29:23,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:23,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2067291244] [2024-11-05 20:29:23,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:23,167 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:23,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:23,170 INFO L229 MonitoredProcess]: Starting monitored process 19 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:23,171 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 (19)] Waiting until timeout for monitored process [2024-11-05 20:29:23,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:23,228 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-05 20:29:23,229 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:23,270 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-05 20:29:23,270 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:23,351 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-05 20:29:23,351 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:23,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2067291244] [2024-11-05 20:29:23,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2067291244] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:29:23,351 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:29:23,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2024-11-05 20:29:23,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909031345] [2024-11-05 20:29:23,352 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:29:23,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-05 20:29:23,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:23,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-05 20:29:23,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-05 20:29:23,353 INFO L87 Difference]: Start difference. First operand 176 states and 225 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-05 20:29:23,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:23,615 INFO L93 Difference]: Finished difference Result 242 states and 308 transitions. [2024-11-05 20:29:23,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-05 20:29:23,616 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2024-11-05 20:29:23,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:23,617 INFO L225 Difference]: With dead ends: 242 [2024-11-05 20:29:23,617 INFO L226 Difference]: Without dead ends: 192 [2024-11-05 20:29:23,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-11-05 20:29:23,618 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 54 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:23,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 411 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 20:29:23,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-05 20:29:23,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 159. [2024-11-05 20:29:23,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 134 states have (on average 1.2164179104477613) internal successors, (163), 138 states have internal predecessors, (163), 20 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-05 20:29:23,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 201 transitions. [2024-11-05 20:29:23,628 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 201 transitions. Word has length 52 [2024-11-05 20:29:23,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:23,629 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 201 transitions. [2024-11-05 20:29:23,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-05 20:29:23,629 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 201 transitions. [2024-11-05 20:29:23,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-05 20:29:23,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:23,630 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:29:23,633 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 (19)] Forceful destruction successful, exit code 0 [2024-11-05 20:29:23,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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:29:23,833 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:23,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:23,833 INFO L85 PathProgramCache]: Analyzing trace with hash -71376074, now seen corresponding path program 1 times [2024-11-05 20:29:23,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:23,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1550270117] [2024-11-05 20:29:23,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:23,834 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:23,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:23,837 INFO L229 MonitoredProcess]: Starting monitored process 20 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:23,838 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 (20)] Waiting until timeout for monitored process [2024-11-05 20:29:23,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:23,891 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-05 20:29:23,893 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:24,088 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-05 20:29:24,088 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:24,297 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-05 20:29:24,297 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:24,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1550270117] [2024-11-05 20:29:24,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1550270117] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:29:24,308 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:29:24,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 14 [2024-11-05 20:29:24,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976057498] [2024-11-05 20:29:24,309 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:29:24,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-05 20:29:24,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:24,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-05 20:29:24,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-05 20:29:24,310 INFO L87 Difference]: Start difference. First operand 159 states and 201 transitions. Second operand has 14 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 5 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-05 20:29:24,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:24,456 INFO L93 Difference]: Finished difference Result 169 states and 212 transitions. [2024-11-05 20:29:24,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-05 20:29:24,457 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 5 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 54 [2024-11-05 20:29:24,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:24,458 INFO L225 Difference]: With dead ends: 169 [2024-11-05 20:29:24,458 INFO L226 Difference]: Without dead ends: 167 [2024-11-05 20:29:24,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2024-11-05 20:29:24,459 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 15 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:24,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 552 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 20:29:24,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-05 20:29:24,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 163. [2024-11-05 20:29:24,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 137 states have (on average 1.2116788321167884) internal successors, (166), 141 states have internal predecessors, (166), 20 states have call successors, (20), 4 states have call predecessors, (20), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-05 20:29:24,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 204 transitions. [2024-11-05 20:29:24,472 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 204 transitions. Word has length 54 [2024-11-05 20:29:24,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:24,472 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 204 transitions. [2024-11-05 20:29:24,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 5 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-05 20:29:24,473 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 204 transitions. [2024-11-05 20:29:24,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-05 20:29:24,473 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:24,474 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:29:24,478 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 (20)] Forceful destruction successful, exit code 0 [2024-11-05 20:29:24,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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:29:24,677 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:24,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:24,677 INFO L85 PathProgramCache]: Analyzing trace with hash 589240327, now seen corresponding path program 1 times [2024-11-05 20:29:24,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:24,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1997732198] [2024-11-05 20:29:24,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:24,678 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:24,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:24,681 INFO L229 MonitoredProcess]: Starting monitored process 21 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:24,683 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 (21)] Waiting until timeout for monitored process [2024-11-05 20:29:24,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:24,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-05 20:29:24,743 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:24,776 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-05 20:29:24,777 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:24,836 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-05 20:29:24,836 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:24,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1997732198] [2024-11-05 20:29:24,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1997732198] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:29:24,837 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:29:24,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2024-11-05 20:29:24,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173081086] [2024-11-05 20:29:24,837 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:29:24,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-05 20:29:24,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:24,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-05 20:29:24,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-05 20:29:24,839 INFO L87 Difference]: Start difference. First operand 163 states and 204 transitions. Second operand has 10 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 20:29:24,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:24,908 INFO L93 Difference]: Finished difference Result 192 states and 234 transitions. [2024-11-05 20:29:24,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-05 20:29:24,909 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 60 [2024-11-05 20:29:24,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:24,910 INFO L225 Difference]: With dead ends: 192 [2024-11-05 20:29:24,910 INFO L226 Difference]: Without dead ends: 190 [2024-11-05 20:29:24,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-05 20:29:24,911 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 27 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:24,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 686 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 20:29:24,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-05 20:29:24,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 167. [2024-11-05 20:29:24,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 140 states have (on average 1.207142857142857) internal successors, (169), 144 states have internal predecessors, (169), 20 states have call successors, (20), 5 states have call predecessors, (20), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-05 20:29:24,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 207 transitions. [2024-11-05 20:29:24,926 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 207 transitions. Word has length 60 [2024-11-05 20:29:24,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:24,926 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 207 transitions. [2024-11-05 20:29:24,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 20:29:24,927 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 207 transitions. [2024-11-05 20:29:24,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-05 20:29:24,927 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:24,928 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:29:24,933 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 (21)] Ended with exit code 0 [2024-11-05 20:29:25,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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:29:25,131 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:25,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:25,132 INFO L85 PathProgramCache]: Analyzing trace with hash 921322142, now seen corresponding path program 1 times [2024-11-05 20:29:25,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:25,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1310402847] [2024-11-05 20:29:25,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:25,132 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:25,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:25,136 INFO L229 MonitoredProcess]: Starting monitored process 22 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:25,137 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 (22)] Waiting until timeout for monitored process [2024-11-05 20:29:25,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:25,199 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-05 20:29:25,202 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:26,169 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-05 20:29:26,169 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:27,175 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-05 20:29:27,175 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:27,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1310402847] [2024-11-05 20:29:27,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1310402847] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:29:27,176 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:29:27,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13, 13] imperfect sequences [] total 24 [2024-11-05 20:29:27,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038652072] [2024-11-05 20:29:27,176 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:29:27,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-05 20:29:27,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:27,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-05 20:29:27,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2024-11-05 20:29:27,177 INFO L87 Difference]: Start difference. First operand 167 states and 207 transitions. Second operand has 24 states, 24 states have (on average 2.25) internal successors, (54), 24 states have internal predecessors, (54), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-05 20:29:34,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:34,892 INFO L93 Difference]: Finished difference Result 269 states and 337 transitions. [2024-11-05 20:29:34,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-05 20:29:34,893 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.25) internal successors, (54), 24 states have internal predecessors, (54), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 65 [2024-11-05 20:29:34,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:34,894 INFO L225 Difference]: With dead ends: 269 [2024-11-05 20:29:34,894 INFO L226 Difference]: Without dead ends: 233 [2024-11-05 20:29:34,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=183, Invalid=1457, Unknown=0, NotChecked=0, Total=1640 [2024-11-05 20:29:34,896 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 58 mSDsluCounter, 1090 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 1183 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:34,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 1183 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-11-05 20:29:34,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-05 20:29:34,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 198. [2024-11-05 20:29:34,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 167 states have (on average 1.2095808383233533) internal successors, (202), 172 states have internal predecessors, (202), 24 states have call successors, (24), 5 states have call predecessors, (24), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-05 20:29:34,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 248 transitions. [2024-11-05 20:29:34,910 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 248 transitions. Word has length 65 [2024-11-05 20:29:34,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:34,910 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 248 transitions. [2024-11-05 20:29:34,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.25) internal successors, (54), 24 states have internal predecessors, (54), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-05 20:29:34,911 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 248 transitions. [2024-11-05 20:29:34,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-05 20:29:34,911 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:34,912 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:29:34,915 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 (22)] Forceful destruction successful, exit code 0 [2024-11-05 20:29:35,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /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:29:35,112 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:35,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:35,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1450417120, now seen corresponding path program 1 times [2024-11-05 20:29:35,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:35,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [990038775] [2024-11-05 20:29:35,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:35,113 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:35,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:35,116 INFO L229 MonitoredProcess]: Starting monitored process 23 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:35,118 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 (23)] Waiting until timeout for monitored process [2024-11-05 20:29:35,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:35,186 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-05 20:29:35,187 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:35,547 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-05 20:29:35,547 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:36,065 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-05 20:29:36,065 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:36,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [990038775] [2024-11-05 20:29:36,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [990038775] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:29:36,065 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:29:36,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 18 [2024-11-05 20:29:36,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230848667] [2024-11-05 20:29:36,066 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:29:36,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-05 20:29:36,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:36,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-05 20:29:36,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2024-11-05 20:29:36,067 INFO L87 Difference]: Start difference. First operand 198 states and 248 transitions. Second operand has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-05 20:29:40,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-05 20:29:45,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-05 20:29:47,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:47,218 INFO L93 Difference]: Finished difference Result 265 states and 328 transitions. [2024-11-05 20:29:47,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-05 20:29:47,219 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 65 [2024-11-05 20:29:47,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:47,220 INFO L225 Difference]: With dead ends: 265 [2024-11-05 20:29:47,220 INFO L226 Difference]: Without dead ends: 237 [2024-11-05 20:29:47,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=217, Invalid=1115, Unknown=0, NotChecked=0, Total=1332 [2024-11-05 20:29:47,221 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 67 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 23 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:47,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 675 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 547 Invalid, 2 Unknown, 0 Unchecked, 9.8s Time] [2024-11-05 20:29:47,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-05 20:29:47,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 161. [2024-11-05 20:29:47,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 136 states have (on average 1.1985294117647058) internal successors, (163), 141 states have internal predecessors, (163), 18 states have call successors, (18), 5 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-05 20:29:47,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 197 transitions. [2024-11-05 20:29:47,236 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 197 transitions. Word has length 65 [2024-11-05 20:29:47,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:47,236 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 197 transitions. [2024-11-05 20:29:47,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-05 20:29:47,236 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 197 transitions. [2024-11-05 20:29:47,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-05 20:29:47,237 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:47,237 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:29:47,242 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 (23)] Ended with exit code 0 [2024-11-05 20:29:47,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /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:29:47,438 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:47,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:47,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1151744600, now seen corresponding path program 1 times [2024-11-05 20:29:47,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:47,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1220908152] [2024-11-05 20:29:47,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:47,439 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:47,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:47,442 INFO L229 MonitoredProcess]: Starting monitored process 24 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:47,443 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 (24)] Waiting until timeout for monitored process [2024-11-05 20:29:47,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:47,495 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-05 20:29:47,496 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:47,531 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-05 20:29:47,532 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:47,602 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-05 20:29:47,602 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:47,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1220908152] [2024-11-05 20:29:47,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1220908152] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:29:47,602 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:29:47,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2024-11-05 20:29:47,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090767114] [2024-11-05 20:29:47,602 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:29:47,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-05 20:29:47,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:47,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-05 20:29:47,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-05 20:29:47,604 INFO L87 Difference]: Start difference. First operand 161 states and 197 transitions. Second operand has 10 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-05 20:29:47,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:47,729 INFO L93 Difference]: Finished difference Result 181 states and 216 transitions. [2024-11-05 20:29:47,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-05 20:29:47,730 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 68 [2024-11-05 20:29:47,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:47,731 INFO L225 Difference]: With dead ends: 181 [2024-11-05 20:29:47,731 INFO L226 Difference]: Without dead ends: 155 [2024-11-05 20:29:47,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-05 20:29:47,732 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 13 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:47,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 666 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 20:29:47,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-05 20:29:47,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 144. [2024-11-05 20:29:47,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 120 states have (on average 1.1666666666666667) internal successors, (140), 125 states have internal predecessors, (140), 16 states have call successors, (16), 6 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-05 20:29:47,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 170 transitions. [2024-11-05 20:29:47,744 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 170 transitions. Word has length 68 [2024-11-05 20:29:47,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:47,744 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 170 transitions. [2024-11-05 20:29:47,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-05 20:29:47,744 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 170 transitions. [2024-11-05 20:29:47,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-05 20:29:47,745 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:47,745 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:29:47,749 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 (24)] Ended with exit code 0 [2024-11-05 20:29:47,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /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:29:47,946 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:47,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:47,946 INFO L85 PathProgramCache]: Analyzing trace with hash -550644062, now seen corresponding path program 1 times [2024-11-05 20:29:47,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:47,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2009152671] [2024-11-05 20:29:47,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:47,947 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:47,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:47,948 INFO L229 MonitoredProcess]: Starting monitored process 25 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:47,949 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 (25)] Waiting until timeout for monitored process [2024-11-05 20:29:48,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:48,007 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-05 20:29:48,009 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:48,047 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-05 20:29:48,047 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:48,110 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-05 20:29:48,110 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:48,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2009152671] [2024-11-05 20:29:48,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2009152671] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:29:48,110 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:29:48,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2024-11-05 20:29:48,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038165306] [2024-11-05 20:29:48,111 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:29:48,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 20:29:48,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:48,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 20:29:48,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-05 20:29:48,112 INFO L87 Difference]: Start difference. First operand 144 states and 170 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-05 20:29:48,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:48,145 INFO L93 Difference]: Finished difference Result 172 states and 198 transitions. [2024-11-05 20:29:48,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 20:29:48,146 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 69 [2024-11-05 20:29:48,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:48,147 INFO L225 Difference]: With dead ends: 172 [2024-11-05 20:29:48,147 INFO L226 Difference]: Without dead ends: 126 [2024-11-05 20:29:48,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-05 20:29:48,147 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 28 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:48,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 326 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 20:29:48,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-05 20:29:48,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 122. [2024-11-05 20:29:48,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 104 states have (on average 1.1346153846153846) internal successors, (118), 106 states have internal predecessors, (118), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-05 20:29:48,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 140 transitions. [2024-11-05 20:29:48,159 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 140 transitions. Word has length 69 [2024-11-05 20:29:48,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:48,160 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 140 transitions. [2024-11-05 20:29:48,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-05 20:29:48,160 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 140 transitions. [2024-11-05 20:29:48,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-05 20:29:48,162 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:48,162 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:29:48,166 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 (25)] Ended with exit code 0 [2024-11-05 20:29:48,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /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:29:48,363 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:48,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:48,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1500339936, now seen corresponding path program 1 times [2024-11-05 20:29:48,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:48,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2107682460] [2024-11-05 20:29:48,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:48,364 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:48,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:48,365 INFO L229 MonitoredProcess]: Starting monitored process 26 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:48,367 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 (26)] Waiting until timeout for monitored process [2024-11-05 20:29:48,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:48,423 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-05 20:29:48,425 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:48,645 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-05 20:29:48,645 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:49,003 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-05 20:29:49,003 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:49,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2107682460] [2024-11-05 20:29:49,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2107682460] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:29:49,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:29:49,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2024-11-05 20:29:49,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706802003] [2024-11-05 20:29:49,004 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:29:49,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-05 20:29:49,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:49,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-05 20:29:49,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2024-11-05 20:29:49,005 INFO L87 Difference]: Start difference. First operand 122 states and 140 transitions. Second operand has 18 states, 18 states have (on average 4.0) internal successors, (72), 16 states have internal predecessors, (72), 6 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-05 20:29:49,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:29:49,298 INFO L93 Difference]: Finished difference Result 135 states and 150 transitions. [2024-11-05 20:29:49,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-05 20:29:49,299 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.0) internal successors, (72), 16 states have internal predecessors, (72), 6 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) Word has length 69 [2024-11-05 20:29:49,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:29:49,300 INFO L225 Difference]: With dead ends: 135 [2024-11-05 20:29:49,300 INFO L226 Difference]: Without dead ends: 83 [2024-11-05 20:29:49,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2024-11-05 20:29:49,301 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 5 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 20:29:49,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 694 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 20:29:49,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-05 20:29:49,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-05 20:29:49,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 68 states have (on average 1.1323529411764706) internal successors, (77), 69 states have internal predecessors, (77), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-05 20:29:49,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 94 transitions. [2024-11-05 20:29:49,314 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 94 transitions. Word has length 69 [2024-11-05 20:29:49,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:29:49,315 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 94 transitions. [2024-11-05 20:29:49,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.0) internal successors, (72), 16 states have internal predecessors, (72), 6 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-05 20:29:49,315 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 94 transitions. [2024-11-05 20:29:49,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-05 20:29:49,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:29:49,316 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:29:49,322 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 (26)] Forceful destruction successful, exit code 0 [2024-11-05 20:29:49,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /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:29:49,516 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:29:49,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:29:49,517 INFO L85 PathProgramCache]: Analyzing trace with hash 438339121, now seen corresponding path program 1 times [2024-11-05 20:29:49,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:29:49,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1345627176] [2024-11-05 20:29:49,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:29:49,517 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:49,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:29:49,518 INFO L229 MonitoredProcess]: Starting monitored process 27 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:49,520 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 (27)] Waiting until timeout for monitored process [2024-11-05 20:29:49,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:29:49,581 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-05 20:29:49,582 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:50,293 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-05 20:29:50,293 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:29:51,056 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-05 20:29:51,056 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:29:51,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1345627176] [2024-11-05 20:29:51,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1345627176] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:29:51,057 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:29:51,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 11] imperfect sequences [] total 20 [2024-11-05 20:29:51,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731562769] [2024-11-05 20:29:51,057 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:29:51,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-05 20:29:51,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:29:51,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-05 20:29:51,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2024-11-05 20:29:51,059 INFO L87 Difference]: Start difference. First operand 83 states and 94 transitions. Second operand has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-05 20:29:55,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-05 20:30:00,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:30:00,826 INFO L93 Difference]: Finished difference Result 107 states and 122 transitions. [2024-11-05 20:30:00,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-05 20:30:00,827 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 73 [2024-11-05 20:30:00,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:30:00,828 INFO L225 Difference]: With dead ends: 107 [2024-11-05 20:30:00,828 INFO L226 Difference]: Without dead ends: 68 [2024-11-05 20:30:00,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=199, Invalid=1061, Unknown=0, NotChecked=0, Total=1260 [2024-11-05 20:30:00,829 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 33 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-11-05 20:30:00,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 649 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 445 Invalid, 1 Unknown, 0 Unchecked, 5.4s Time] [2024-11-05 20:30:00,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-05 20:30:00,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-05 20:30:00,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 56 states have internal predecessors, (61), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-05 20:30:00,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2024-11-05 20:30:00,838 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 73 [2024-11-05 20:30:00,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:30:00,838 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2024-11-05 20:30:00,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-05 20:30:00,838 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2024-11-05 20:30:00,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-05 20:30:00,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:30:00,839 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:30:00,843 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 (27)] Forceful destruction successful, exit code 0 [2024-11-05 20:30:01,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /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,043 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:30:01,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:30:01,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1423365133, now seen corresponding path program 1 times [2024-11-05 20:30:01,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:30:01,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [177907770] [2024-11-05 20:30:01,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:30:01,044 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,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:30:01,045 INFO L229 MonitoredProcess]: Starting monitored process 28 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,046 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 (28)] Waiting until timeout for monitored process [2024-11-05 20:30:01,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:30:01,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-05 20:30:01,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:30:02,387 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-05 20:30:02,388 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:30:04,086 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-05 20:30:04,086 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:30:04,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [177907770] [2024-11-05 20:30:04,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [177907770] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:30:04,086 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:30:04,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15, 13] imperfect sequences [] total 26 [2024-11-05 20:30:04,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58500953] [2024-11-05 20:30:04,086 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:30:04,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-05 20:30:04,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:30:04,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-05 20:30:04,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=475, Unknown=0, NotChecked=0, Total=650 [2024-11-05 20:30:04,088 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand has 26 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 26 states have internal predecessors, (62), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-05 20:30:04,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:30:04,836 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2024-11-05 20:30:04,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-05 20:30:04,836 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 26 states have internal predecessors, (62), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 74 [2024-11-05 20:30:04,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:30:04,837 INFO L225 Difference]: With dead ends: 75 [2024-11-05 20:30:04,837 INFO L226 Difference]: Without dead ends: 0 [2024-11-05 20:30:04,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=175, Invalid=475, Unknown=0, NotChecked=0, Total=650 [2024-11-05 20:30:04,838 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 8 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-05 20:30:04,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 419 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-05 20:30:04,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-05 20:30:04,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-05 20:30:04,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:30:04,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-05 20:30:04,839 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 74 [2024-11-05 20:30:04,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:30:04,839 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-05 20:30:04,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 26 states have internal predecessors, (62), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-05 20:30:04,839 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-05 20:30:04,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-05 20:30:04,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-05 20:30:04,846 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 (28)] Ended with exit code 0 [2024-11-05 20:30:05,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /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,045 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:30:05,047 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-05 20:30:11,376 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-05 20:30:11,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.11 08:30:11 BoogieIcfgContainer [2024-11-05 20:30:11,397 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-05 20:30:11,398 INFO L158 Benchmark]: Toolchain (without parser) took 59112.46ms. Allocated memory was 330.3MB in the beginning and 397.4MB in the end (delta: 67.1MB). Free memory was 277.5MB in the beginning and 207.9MB in the end (delta: 69.6MB). Peak memory consumption was 214.7MB. Max. memory is 8.0GB. [2024-11-05 20:30:11,398 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 208.7MB. Free memory is still 151.5MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-05 20:30:11,398 INFO L158 Benchmark]: CACSL2BoogieTranslator took 338.62ms. Allocated memory is still 330.3MB. Free memory was 277.5MB in the beginning and 261.1MB in the end (delta: 16.4MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2024-11-05 20:30:11,399 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.23ms. Allocated memory is still 330.3MB. Free memory was 261.1MB in the beginning and 259.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-05 20:30:11,400 INFO L158 Benchmark]: Boogie Preprocessor took 61.95ms. Allocated memory is still 330.3MB. Free memory was 259.0MB in the beginning and 256.6MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-11-05 20:30:11,400 INFO L158 Benchmark]: RCFGBuilder took 597.94ms. Allocated memory is still 330.3MB. Free memory was 256.6MB in the beginning and 237.0MB in the end (delta: 19.6MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2024-11-05 20:30:11,400 INFO L158 Benchmark]: TraceAbstraction took 58071.24ms. Allocated memory was 330.3MB in the beginning and 397.4MB in the end (delta: 67.1MB). Free memory was 236.3MB in the beginning and 207.9MB in the end (delta: 28.3MB). Peak memory consumption was 173.8MB. Max. memory is 8.0GB. [2024-11-05 20:30:11,401 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 208.7MB. Free memory is still 151.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 338.62ms. Allocated memory is still 330.3MB. Free memory was 277.5MB in the beginning and 261.1MB in the end (delta: 16.4MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.23ms. Allocated memory is still 330.3MB. Free memory was 261.1MB in the beginning and 259.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 61.95ms. Allocated memory is still 330.3MB. Free memory was 259.0MB in the beginning and 256.6MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 597.94ms. Allocated memory is still 330.3MB. Free memory was 256.6MB in the beginning and 237.0MB in the end (delta: 19.6MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 58071.24ms. Allocated memory was 330.3MB in the beginning and 397.4MB in the end (delta: 67.1MB). Free memory was 236.3MB in the beginning and 207.9MB in the end (delta: 28.3MB). Peak memory consumption was 173.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 18]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 72 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 51.6s, OverallIterations: 27, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 33.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 869 SdHoareTripleChecker+Valid, 23.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 799 mSDsluCounter, 14181 SdHoareTripleChecker+Invalid, 22.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11607 mSDsCounter, 146 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3911 IncrementalHoareTripleChecker+Invalid, 4060 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 146 mSolverCounterUnsat, 2574 mSDtfsCounter, 3911 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2837 GetRequests, 2532 SyntacticMatches, 2 SemanticMatches, 303 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 926 ImplicationChecksByTransitivity, 15.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=339occurred in iteration=15, InterpolantAutomatonStates: 249, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 27 MinimizatonAttempts, 711 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 10.7s InterpolantComputationTime, 1405 NumberOfCodeBlocks, 1405 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2756 ConstructedInterpolants, 117 QuantifiedInterpolants, 7558 SizeOfPredicates, 61 NumberOfNonLiveVariables, 2544 ConjunctsInSsa, 199 ConjunctsInUnsatCore, 54 InterpolantComputations, 44 PerfectInterpolantSequences, 1001/1058 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: (0 != \old(m)) - InvariantResult [Line: 58]: Loop Invariant Derived loop invariant: (0 != \old(m)) - ProcedureContractResult [Line: 25]: Procedure Contract for base2flt Derived contract for procedure base2flt. Ensures: ((0 != m) || (0 == \result)) - ProcedureContractResult [Line: 16]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (1 == cond) Ensures: (1 == cond) RESULT: Ultimate proved your program to be correct! [2024-11-05 20:30:11,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...