/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_2a.c.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-03 09:01:11,188 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-03 09:01:11,259 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-03 09:01:11,263 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-03 09:01:11,263 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-03 09:01:11,282 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-03 09:01:11,282 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-03 09:01:11,283 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-03 09:01:11,283 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-03 09:01:11,283 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-03 09:01:11,284 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-03 09:01:11,284 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-03 09:01:11,285 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-03 09:01:11,285 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-03 09:01:11,285 INFO L153 SettingsManager]: * Use SBE=true [2024-11-03 09:01:11,286 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-03 09:01:11,286 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-03 09:01:11,286 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-03 09:01:11,287 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-03 09:01:11,287 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-03 09:01:11,288 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-03 09:01:11,290 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-03 09:01:11,290 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-03 09:01:11,290 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-03 09:01:11,291 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-03 09:01:11,291 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-03 09:01:11,291 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-03 09:01:11,291 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-03 09:01:11,292 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-03 09:01:11,292 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-03 09:01:11,292 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-03 09:01:11,292 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-03 09:01:11,293 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-03 09:01:11,293 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-03 09:01:11,295 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-03 09:01:11,295 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-03 09:01:11,295 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-03 09:01:11,295 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-03 09:01:11,296 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-03 09:01:11,296 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-03 09:01:11,296 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-03 09:01:11,297 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-03 09:01:11,297 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-03 09:01:11,297 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-03 09:01:11,297 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-03 09:01:11,549 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-03 09:01:11,575 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-03 09:01:11,577 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-03 09:01:11,578 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-03 09:01:11,579 INFO L274 PluginConnector]: CDTParser initialized [2024-11-03 09:01:11,580 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/soft_float_2a.c.cil.c [2024-11-03 09:01:13,058 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-03 09:01:13,248 INFO L384 CDTParser]: Found 1 translation units. [2024-11-03 09:01:13,249 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/soft_float_2a.c.cil.c [2024-11-03 09:01:13,257 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ddbadca3/e8fef5a670334f359efac54b6f2d9d5b/FLAGb6061edd0 [2024-11-03 09:01:13,640 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ddbadca3/e8fef5a670334f359efac54b6f2d9d5b [2024-11-03 09:01:13,643 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-03 09:01:13,645 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-03 09:01:13,646 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-03 09:01:13,647 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-03 09:01:13,652 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-03 09:01:13,653 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 09:01:13" (1/1) ... [2024-11-03 09:01:13,654 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b6304a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:01:13, skipping insertion in model container [2024-11-03 09:01:13,654 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 09:01:13" (1/1) ... [2024-11-03 09:01:13,687 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-03 09:01:13,858 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_2a.c.cil.c[728,741] [2024-11-03 09:01:13,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-03 09:01:13,917 INFO L200 MainTranslator]: Completed pre-run [2024-11-03 09:01:13,928 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_2a.c.cil.c[728,741] [2024-11-03 09:01:13,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-03 09:01:13,973 INFO L204 MainTranslator]: Completed translation [2024-11-03 09:01:13,973 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:01:13 WrapperNode [2024-11-03 09:01:13,973 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-03 09:01:13,974 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-03 09:01:13,975 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-03 09:01:13,975 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-03 09:01:13,980 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:01:13" (1/1) ... [2024-11-03 09:01:13,987 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:01:13" (1/1) ... [2024-11-03 09:01:14,007 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 113 [2024-11-03 09:01:14,007 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-03 09:01:14,008 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-03 09:01:14,008 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-03 09:01:14,008 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-03 09:01:14,017 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:01:13" (1/1) ... [2024-11-03 09:01:14,017 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:01:13" (1/1) ... [2024-11-03 09:01:14,020 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:01:13" (1/1) ... [2024-11-03 09:01:14,031 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-03 09:01:14,031 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:01:13" (1/1) ... [2024-11-03 09:01:14,031 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:01:13" (1/1) ... [2024-11-03 09:01:14,039 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:01:13" (1/1) ... [2024-11-03 09:01:14,045 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:01:13" (1/1) ... [2024-11-03 09:01:14,047 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:01:13" (1/1) ... [2024-11-03 09:01:14,048 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:01:13" (1/1) ... [2024-11-03 09:01:14,051 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-03 09:01:14,052 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-03 09:01:14,052 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-03 09:01:14,052 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-03 09:01:14,053 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:01:13" (1/1) ... [2024-11-03 09:01:14,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-03 09:01:14,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-03 09:01:14,093 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-03 09:01:14,098 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-03 09:01:14,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-03 09:01:14,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-03 09:01:14,127 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-11-03 09:01:14,127 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-11-03 09:01:14,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-03 09:01:14,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-03 09:01:14,129 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-03 09:01:14,129 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-03 09:01:14,227 INFO L238 CfgBuilder]: Building ICFG [2024-11-03 09:01:14,230 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-03 09:01:14,641 INFO L? ?]: Removed 44 outVars from TransFormulas that were not future-live. [2024-11-03 09:01:14,641 INFO L287 CfgBuilder]: Performing block encoding [2024-11-03 09:01:14,660 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-03 09:01:14,661 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-03 09:01:14,661 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 09:01:14 BoogieIcfgContainer [2024-11-03 09:01:14,661 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-03 09:01:14,663 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-03 09:01:14,663 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-03 09:01:14,666 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-03 09:01:14,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 09:01:13" (1/3) ... [2024-11-03 09:01:14,667 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1db13c1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 09:01:14, skipping insertion in model container [2024-11-03 09:01:14,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:01:13" (2/3) ... [2024-11-03 09:01:14,667 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1db13c1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 09:01:14, skipping insertion in model container [2024-11-03 09:01:14,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 09:01:14" (3/3) ... [2024-11-03 09:01:14,669 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_2a.c.cil.c [2024-11-03 09:01:14,685 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-03 09:01:14,685 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-03 09:01:14,743 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-03 09:01:14,748 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;@42e47b1f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-03 09:01:14,748 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-03 09:01:14,752 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 43 states have (on average 1.558139534883721) internal successors, (67), 45 states have internal predecessors, (67), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-03 09:01:14,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-03 09:01:14,759 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:01:14,760 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 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-03 09:01:14,761 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:01:14,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:01:14,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1428146956, now seen corresponding path program 1 times [2024-11-03 09:01:14,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:01:14,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1519357093] [2024-11-03 09:01:14,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:01:14,799 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-03 09:01:14,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:01:14,804 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-03 09:01:14,807 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-03 09:01:14,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:01:14,938 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-03 09:01:14,945 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:01:15,042 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-03 09:01:15,042 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:01:15,146 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-03 09:01:15,147 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:01:15,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1519357093] [2024-11-03 09:01:15,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1519357093] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-03 09:01:15,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-03 09:01:15,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-11-03 09:01:15,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344687525] [2024-11-03 09:01:15,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-03 09:01:15,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-03 09:01:15,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:01:15,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-03 09:01:15,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-03 09:01:15,172 INFO L87 Difference]: Start difference. First operand has 52 states, 43 states have (on average 1.558139534883721) internal successors, (67), 45 states have internal predecessors, (67), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-03 09:01:15,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:01:15,307 INFO L93 Difference]: Finished difference Result 115 states and 181 transitions. [2024-11-03 09:01:15,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-03 09:01:15,310 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 42 [2024-11-03 09:01:15,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:01:15,318 INFO L225 Difference]: With dead ends: 115 [2024-11-03 09:01:15,318 INFO L226 Difference]: Without dead ends: 60 [2024-11-03 09:01:15,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-03 09:01:15,324 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 12 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-03 09:01:15,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 166 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-03 09:01:15,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-03 09:01:15,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 51. [2024-11-03 09:01:15,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 43 states have internal predecessors, (60), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-03 09:01:15,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 71 transitions. [2024-11-03 09:01:15,362 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 71 transitions. Word has length 42 [2024-11-03 09:01:15,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:01:15,362 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 71 transitions. [2024-11-03 09:01:15,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-03 09:01:15,362 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 71 transitions. [2024-11-03 09:01:15,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-03 09:01:15,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:01:15,367 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2024-11-03 09:01:15,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-03 09:01:15,568 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-03 09:01:15,568 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:01:15,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:01:15,569 INFO L85 PathProgramCache]: Analyzing trace with hash -649725496, now seen corresponding path program 1 times [2024-11-03 09:01:15,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:01:15,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2045249133] [2024-11-03 09:01:15,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:01:15,570 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-03 09:01:15,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:01:15,573 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-03 09:01:15,575 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-03 09:01:15,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:01:15,647 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-03 09:01:15,650 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:01:15,684 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-03 09:01:15,685 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:01:15,779 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-03 09:01:15,779 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:01:15,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2045249133] [2024-11-03 09:01:15,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2045249133] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-03 09:01:15,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-03 09:01:15,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-11-03 09:01:15,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942832928] [2024-11-03 09:01:15,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-03 09:01:15,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-03 09:01:15,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:01:15,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-03 09:01:15,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-03 09:01:15,783 INFO L87 Difference]: Start difference. First operand 51 states and 71 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-03 09:01:15,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:01:15,855 INFO L93 Difference]: Finished difference Result 104 states and 147 transitions. [2024-11-03 09:01:15,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-03 09:01:15,857 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 45 [2024-11-03 09:01:15,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:01:15,859 INFO L225 Difference]: With dead ends: 104 [2024-11-03 09:01:15,859 INFO L226 Difference]: Without dead ends: 60 [2024-11-03 09:01:15,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-03 09:01:15,862 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 7 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-03 09:01:15,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 160 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-03 09:01:15,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-03 09:01:15,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2024-11-03 09:01:15,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 48 states have internal predecessors, (65), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-03 09:01:15,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 78 transitions. [2024-11-03 09:01:15,878 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 78 transitions. Word has length 45 [2024-11-03 09:01:15,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:01:15,878 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 78 transitions. [2024-11-03 09:01:15,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-03 09:01:15,880 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 78 transitions. [2024-11-03 09:01:15,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-03 09:01:15,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:01:15,882 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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-03 09:01:15,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-03 09:01:16,082 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-03 09:01:16,083 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:01:16,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:01:16,084 INFO L85 PathProgramCache]: Analyzing trace with hash 996548609, now seen corresponding path program 1 times [2024-11-03 09:01:16,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:01:16,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1754497026] [2024-11-03 09:01:16,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:01:16,086 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-03 09:01:16,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:01:16,090 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-03 09:01:16,091 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-03 09:01:16,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:01:16,151 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-03 09:01:16,155 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:01:16,190 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-03 09:01:16,191 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:01:16,260 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-03 09:01:16,260 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:01:16,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1754497026] [2024-11-03 09:01:16,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1754497026] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-03 09:01:16,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-03 09:01:16,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-11-03 09:01:16,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734656128] [2024-11-03 09:01:16,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-03 09:01:16,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-03 09:01:16,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:01:16,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-03 09:01:16,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-03 09:01:16,263 INFO L87 Difference]: Start difference. First operand 56 states and 78 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, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-03 09:01:16,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:01:16,336 INFO L93 Difference]: Finished difference Result 116 states and 164 transitions. [2024-11-03 09:01:16,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-03 09:01:16,337 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, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2024-11-03 09:01:16,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:01:16,338 INFO L225 Difference]: With dead ends: 116 [2024-11-03 09:01:16,338 INFO L226 Difference]: Without dead ends: 67 [2024-11-03 09:01:16,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-03 09:01:16,340 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 16 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-03 09:01:16,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 165 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-03 09:01:16,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-03 09:01:16,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 57. [2024-11-03 09:01:16,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 48 states have (on average 1.375) internal successors, (66), 49 states have internal predecessors, (66), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-03 09:01:16,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 79 transitions. [2024-11-03 09:01:16,353 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 79 transitions. Word has length 46 [2024-11-03 09:01:16,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:01:16,354 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 79 transitions. [2024-11-03 09:01:16,354 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, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-03 09:01:16,354 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 79 transitions. [2024-11-03 09:01:16,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-03 09:01:16,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:01:16,357 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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-03 09:01:16,362 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-03 09:01:16,558 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-03 09:01:16,558 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:01:16,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:01:16,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1306691689, now seen corresponding path program 1 times [2024-11-03 09:01:16,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:01:16,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1877472075] [2024-11-03 09:01:16,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:01:16,559 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-03 09:01:16,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:01:16,562 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-03 09:01:16,563 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-03 09:01:16,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:01:16,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-03 09:01:16,618 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:01:16,663 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-03 09:01:16,663 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:01:16,776 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-03 09:01:16,776 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:01:16,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1877472075] [2024-11-03 09:01:16,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1877472075] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-03 09:01:16,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-03 09:01:16,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2024-11-03 09:01:16,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930517923] [2024-11-03 09:01:16,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-03 09:01:16,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-03 09:01:16,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:01:16,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-03 09:01:16,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-03 09:01:16,782 INFO L87 Difference]: Start difference. First operand 57 states and 79 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-03 09:01:16,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:01:16,925 INFO L93 Difference]: Finished difference Result 124 states and 175 transitions. [2024-11-03 09:01:16,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-03 09:01:16,926 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 47 [2024-11-03 09:01:16,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:01:16,927 INFO L225 Difference]: With dead ends: 124 [2024-11-03 09:01:16,927 INFO L226 Difference]: Without dead ends: 74 [2024-11-03 09:01:16,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-11-03 09:01:16,933 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 14 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-03 09:01:16,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 220 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-03 09:01:16,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-03 09:01:16,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 58. [2024-11-03 09:01:16,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 50 states have internal predecessors, (68), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-03 09:01:16,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 81 transitions. [2024-11-03 09:01:16,950 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 81 transitions. Word has length 47 [2024-11-03 09:01:16,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:01:16,950 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 81 transitions. [2024-11-03 09:01:16,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-03 09:01:16,951 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 81 transitions. [2024-11-03 09:01:16,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-03 09:01:16,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:01:16,952 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2024-11-03 09:01:16,957 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-03 09:01:17,153 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-03 09:01:17,153 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:01:17,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:01:17,155 INFO L85 PathProgramCache]: Analyzing trace with hash 164215198, now seen corresponding path program 1 times [2024-11-03 09:01:17,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:01:17,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1022161982] [2024-11-03 09:01:17,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:01:17,155 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-03 09:01:17,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:01:17,158 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-03 09:01:17,159 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-03 09:01:17,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:01:17,221 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-03 09:01:17,224 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:01:17,284 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-03 09:01:17,284 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:01:17,424 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-03 09:01:17,424 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:01:17,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1022161982] [2024-11-03 09:01:17,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1022161982] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 09:01:17,425 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 09:01:17,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-03 09:01:17,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875692198] [2024-11-03 09:01:17,425 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 09:01:17,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-03 09:01:17,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:01:17,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-03 09:01:17,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-03 09:01:17,428 INFO L87 Difference]: Start difference. First operand 58 states and 81 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-03 09:01:17,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:01:17,628 INFO L93 Difference]: Finished difference Result 133 states and 189 transitions. [2024-11-03 09:01:17,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-03 09:01:17,628 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 48 [2024-11-03 09:01:17,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:01:17,630 INFO L225 Difference]: With dead ends: 133 [2024-11-03 09:01:17,630 INFO L226 Difference]: Without dead ends: 82 [2024-11-03 09:01:17,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-11-03 09:01:17,631 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 18 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-03 09:01:17,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 367 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-03 09:01:17,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-03 09:01:17,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 66. [2024-11-03 09:01:17,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 58 states have internal predecessors, (81), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-03 09:01:17,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 94 transitions. [2024-11-03 09:01:17,647 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 94 transitions. Word has length 48 [2024-11-03 09:01:17,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:01:17,648 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 94 transitions. [2024-11-03 09:01:17,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-03 09:01:17,648 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 94 transitions. [2024-11-03 09:01:17,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-03 09:01:17,649 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:01:17,650 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 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-03 09:01:17,653 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-03 09:01:17,852 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-03 09:01:17,853 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:01:17,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:01:17,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1819650751, now seen corresponding path program 1 times [2024-11-03 09:01:17,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:01:17,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [756119240] [2024-11-03 09:01:17,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:01:17,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-03 09:01:17,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:01:17,855 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-03 09:01:17,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 (7)] Waiting until timeout for monitored process [2024-11-03 09:01:17,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:01:17,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-03 09:01:17,909 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:01:17,970 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 24 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-03 09:01:17,970 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:01:18,120 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-03 09:01:18,120 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:01:18,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [756119240] [2024-11-03 09:01:18,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [756119240] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 09:01:18,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 09:01:18,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-03 09:01:18,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751636692] [2024-11-03 09:01:18,121 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 09:01:18,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-03 09:01:18,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:01:18,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-03 09:01:18,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-03 09:01:18,123 INFO L87 Difference]: Start difference. First operand 66 states and 94 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-03 09:01:18,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:01:18,461 INFO L93 Difference]: Finished difference Result 163 states and 235 transitions. [2024-11-03 09:01:18,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-03 09:01:18,462 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 50 [2024-11-03 09:01:18,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:01:18,464 INFO L225 Difference]: With dead ends: 163 [2024-11-03 09:01:18,464 INFO L226 Difference]: Without dead ends: 104 [2024-11-03 09:01:18,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=129, Unknown=0, NotChecked=0, Total=210 [2024-11-03 09:01:18,466 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 73 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-03 09:01:18,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 332 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-03 09:01:18,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-03 09:01:18,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 70. [2024-11-03 09:01:18,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 61 states have (on average 1.4426229508196722) internal successors, (88), 62 states have internal predecessors, (88), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-03 09:01:18,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 101 transitions. [2024-11-03 09:01:18,479 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 101 transitions. Word has length 50 [2024-11-03 09:01:18,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:01:18,479 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 101 transitions. [2024-11-03 09:01:18,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-03 09:01:18,479 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 101 transitions. [2024-11-03 09:01:18,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-03 09:01:18,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:01:18,481 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 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] [2024-11-03 09:01:18,485 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-03 09:01:18,681 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-03 09:01:18,682 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:01:18,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:01:18,682 INFO L85 PathProgramCache]: Analyzing trace with hash -231695800, now seen corresponding path program 2 times [2024-11-03 09:01:18,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:01:18,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1221014947] [2024-11-03 09:01:18,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:01:18,683 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-03 09:01:18,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:01:18,684 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-03 09:01:18,685 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-03 09:01:18,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:01:18,737 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-03 09:01:18,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:01:18,856 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 24 proven. 26 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-03 09:01:18,857 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:01:19,165 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-03 09:01:19,166 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:01:19,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1221014947] [2024-11-03 09:01:19,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1221014947] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 09:01:19,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 09:01:19,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-03 09:01:19,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805840249] [2024-11-03 09:01:19,166 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 09:01:19,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-03 09:01:19,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:01:19,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-03 09:01:19,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-03 09:01:19,168 INFO L87 Difference]: Start difference. First operand 70 states and 101 transitions. Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-03 09:01:19,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:01:19,645 INFO L93 Difference]: Finished difference Result 168 states and 244 transitions. [2024-11-03 09:01:19,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-03 09:01:19,646 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 57 [2024-11-03 09:01:19,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:01:19,647 INFO L225 Difference]: With dead ends: 168 [2024-11-03 09:01:19,648 INFO L226 Difference]: Without dead ends: 105 [2024-11-03 09:01:19,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=117, Invalid=189, Unknown=0, NotChecked=0, Total=306 [2024-11-03 09:01:19,651 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 54 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-03 09:01:19,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 471 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-03 09:01:19,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-03 09:01:19,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 84. [2024-11-03 09:01:19,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 75 states have (on average 1.48) internal successors, (111), 76 states have internal predecessors, (111), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-03 09:01:19,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 124 transitions. [2024-11-03 09:01:19,673 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 124 transitions. Word has length 57 [2024-11-03 09:01:19,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:01:19,673 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 124 transitions. [2024-11-03 09:01:19,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-03 09:01:19,673 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 124 transitions. [2024-11-03 09:01:19,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-03 09:01:19,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:01:19,676 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 4, 4, 4, 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] [2024-11-03 09:01:19,680 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-03 09:01:19,876 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-03 09:01:19,877 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:01:19,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:01:19,877 INFO L85 PathProgramCache]: Analyzing trace with hash 932928063, now seen corresponding path program 2 times [2024-11-03 09:01:19,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:01:19,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1409768537] [2024-11-03 09:01:19,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:01:19,878 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-03 09:01:19,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:01:19,881 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-03 09:01:19,882 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-03 09:01:19,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:01:19,929 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-03 09:01:19,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:01:20,060 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 24 proven. 45 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-03 09:01:20,060 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:01:20,391 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 4 proven. 53 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-03 09:01:20,391 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:01:20,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1409768537] [2024-11-03 09:01:20,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1409768537] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 09:01:20,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 09:01:20,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2024-11-03 09:01:20,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198659687] [2024-11-03 09:01:20,392 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 09:01:20,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-03 09:01:20,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:01:20,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-03 09:01:20,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2024-11-03 09:01:20,394 INFO L87 Difference]: Start difference. First operand 84 states and 124 transitions. Second operand has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 18 states have internal predecessors, (73), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-03 09:01:21,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:01:21,299 INFO L93 Difference]: Finished difference Result 233 states and 343 transitions. [2024-11-03 09:01:21,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-03 09:01:21,301 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 18 states have internal predecessors, (73), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 62 [2024-11-03 09:01:21,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:01:21,302 INFO L225 Difference]: With dead ends: 233 [2024-11-03 09:01:21,302 INFO L226 Difference]: Without dead ends: 156 [2024-11-03 09:01:21,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=325, Invalid=605, Unknown=0, NotChecked=0, Total=930 [2024-11-03 09:01:21,307 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 199 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-03 09:01:21,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 792 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-03 09:01:21,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-03 09:01:21,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 94. [2024-11-03 09:01:21,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 85 states have (on average 1.5058823529411764) internal successors, (128), 86 states have internal predecessors, (128), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-03 09:01:21,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 141 transitions. [2024-11-03 09:01:21,330 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 141 transitions. Word has length 62 [2024-11-03 09:01:21,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:01:21,330 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 141 transitions. [2024-11-03 09:01:21,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 18 states have internal predecessors, (73), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-03 09:01:21,330 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 141 transitions. [2024-11-03 09:01:21,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-03 09:01:21,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:01:21,331 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 4, 4, 4, 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] [2024-11-03 09:01:21,336 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-03 09:01:21,532 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-03 09:01:21,533 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:01:21,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:01:21,534 INFO L85 PathProgramCache]: Analyzing trace with hash 467575560, now seen corresponding path program 3 times [2024-11-03 09:01:21,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:01:21,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1641096627] [2024-11-03 09:01:21,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:01:21,534 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-03 09:01:21,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:01:21,535 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-03 09:01:21,536 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-03 09:01:21,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:01:21,584 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-03 09:01:21,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:01:21,861 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 24 proven. 155 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-03 09:01:21,861 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:01:22,654 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 4 proven. 163 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-03 09:01:22,654 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:01:22,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1641096627] [2024-11-03 09:01:22,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1641096627] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 09:01:22,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 09:01:22,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-03 09:01:22,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68813969] [2024-11-03 09:01:22,655 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 09:01:22,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-03 09:01:22,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:01:22,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-03 09:01:22,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-03 09:01:22,659 INFO L87 Difference]: Start difference. First operand 94 states and 141 transitions. Second operand has 26 states, 26 states have (on average 3.8076923076923075) internal successors, (99), 26 states have internal predecessors, (99), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-03 09:01:24,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:01:24,229 INFO L93 Difference]: Finished difference Result 240 states and 356 transitions. [2024-11-03 09:01:24,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-03 09:01:24,229 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.8076923076923075) internal successors, (99), 26 states have internal predecessors, (99), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 75 [2024-11-03 09:01:24,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:01:24,231 INFO L225 Difference]: With dead ends: 240 [2024-11-03 09:01:24,231 INFO L226 Difference]: Without dead ends: 153 [2024-11-03 09:01:24,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=453, Invalid=807, Unknown=0, NotChecked=0, Total=1260 [2024-11-03 09:01:24,233 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 207 mSDsluCounter, 1105 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 1194 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-03 09:01:24,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 1194 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-03 09:01:24,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-03 09:01:24,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 120. [2024-11-03 09:01:24,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 111 states have (on average 1.5405405405405406) internal successors, (171), 112 states have internal predecessors, (171), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-03 09:01:24,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 184 transitions. [2024-11-03 09:01:24,255 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 184 transitions. Word has length 75 [2024-11-03 09:01:24,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:01:24,256 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 184 transitions. [2024-11-03 09:01:24,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.8076923076923075) internal successors, (99), 26 states have internal predecessors, (99), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-03 09:01:24,256 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 184 transitions. [2024-11-03 09:01:24,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-03 09:01:24,261 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:01:24,261 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 13, 4, 4, 4, 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] [2024-11-03 09:01:24,266 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-03 09:01:24,462 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-03 09:01:24,462 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:01:24,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:01:24,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1327823167, now seen corresponding path program 3 times [2024-11-03 09:01:24,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:01:24,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [697318923] [2024-11-03 09:01:24,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:01:24,463 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-03 09:01:24,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:01:24,464 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-03 09:01:24,465 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-03 09:01:24,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:01:24,520 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-03 09:01:24,522 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:01:24,803 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 24 proven. 273 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-03 09:01:24,803 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:01:25,539 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 4 proven. 281 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-03 09:01:25,539 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:01:25,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [697318923] [2024-11-03 09:01:25,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [697318923] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 09:01:25,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 09:01:25,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2024-11-03 09:01:25,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121896908] [2024-11-03 09:01:25,540 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 09:01:25,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-03 09:01:25,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:01:25,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-03 09:01:25,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2024-11-03 09:01:25,542 INFO L87 Difference]: Start difference. First operand 120 states and 184 transitions. Second operand has 34 states, 34 states have (on average 3.5588235294117645) internal successors, (121), 34 states have internal predecessors, (121), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-03 09:01:27,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:01:27,585 INFO L93 Difference]: Finished difference Result 337 states and 499 transitions. [2024-11-03 09:01:27,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-11-03 09:01:27,586 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.5588235294117645) internal successors, (121), 34 states have internal predecessors, (121), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 86 [2024-11-03 09:01:27,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:01:27,588 INFO L225 Difference]: With dead ends: 337 [2024-11-03 09:01:27,588 INFO L226 Difference]: Without dead ends: 224 [2024-11-03 09:01:27,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=936, Invalid=2256, Unknown=0, NotChecked=0, Total=3192 [2024-11-03 09:01:27,590 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 559 mSDsluCounter, 1583 mSDsCounter, 0 mSdLazyCounter, 1750 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 559 SdHoareTripleChecker+Valid, 1694 SdHoareTripleChecker+Invalid, 1770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-03 09:01:27,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [559 Valid, 1694 Invalid, 1770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1750 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-03 09:01:27,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-03 09:01:27,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 124. [2024-11-03 09:01:27,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 115 states have (on average 1.5478260869565217) internal successors, (178), 116 states have internal predecessors, (178), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-03 09:01:27,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 191 transitions. [2024-11-03 09:01:27,620 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 191 transitions. Word has length 86 [2024-11-03 09:01:27,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:01:27,620 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 191 transitions. [2024-11-03 09:01:27,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.5588235294117645) internal successors, (121), 34 states have internal predecessors, (121), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-03 09:01:27,621 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 191 transitions. [2024-11-03 09:01:27,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-03 09:01:27,622 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:01:27,622 INFO L215 NwaCegarLoop]: trace histogram [23, 22, 22, 4, 4, 4, 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] [2024-11-03 09:01:27,626 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-03 09:01:27,822 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-03 09:01:27,822 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:01:27,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:01:27,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1879876744, now seen corresponding path program 4 times [2024-11-03 09:01:27,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:01:27,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1593667680] [2024-11-03 09:01:27,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:01:27,823 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-03 09:01:27,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:01:27,825 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-03 09:01:27,826 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-03 09:01:27,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:01:27,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-03 09:01:27,887 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:01:28,477 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 24 proven. 737 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-03 09:01:28,477 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:01:30,624 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 4 proven. 745 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-03 09:01:30,624 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:01:30,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1593667680] [2024-11-03 09:01:30,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1593667680] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 09:01:30,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 09:01:30,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-03 09:01:30,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071743986] [2024-11-03 09:01:30,625 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 09:01:30,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-03 09:01:30,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:01:30,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-03 09:01:30,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=673, Invalid=1777, Unknown=0, NotChecked=0, Total=2450 [2024-11-03 09:01:30,628 INFO L87 Difference]: Start difference. First operand 124 states and 191 transitions. Second operand has 50 states, 50 states have (on average 3.42) internal successors, (171), 50 states have internal predecessors, (171), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-03 09:01:38,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:01:38,837 INFO L93 Difference]: Finished difference Result 366 states and 550 transitions. [2024-11-03 09:01:38,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-11-03 09:01:38,839 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 3.42) internal successors, (171), 50 states have internal predecessors, (171), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 111 [2024-11-03 09:01:38,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:01:38,841 INFO L225 Difference]: With dead ends: 366 [2024-11-03 09:01:38,841 INFO L226 Difference]: Without dead ends: 249 [2024-11-03 09:01:38,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=1773, Invalid=3339, Unknown=0, NotChecked=0, Total=5112 [2024-11-03 09:01:38,852 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 689 mSDsluCounter, 3036 mSDsCounter, 0 mSdLazyCounter, 2174 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 3161 SdHoareTripleChecker+Invalid, 2239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 2174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-03 09:01:38,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 3161 Invalid, 2239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 2174 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-03 09:01:38,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-11-03 09:01:38,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 192. [2024-11-03 09:01:38,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 183 states have (on average 1.5901639344262295) internal successors, (291), 184 states have internal predecessors, (291), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-03 09:01:38,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 304 transitions. [2024-11-03 09:01:38,890 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 304 transitions. Word has length 111 [2024-11-03 09:01:38,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:01:38,891 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 304 transitions. [2024-11-03 09:01:38,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 3.42) internal successors, (171), 50 states have internal predecessors, (171), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-03 09:01:38,891 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 304 transitions. [2024-11-03 09:01:38,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-03 09:01:38,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:01:38,892 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 23, 4, 4, 4, 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] [2024-11-03 09:01:38,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-03 09:01:39,093 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-03 09:01:39,093 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:01:39,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:01:39,094 INFO L85 PathProgramCache]: Analyzing trace with hash -2132035585, now seen corresponding path program 4 times [2024-11-03 09:01:39,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:01:39,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1511359539] [2024-11-03 09:01:39,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:01:39,094 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-03 09:01:39,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:01:39,095 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-03 09:01:39,097 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-03 09:01:39,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:01:39,156 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-03 09:01:39,158 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:01:39,190 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 849 trivial. 0 not checked. [2024-11-03 09:01:39,190 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:01:39,224 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 849 trivial. 0 not checked. [2024-11-03 09:01:39,224 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:01:39,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1511359539] [2024-11-03 09:01:39,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1511359539] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 09:01:39,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 09:01:39,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2024-11-03 09:01:39,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396458677] [2024-11-03 09:01:39,225 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 09:01:39,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-03 09:01:39,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:01:39,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-03 09:01:39,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-03 09:01:39,226 INFO L87 Difference]: Start difference. First operand 192 states and 304 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-03 09:01:39,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:01:39,279 INFO L93 Difference]: Finished difference Result 218 states and 341 transitions. [2024-11-03 09:01:39,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-03 09:01:39,280 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 116 [2024-11-03 09:01:39,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:01:39,282 INFO L225 Difference]: With dead ends: 218 [2024-11-03 09:01:39,282 INFO L226 Difference]: Without dead ends: 198 [2024-11-03 09:01:39,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 226 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-03 09:01:39,283 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 24 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-03 09:01:39,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 245 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-03 09:01:39,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-03 09:01:39,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 192. [2024-11-03 09:01:39,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 183 states have (on average 1.5792349726775956) internal successors, (289), 184 states have internal predecessors, (289), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-03 09:01:39,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 302 transitions. [2024-11-03 09:01:39,307 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 302 transitions. Word has length 116 [2024-11-03 09:01:39,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:01:39,307 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 302 transitions. [2024-11-03 09:01:39,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-03 09:01:39,308 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 302 transitions. [2024-11-03 09:01:39,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-03 09:01:39,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:01:39,309 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 23, 4, 4, 4, 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] [2024-11-03 09:01:39,315 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 (13)] Forceful destruction successful, exit code 0 [2024-11-03 09:01:39,509 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-03 09:01:39,510 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:01:39,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:01:39,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1061161631, now seen corresponding path program 1 times [2024-11-03 09:01:39,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:01:39,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [579592075] [2024-11-03 09:01:39,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:01:39,511 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-03 09:01:39,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:01:39,512 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-03 09:01:39,513 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-03 09:01:39,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:01:39,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-03 09:01:39,579 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:01:39,615 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 849 trivial. 0 not checked. [2024-11-03 09:01:39,616 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:01:39,648 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 849 trivial. 0 not checked. [2024-11-03 09:01:39,648 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:01:39,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [579592075] [2024-11-03 09:01:39,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [579592075] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 09:01:39,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 09:01:39,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2024-11-03 09:01:39,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852824613] [2024-11-03 09:01:39,649 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 09:01:39,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-03 09:01:39,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:01:39,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-03 09:01:39,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-03 09:01:39,650 INFO L87 Difference]: Start difference. First operand 192 states and 302 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-03 09:01:39,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:01:39,690 INFO L93 Difference]: Finished difference Result 226 states and 352 transitions. [2024-11-03 09:01:39,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-03 09:01:39,690 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 120 [2024-11-03 09:01:39,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:01:39,692 INFO L225 Difference]: With dead ends: 226 [2024-11-03 09:01:39,692 INFO L226 Difference]: Without dead ends: 205 [2024-11-03 09:01:39,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 234 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-03 09:01:39,693 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 2 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-03 09:01:39,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 287 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-03 09:01:39,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-03 09:01:39,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 203. [2024-11-03 09:01:39,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 191 states have (on average 1.5549738219895288) internal successors, (297), 193 states have internal predecessors, (297), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (18), 6 states have call predecessors, (18), 5 states have call successors, (18) [2024-11-03 09:01:39,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 321 transitions. [2024-11-03 09:01:39,711 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 321 transitions. Word has length 120 [2024-11-03 09:01:39,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:01:39,712 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 321 transitions. [2024-11-03 09:01:39,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-03 09:01:39,712 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 321 transitions. [2024-11-03 09:01:39,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-03 09:01:39,713 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:01:39,713 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 23, 4, 4, 4, 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] [2024-11-03 09:01:39,718 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 (14)] Forceful destruction successful, exit code 0 [2024-11-03 09:01:39,916 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-03 09:01:39,916 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:01:39,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:01:39,917 INFO L85 PathProgramCache]: Analyzing trace with hash -218702047, now seen corresponding path program 1 times [2024-11-03 09:01:39,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:01:39,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1197280544] [2024-11-03 09:01:39,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:01:39,917 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-03 09:01:39,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:01:39,918 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-03 09:01:39,920 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-03 09:01:39,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:01:39,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-03 09:01:40,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:01:40,051 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 849 trivial. 0 not checked. [2024-11-03 09:01:40,051 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:01:40,097 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 849 trivial. 0 not checked. [2024-11-03 09:01:40,097 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:01:40,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1197280544] [2024-11-03 09:01:40,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1197280544] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 09:01:40,097 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 09:01:40,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2024-11-03 09:01:40,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931491259] [2024-11-03 09:01:40,098 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 09:01:40,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-03 09:01:40,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:01:40,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-03 09:01:40,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-03 09:01:40,099 INFO L87 Difference]: Start difference. First operand 203 states and 321 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-03 09:01:40,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:01:40,144 INFO L93 Difference]: Finished difference Result 231 states and 358 transitions. [2024-11-03 09:01:40,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-03 09:01:40,145 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 120 [2024-11-03 09:01:40,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:01:40,147 INFO L225 Difference]: With dead ends: 231 [2024-11-03 09:01:40,147 INFO L226 Difference]: Without dead ends: 213 [2024-11-03 09:01:40,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-03 09:01:40,148 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 2 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-03 09:01:40,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 344 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-03 09:01:40,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-03 09:01:40,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2024-11-03 09:01:40,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 201 states have (on average 1.5323383084577114) internal successors, (308), 201 states have internal predecessors, (308), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (18), 8 states have call predecessors, (18), 5 states have call successors, (18) [2024-11-03 09:01:40,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 332 transitions. [2024-11-03 09:01:40,165 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 332 transitions. Word has length 120 [2024-11-03 09:01:40,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:01:40,166 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 332 transitions. [2024-11-03 09:01:40,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-03 09:01:40,166 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 332 transitions. [2024-11-03 09:01:40,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-03 09:01:40,167 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:01:40,167 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 23, 4, 4, 4, 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] [2024-11-03 09:01:40,173 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 (15)] Ended with exit code 0 [2024-11-03 09:01:40,368 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-03 09:01:40,368 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:01:40,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:01:40,368 INFO L85 PathProgramCache]: Analyzing trace with hash 39463391, now seen corresponding path program 1 times [2024-11-03 09:01:40,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:01:40,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1028849764] [2024-11-03 09:01:40,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:01:40,369 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-03 09:01:40,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:01:40,372 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-03 09:01:40,373 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-03 09:01:40,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:01:40,433 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-03 09:01:40,435 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:01:40,462 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 858 trivial. 0 not checked. [2024-11-03 09:01:40,462 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:01:40,490 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 858 trivial. 0 not checked. [2024-11-03 09:01:40,490 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:01:40,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1028849764] [2024-11-03 09:01:40,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1028849764] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 09:01:40,491 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 09:01:40,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2024-11-03 09:01:40,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715581542] [2024-11-03 09:01:40,491 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 09:01:40,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-03 09:01:40,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:01:40,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-03 09:01:40,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-03 09:01:40,492 INFO L87 Difference]: Start difference. First operand 213 states and 332 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-03 09:01:40,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:01:40,534 INFO L93 Difference]: Finished difference Result 224 states and 343 transitions. [2024-11-03 09:01:40,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-03 09:01:40,535 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 120 [2024-11-03 09:01:40,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:01:40,537 INFO L225 Difference]: With dead ends: 224 [2024-11-03 09:01:40,537 INFO L226 Difference]: Without dead ends: 218 [2024-11-03 09:01:40,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-03 09:01:40,538 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-03 09:01:40,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 226 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-03 09:01:40,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-03 09:01:40,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2024-11-03 09:01:40,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 206 states have (on average 1.5194174757281553) internal successors, (313), 206 states have internal predecessors, (313), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (18), 8 states have call predecessors, (18), 5 states have call successors, (18) [2024-11-03 09:01:40,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 337 transitions. [2024-11-03 09:01:40,554 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 337 transitions. Word has length 120 [2024-11-03 09:01:40,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:01:40,571 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 337 transitions. [2024-11-03 09:01:40,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-03 09:01:40,571 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 337 transitions. [2024-11-03 09:01:40,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-03 09:01:40,572 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:01:40,572 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 23, 4, 4, 4, 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] [2024-11-03 09:01:40,579 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 (16)] Ended with exit code 0 [2024-11-03 09:01:40,772 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-03 09:01:40,773 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:01:40,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:01:40,774 INFO L85 PathProgramCache]: Analyzing trace with hash 96721693, now seen corresponding path program 1 times [2024-11-03 09:01:40,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:01:40,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [207022506] [2024-11-03 09:01:40,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:01:40,774 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-03 09:01:40,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:01:40,777 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-03 09:01:40,783 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-03 09:01:40,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:01:40,855 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-03 09:01:40,857 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:01:40,885 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 858 trivial. 0 not checked. [2024-11-03 09:01:40,886 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:01:40,923 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 858 trivial. 0 not checked. [2024-11-03 09:01:40,923 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:01:40,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [207022506] [2024-11-03 09:01:40,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [207022506] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 09:01:40,923 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 09:01:40,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 8 [2024-11-03 09:01:40,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483545606] [2024-11-03 09:01:40,924 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 09:01:40,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-03 09:01:40,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:01:40,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-03 09:01:40,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-03 09:01:40,926 INFO L87 Difference]: Start difference. First operand 218 states and 337 transitions. Second operand has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 2 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-03 09:01:40,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:01:40,964 INFO L93 Difference]: Finished difference Result 224 states and 342 transitions. [2024-11-03 09:01:40,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-03 09:01:40,965 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 2 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 120 [2024-11-03 09:01:40,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:01:40,966 INFO L225 Difference]: With dead ends: 224 [2024-11-03 09:01:40,967 INFO L226 Difference]: Without dead ends: 203 [2024-11-03 09:01:40,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-03 09:01:40,967 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 1 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-03 09:01:40,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 359 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-03 09:01:40,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-03 09:01:40,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2024-11-03 09:01:40,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 191 states have (on average 1.5392670157068062) internal successors, (294), 193 states have internal predecessors, (294), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2024-11-03 09:01:40,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 312 transitions. [2024-11-03 09:01:40,985 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 312 transitions. Word has length 120 [2024-11-03 09:01:40,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:01:40,985 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 312 transitions. [2024-11-03 09:01:40,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 2 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-03 09:01:40,986 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 312 transitions. [2024-11-03 09:01:40,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-03 09:01:40,988 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:01:40,988 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 23, 4, 4, 4, 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] [2024-11-03 09:01:40,993 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 (17)] Ended with exit code 0 [2024-11-03 09:01:41,189 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-03 09:01:41,190 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:01:41,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:01:41,190 INFO L85 PathProgramCache]: Analyzing trace with hash 38983873, now seen corresponding path program 1 times [2024-11-03 09:01:41,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:01:41,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1839901033] [2024-11-03 09:01:41,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:01:41,190 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-03 09:01:41,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:01:41,193 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-03 09:01:41,194 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-03 09:01:41,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:01:41,260 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-03 09:01:41,262 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:01:41,307 INFO L134 CoverageAnalysis]: Checked inductivity of 860 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 851 trivial. 0 not checked. [2024-11-03 09:01:41,307 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:01:41,350 INFO L134 CoverageAnalysis]: Checked inductivity of 860 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 851 trivial. 0 not checked. [2024-11-03 09:01:41,350 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:01:41,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1839901033] [2024-11-03 09:01:41,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1839901033] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 09:01:41,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 09:01:41,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-11-03 09:01:41,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661265981] [2024-11-03 09:01:41,351 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 09:01:41,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-03 09:01:41,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:01:41,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-03 09:01:41,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-03 09:01:41,352 INFO L87 Difference]: Start difference. First operand 203 states and 312 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-03 09:01:41,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:01:41,421 INFO L93 Difference]: Finished difference Result 225 states and 338 transitions. [2024-11-03 09:01:41,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-03 09:01:41,421 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 125 [2024-11-03 09:01:41,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:01:41,423 INFO L225 Difference]: With dead ends: 225 [2024-11-03 09:01:41,423 INFO L226 Difference]: Without dead ends: 195 [2024-11-03 09:01:41,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-03 09:01:41,424 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 1 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-03 09:01:41,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 366 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-03 09:01:41,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-03 09:01:41,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2024-11-03 09:01:41,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 185 states have (on average 1.308108108108108) internal successors, (242), 187 states have internal predecessors, (242), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-03 09:01:41,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 254 transitions. [2024-11-03 09:01:41,440 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 254 transitions. Word has length 125 [2024-11-03 09:01:41,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:01:41,440 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 254 transitions. [2024-11-03 09:01:41,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-03 09:01:41,440 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 254 transitions. [2024-11-03 09:01:41,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-03 09:01:41,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:01:41,442 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 23, 4, 4, 4, 3, 3, 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] [2024-11-03 09:01:41,447 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 (18)] Ended with exit code 0 [2024-11-03 09:01:41,642 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-03 09:01:41,643 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:01:41,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:01:41,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1168378424, now seen corresponding path program 1 times [2024-11-03 09:01:41,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:01:41,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1473943082] [2024-11-03 09:01:41,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:01:41,643 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-03 09:01:41,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:01:41,645 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-03 09:01:41,646 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-03 09:01:41,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:01:41,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-03 09:01:41,735 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:01:41,758 INFO L134 CoverageAnalysis]: Checked inductivity of 866 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 866 trivial. 0 not checked. [2024-11-03 09:01:41,759 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:01:41,795 INFO L134 CoverageAnalysis]: Checked inductivity of 866 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 866 trivial. 0 not checked. [2024-11-03 09:01:41,796 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:01:41,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1473943082] [2024-11-03 09:01:41,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1473943082] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 09:01:41,796 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 09:01:41,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2024-11-03 09:01:41,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537993790] [2024-11-03 09:01:41,796 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 09:01:41,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-03 09:01:41,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:01:41,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-03 09:01:41,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-03 09:01:41,797 INFO L87 Difference]: Start difference. First operand 195 states and 254 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-03 09:01:41,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:01:41,819 INFO L93 Difference]: Finished difference Result 216 states and 279 transitions. [2024-11-03 09:01:41,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-03 09:01:41,819 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 129 [2024-11-03 09:01:41,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:01:41,820 INFO L225 Difference]: With dead ends: 216 [2024-11-03 09:01:41,820 INFO L226 Difference]: Without dead ends: 195 [2024-11-03 09:01:41,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 252 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-03 09:01:41,821 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 10 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-03 09:01:41,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 229 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-03 09:01:41,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-03 09:01:41,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2024-11-03 09:01:41,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 185 states have (on average 1.3027027027027027) internal successors, (241), 187 states have internal predecessors, (241), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-03 09:01:41,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 253 transitions. [2024-11-03 09:01:41,837 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 253 transitions. Word has length 129 [2024-11-03 09:01:41,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:01:41,837 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 253 transitions. [2024-11-03 09:01:41,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-03 09:01:41,838 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 253 transitions. [2024-11-03 09:01:41,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-03 09:01:41,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:01:41,839 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 23, 4, 4, 4, 3, 3, 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] [2024-11-03 09:01:41,845 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 (19)] Ended with exit code 0 [2024-11-03 09:01:42,039 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-03 09:01:42,040 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:01:42,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:01:42,040 INFO L85 PathProgramCache]: Analyzing trace with hash 147310070, now seen corresponding path program 2 times [2024-11-03 09:01:42,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:01:42,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [676411047] [2024-11-03 09:01:42,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:01:42,040 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-03 09:01:42,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:01:42,041 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-03 09:01:42,043 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-03 09:01:42,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:01:42,114 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-03 09:01:42,116 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:01:42,181 INFO L134 CoverageAnalysis]: Checked inductivity of 866 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 857 trivial. 0 not checked. [2024-11-03 09:01:42,181 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:01:42,239 INFO L134 CoverageAnalysis]: Checked inductivity of 866 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 857 trivial. 0 not checked. [2024-11-03 09:01:42,239 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:01:42,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [676411047] [2024-11-03 09:01:42,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [676411047] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 09:01:42,239 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 09:01:42,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2024-11-03 09:01:42,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409623035] [2024-11-03 09:01:42,239 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 09:01:42,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-03 09:01:42,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:01:42,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-03 09:01:42,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-03 09:01:42,241 INFO L87 Difference]: Start difference. First operand 195 states and 253 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-03 09:01:42,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:01:42,310 INFO L93 Difference]: Finished difference Result 196 states and 254 transitions. [2024-11-03 09:01:42,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-03 09:01:42,310 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 129 [2024-11-03 09:01:42,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:01:42,310 INFO L225 Difference]: With dead ends: 196 [2024-11-03 09:01:42,310 INFO L226 Difference]: Without dead ends: 0 [2024-11-03 09:01:42,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 247 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-03 09:01:42,311 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 6 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-03 09:01:42,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 237 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-03 09:01:42,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-03 09:01:42,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-03 09:01:42,312 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-03 09:01:42,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-03 09:01:42,312 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 129 [2024-11-03 09:01:42,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:01:42,312 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-03 09:01:42,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-03 09:01:42,312 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-03 09:01:42,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-03 09:01:42,315 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-03 09:01:42,321 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-03 09:01:42,515 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-03 09:01:42,518 INFO L407 BasicCegarLoop]: Path program histogram: [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 09:01:42,520 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-03 09:01:43,313 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-03 09:01:43,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 09:01:43 BoogieIcfgContainer [2024-11-03 09:01:43,339 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-03 09:01:43,339 INFO L158 Benchmark]: Toolchain (without parser) took 29694.73ms. Allocated memory was 336.6MB in the beginning and 418.4MB in the end (delta: 81.8MB). Free memory was 286.1MB in the beginning and 184.0MB in the end (delta: 102.1MB). Peak memory consumption was 226.4MB. Max. memory is 8.0GB. [2024-11-03 09:01:43,340 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 210.8MB. Free memory is still 160.5MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-03 09:01:43,340 INFO L158 Benchmark]: CACSL2BoogieTranslator took 327.81ms. Allocated memory is still 336.6MB. Free memory was 285.8MB in the beginning and 270.4MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2024-11-03 09:01:43,340 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.07ms. Allocated memory is still 336.6MB. Free memory was 270.4MB in the beginning and 268.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-03 09:01:43,343 INFO L158 Benchmark]: Boogie Preprocessor took 42.75ms. Allocated memory is still 336.6MB. Free memory was 268.6MB in the beginning and 266.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-03 09:01:43,344 INFO L158 Benchmark]: RCFGBuilder took 609.43ms. Allocated memory is still 336.6MB. Free memory was 266.2MB in the beginning and 249.1MB in the end (delta: 17.1MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2024-11-03 09:01:43,344 INFO L158 Benchmark]: TraceAbstraction took 28675.79ms. Allocated memory was 336.6MB in the beginning and 418.4MB in the end (delta: 81.8MB). Free memory was 248.7MB in the beginning and 184.0MB in the end (delta: 64.7MB). Peak memory consumption was 188.6MB. Max. memory is 8.0GB. [2024-11-03 09:01:43,345 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.13ms. Allocated memory is still 210.8MB. Free memory is still 160.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 327.81ms. Allocated memory is still 336.6MB. Free memory was 285.8MB in the beginning and 270.4MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.07ms. Allocated memory is still 336.6MB. Free memory was 270.4MB in the beginning and 268.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.75ms. Allocated memory is still 336.6MB. Free memory was 268.6MB in the beginning and 266.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 609.43ms. Allocated memory is still 336.6MB. Free memory was 266.2MB in the beginning and 249.1MB in the end (delta: 17.1MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 28675.79ms. Allocated memory was 336.6MB in the beginning and 418.4MB in the end (delta: 81.8MB). Free memory was 248.7MB in the beginning and 184.0MB in the end (delta: 64.7MB). Peak memory consumption was 188.6MB. 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: 17]: 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, 52 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 27.8s, OverallIterations: 19, TraceHistogramMax: 24, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 14.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1894 SdHoareTripleChecker+Valid, 5.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1894 mSDsluCounter, 11015 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9734 mSDsCounter, 158 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6231 IncrementalHoareTripleChecker+Invalid, 6389 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 158 mSolverCounterUnsat, 1281 mSDtfsCounter, 6231 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3365 GetRequests, 3073 SyntacticMatches, 2 SemanticMatches, 290 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 857 ImplicationChecksByTransitivity, 12.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=218occurred in iteration=15, InterpolantAutomatonStates: 252, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 370 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 1648 NumberOfCodeBlocks, 1648 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 3258 ConstructedInterpolants, 0 QuantifiedInterpolants, 7995 SizeOfPredicates, 16 NumberOfNonLiveVariables, 2974 ConjunctsInSsa, 141 ConjunctsInUnsatCore, 38 InterpolantComputations, 12 PerfectInterpolantSequences, 14288/16906 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: 37]: Loop Invariant Derived loop invariant: ((0 != \old(m)) && ((1 != \old(m)) || (m < 16777216))) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((((0 != \old(e)) || !(((e + -22) % 4294967296) <= -128)) && ((0 != \old(e)) || !(e <= -128))) && !(\old(m) < 16777216)) - ProcedureContractResult [Line: 24]: Procedure Contract for base2flt Derived contract for procedure base2flt. Ensures: ((0 != m) || (0 == \result)) - ProcedureContractResult [Line: 15]: 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-03 09:01:43,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...