/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/nla-digbench-scaling/divbin_unwindbound20.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 01:22:46,682 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 01:22:46,743 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-25 01:22:46,748 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 01:22:46,748 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 01:22:46,773 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 01:22:46,774 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 01:22:46,774 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 01:22:46,774 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 01:22:46,777 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 01:22:46,778 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 01:22:46,778 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 01:22:46,778 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 01:22:46,779 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 01:22:46,779 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 01:22:46,780 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 01:22:46,780 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 01:22:46,780 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 01:22:46,780 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 01:22:46,780 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 01:22:46,780 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 01:22:46,781 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 01:22:46,781 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 01:22:46,781 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 01:22:46,781 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 01:22:46,781 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 01:22:46,781 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 01:22:46,781 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 01:22:46,782 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 01:22:46,782 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 01:22:46,782 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 01:22:46,783 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 01:22:46,783 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 01:22:46,783 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 01:22:46,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 01:22:46,783 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 01:22:46,783 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 01:22:46,783 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 01:22:46,783 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 01:22:46,783 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 01:22:46,784 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 01:22:46,784 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 01:22:46,784 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 01:22:46,784 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 01:22:46,784 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 01:22:46,784 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 01:22:46,784 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-25 01:22:46,969 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 01:22:46,989 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 01:22:46,990 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 01:22:46,992 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 01:22:46,992 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 01:22:46,993 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/divbin_unwindbound20.i [2023-12-25 01:22:47,987 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 01:22:48,133 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 01:22:48,133 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin_unwindbound20.i [2023-12-25 01:22:48,139 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eafaa6bd6/b1c46afae4ae41c287d7e18f117631e5/FLAG082e4fa63 [2023-12-25 01:22:48,151 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eafaa6bd6/b1c46afae4ae41c287d7e18f117631e5 [2023-12-25 01:22:48,153 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 01:22:48,154 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 01:22:48,155 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 01:22:48,155 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 01:22:48,159 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 01:22:48,159 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 01:22:48" (1/1) ... [2023-12-25 01:22:48,160 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ee19ae8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:22:48, skipping insertion in model container [2023-12-25 01:22:48,160 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 01:22:48" (1/1) ... [2023-12-25 01:22:48,178 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 01:22:48,281 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin_unwindbound20.i[950,963] [2023-12-25 01:22:48,291 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 01:22:48,299 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 01:22:48,308 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin_unwindbound20.i[950,963] [2023-12-25 01:22:48,312 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 01:22:48,322 INFO L206 MainTranslator]: Completed translation [2023-12-25 01:22:48,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:22:48 WrapperNode [2023-12-25 01:22:48,323 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 01:22:48,323 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 01:22:48,323 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 01:22:48,323 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 01:22:48,328 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:22:48" (1/1) ... [2023-12-25 01:22:48,333 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:22:48" (1/1) ... [2023-12-25 01:22:48,344 INFO L138 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 55 [2023-12-25 01:22:48,344 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 01:22:48,345 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 01:22:48,345 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 01:22:48,345 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 01:22:48,351 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:22:48" (1/1) ... [2023-12-25 01:22:48,351 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:22:48" (1/1) ... [2023-12-25 01:22:48,353 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:22:48" (1/1) ... [2023-12-25 01:22:48,365 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-25 01:22:48,366 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:22:48" (1/1) ... [2023-12-25 01:22:48,366 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:22:48" (1/1) ... [2023-12-25 01:22:48,377 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:22:48" (1/1) ... [2023-12-25 01:22:48,379 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:22:48" (1/1) ... [2023-12-25 01:22:48,380 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:22:48" (1/1) ... [2023-12-25 01:22:48,381 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:22:48" (1/1) ... [2023-12-25 01:22:48,382 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 01:22:48,382 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 01:22:48,382 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 01:22:48,383 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 01:22:48,383 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:22:48" (1/1) ... [2023-12-25 01:22:48,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 01:22:48,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 01:22:48,422 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-25 01:22:48,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-25 01:22:48,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 01:22:48,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 01:22:48,483 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-25 01:22:48,484 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-25 01:22:48,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 01:22:48,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 01:22:48,484 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 01:22:48,484 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 01:22:48,535 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 01:22:48,538 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 01:22:48,668 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 01:22:48,687 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 01:22:48,687 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-25 01:22:48,688 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 01:22:48 BoogieIcfgContainer [2023-12-25 01:22:48,688 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 01:22:48,689 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 01:22:48,689 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 01:22:48,692 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 01:22:48,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 01:22:48" (1/3) ... [2023-12-25 01:22:48,692 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b778ca5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 01:22:48, skipping insertion in model container [2023-12-25 01:22:48,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:22:48" (2/3) ... [2023-12-25 01:22:48,693 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b778ca5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 01:22:48, skipping insertion in model container [2023-12-25 01:22:48,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 01:22:48" (3/3) ... [2023-12-25 01:22:48,695 INFO L112 eAbstractionObserver]: Analyzing ICFG divbin_unwindbound20.i [2023-12-25 01:22:48,708 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 01:22:48,709 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 01:22:48,753 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 01:22:48,762 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5de2e492, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 01:22:48,762 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 01:22:48,767 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 01:22:48,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-25 01:22:48,773 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:22:48,774 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:22:48,774 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:22:48,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:22:48,780 INFO L85 PathProgramCache]: Analyzing trace with hash -627064806, now seen corresponding path program 1 times [2023-12-25 01:22:48,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:22:48,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1810500209] [2023-12-25 01:22:48,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:22:48,789 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:22:48,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:22:48,792 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:22:48,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-25 01:22:48,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:22:48,879 INFO L262 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 01:22:48,882 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:22:48,901 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 01:22:48,901 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 01:22:48,901 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:22:48,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1810500209] [2023-12-25 01:22:48,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1810500209] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 01:22:48,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 01:22:48,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 01:22:48,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623642261] [2023-12-25 01:22:48,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:22:48,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 01:22:48,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:22:48,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 01:22:48,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 01:22:48,934 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 01:22:48,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:22:48,967 INFO L93 Difference]: Finished difference Result 48 states and 71 transitions. [2023-12-25 01:22:48,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 01:22:48,969 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2023-12-25 01:22:48,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:22:48,973 INFO L225 Difference]: With dead ends: 48 [2023-12-25 01:22:48,974 INFO L226 Difference]: Without dead ends: 23 [2023-12-25 01:22:48,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 01:22:48,978 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 01:22:48,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 01:22:48,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-25 01:22:49,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-12-25 01:22:49,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-25 01:22:49,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2023-12-25 01:22:49,007 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 18 [2023-12-25 01:22:49,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:22:49,008 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2023-12-25 01:22:49,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 01:22:49,008 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2023-12-25 01:22:49,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-25 01:22:49,010 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:22:49,010 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:22:49,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-25 01:22:49,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:22:49,213 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:22:49,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:22:49,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1502675692, now seen corresponding path program 1 times [2023-12-25 01:22:49,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:22:49,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [178205325] [2023-12-25 01:22:49,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:22:49,214 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:22:49,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:22:49,228 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:22:49,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-25 01:22:49,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:22:49,282 INFO L262 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 01:22:49,284 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:22:49,353 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 01:22:49,353 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 01:22:49,353 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:22:49,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [178205325] [2023-12-25 01:22:49,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [178205325] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 01:22:49,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 01:22:49,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 01:22:49,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868166890] [2023-12-25 01:22:49,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:22:49,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 01:22:49,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:22:49,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 01:22:49,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 01:22:49,356 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 01:22:49,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:22:49,386 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2023-12-25 01:22:49,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 01:22:49,389 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2023-12-25 01:22:49,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:22:49,389 INFO L225 Difference]: With dead ends: 37 [2023-12-25 01:22:49,390 INFO L226 Difference]: Without dead ends: 25 [2023-12-25 01:22:49,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 01:22:49,391 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 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 [2023-12-25 01:22:49,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 01:22:49,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-25 01:22:49,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-12-25 01:22:49,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-25 01:22:49,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2023-12-25 01:22:49,396 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 20 [2023-12-25 01:22:49,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:22:49,397 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2023-12-25 01:22:49,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 01:22:49,399 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2023-12-25 01:22:49,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-25 01:22:49,401 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:22:49,401 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:22:49,412 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 [2023-12-25 01:22:49,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:22:49,605 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:22:49,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:22:49,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1051975660, now seen corresponding path program 1 times [2023-12-25 01:22:49,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:22:49,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [877912341] [2023-12-25 01:22:49,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:22:49,606 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:22:49,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:22:49,609 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:22:49,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-25 01:22:49,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:22:49,654 INFO L262 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-25 01:22:49,656 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:22:49,880 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-25 01:22:49,881 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:22:50,585 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 01:22:50,585 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:22:50,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [877912341] [2023-12-25 01:22:50,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [877912341] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 01:22:50,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 01:22:50,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2023-12-25 01:22:50,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171856619] [2023-12-25 01:22:50,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:22:50,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 01:22:50,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:22:50,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 01:22:50,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-12-25 01:22:50,587 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 01:22:51,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:22:51,003 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2023-12-25 01:22:51,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 01:22:51,005 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2023-12-25 01:22:51,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:22:51,006 INFO L225 Difference]: With dead ends: 37 [2023-12-25 01:22:51,006 INFO L226 Difference]: Without dead ends: 34 [2023-12-25 01:22:51,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2023-12-25 01:22:51,008 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 10 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 01:22:51,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 98 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-25 01:22:51,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-12-25 01:22:51,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2023-12-25 01:22:51,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 01:22:51,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2023-12-25 01:22:51,014 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 21 [2023-12-25 01:22:51,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:22:51,014 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2023-12-25 01:22:51,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 01:22:51,014 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2023-12-25 01:22:51,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-25 01:22:51,015 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:22:51,015 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:22:51,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-25 01:22:51,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:22:51,218 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:22:51,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:22:51,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1626197479, now seen corresponding path program 1 times [2023-12-25 01:22:51,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:22:51,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [280620715] [2023-12-25 01:22:51,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:22:51,219 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:22:51,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:22:51,220 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:22:51,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-25 01:22:51,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:22:51,248 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 01:22:51,249 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:22:51,280 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 01:22:51,280 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:22:51,316 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 01:22:51,317 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:22:51,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [280620715] [2023-12-25 01:22:51,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [280620715] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:22:51,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:22:51,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2023-12-25 01:22:51,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735538752] [2023-12-25 01:22:51,317 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:22:51,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 01:22:51,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:22:51,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 01:22:51,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-25 01:22:51,318 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-25 01:22:51,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:22:51,473 INFO L93 Difference]: Finished difference Result 68 states and 87 transitions. [2023-12-25 01:22:51,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 01:22:51,473 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 3 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 23 [2023-12-25 01:22:51,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:22:51,474 INFO L225 Difference]: With dead ends: 68 [2023-12-25 01:22:51,474 INFO L226 Difference]: Without dead ends: 56 [2023-12-25 01:22:51,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-12-25 01:22:51,475 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 35 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 01:22:51,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 126 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 01:22:51,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-12-25 01:22:51,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 42. [2023-12-25 01:22:51,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 01:22:51,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2023-12-25 01:22:51,482 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 23 [2023-12-25 01:22:51,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:22:51,483 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2023-12-25 01:22:51,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-25 01:22:51,483 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2023-12-25 01:22:51,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-25 01:22:51,483 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:22:51,483 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:22:51,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-25 01:22:51,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:22:51,686 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:22:51,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:22:51,686 INFO L85 PathProgramCache]: Analyzing trace with hash 737203847, now seen corresponding path program 1 times [2023-12-25 01:22:51,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:22:51,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [757752020] [2023-12-25 01:22:51,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:22:51,687 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:22:51,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:22:51,692 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:22:51,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-25 01:22:51,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:22:51,726 INFO L262 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 01:22:51,728 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:22:51,790 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-25 01:22:51,790 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 01:22:51,790 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:22:51,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [757752020] [2023-12-25 01:22:51,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [757752020] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 01:22:51,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 01:22:51,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 01:22:51,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290908350] [2023-12-25 01:22:51,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:22:51,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 01:22:51,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:22:51,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 01:22:51,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 01:22:51,793 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 01:22:51,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:22:51,887 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2023-12-25 01:22:51,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 01:22:51,887 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2023-12-25 01:22:51,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:22:51,888 INFO L225 Difference]: With dead ends: 54 [2023-12-25 01:22:51,888 INFO L226 Difference]: Without dead ends: 51 [2023-12-25 01:22:51,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-25 01:22:51,889 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 9 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 01:22:51,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 75 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 01:22:51,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-12-25 01:22:51,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 43. [2023-12-25 01:22:51,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 01:22:51,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2023-12-25 01:22:51,895 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 24 [2023-12-25 01:22:51,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:22:51,895 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2023-12-25 01:22:51,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 01:22:51,895 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2023-12-25 01:22:51,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-25 01:22:51,896 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:22:51,896 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:22:51,898 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 [2023-12-25 01:22:52,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:22:52,097 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:22:52,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:22:52,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1831455308, now seen corresponding path program 1 times [2023-12-25 01:22:52,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:22:52,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1876377184] [2023-12-25 01:22:52,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:22:52,098 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:22:52,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:22:52,099 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:22:52,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-25 01:22:52,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:22:52,133 INFO L262 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 01:22:52,134 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:22:52,148 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 01:22:52,148 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 01:22:52,148 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:22:52,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1876377184] [2023-12-25 01:22:52,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1876377184] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 01:22:52,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 01:22:52,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 01:22:52,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542182048] [2023-12-25 01:22:52,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:22:52,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 01:22:52,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:22:52,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 01:22:52,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 01:22:52,150 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-25 01:22:52,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:22:52,182 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2023-12-25 01:22:52,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 01:22:52,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2023-12-25 01:22:52,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:22:52,183 INFO L225 Difference]: With dead ends: 69 [2023-12-25 01:22:52,183 INFO L226 Difference]: Without dead ends: 44 [2023-12-25 01:22:52,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 01:22:52,184 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 01:22:52,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 01:22:52,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-12-25 01:22:52,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2023-12-25 01:22:52,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 35 states have internal predecessors, (43), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 01:22:52,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2023-12-25 01:22:52,189 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 30 [2023-12-25 01:22:52,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:22:52,190 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2023-12-25 01:22:52,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-25 01:22:52,190 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2023-12-25 01:22:52,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-25 01:22:52,191 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:22:52,191 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:22:52,209 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 [2023-12-25 01:22:52,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:22:52,410 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:22:52,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:22:52,411 INFO L85 PathProgramCache]: Analyzing trace with hash -736358239, now seen corresponding path program 1 times [2023-12-25 01:22:52,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:22:52,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1056265734] [2023-12-25 01:22:52,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:22:52,411 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:22:52,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:22:52,412 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) [2023-12-25 01:22:52,414 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 [2023-12-25 01:22:52,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:22:52,585 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-25 01:22:52,588 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:22:53,202 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 01:22:53,203 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:22:56,026 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 01:22:56,026 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:22:56,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1056265734] [2023-12-25 01:22:56,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1056265734] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:22:56,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:22:56,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2023-12-25 01:22:56,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437343975] [2023-12-25 01:22:56,027 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:22:56,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-25 01:22:56,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:22:56,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-25 01:22:56,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2023-12-25 01:22:56,028 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand has 20 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 16 states have internal predecessors, (41), 6 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-25 01:23:00,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:23:00,389 INFO L93 Difference]: Finished difference Result 106 states and 134 transitions. [2023-12-25 01:23:00,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-25 01:23:00,390 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 16 states have internal predecessors, (41), 6 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 33 [2023-12-25 01:23:00,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:23:00,391 INFO L225 Difference]: With dead ends: 106 [2023-12-25 01:23:00,391 INFO L226 Difference]: Without dead ends: 83 [2023-12-25 01:23:00,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=205, Invalid=851, Unknown=0, NotChecked=0, Total=1056 [2023-12-25 01:23:00,392 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 127 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-25 01:23:00,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 241 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-25 01:23:00,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-12-25 01:23:00,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 69. [2023-12-25 01:23:00,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 54 states have (on average 1.2037037037037037) internal successors, (65), 56 states have internal predecessors, (65), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-25 01:23:00,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 82 transitions. [2023-12-25 01:23:00,405 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 82 transitions. Word has length 33 [2023-12-25 01:23:00,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:23:00,405 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 82 transitions. [2023-12-25 01:23:00,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 16 states have internal predecessors, (41), 6 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-25 01:23:00,406 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 82 transitions. [2023-12-25 01:23:00,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-25 01:23:00,406 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:23:00,406 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:23:00,409 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 (8)] Forceful destruction successful, exit code 0 [2023-12-25 01:23:00,607 WARN L477 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 [2023-12-25 01:23:00,607 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:23:00,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:23:00,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1620601913, now seen corresponding path program 2 times [2023-12-25 01:23:00,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:23:00,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [598155767] [2023-12-25 01:23:00,608 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 01:23:00,608 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:23:00,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:23:00,609 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) [2023-12-25 01:23:00,616 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 [2023-12-25 01:23:00,684 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 01:23:00,684 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 01:23:00,688 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 01:23:00,689 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:23:00,810 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-25 01:23:00,811 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:23:00,935 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-25 01:23:00,935 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:23:00,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [598155767] [2023-12-25 01:23:00,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [598155767] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:23:00,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:23:00,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2023-12-25 01:23:00,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250280080] [2023-12-25 01:23:00,935 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:23:00,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-25 01:23:00,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:23:00,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-25 01:23:00,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2023-12-25 01:23:00,937 INFO L87 Difference]: Start difference. First operand 69 states and 82 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 10 states have internal predecessors, (46), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2023-12-25 01:23:01,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:23:01,081 INFO L93 Difference]: Finished difference Result 86 states and 103 transitions. [2023-12-25 01:23:01,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 01:23:01,082 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 10 states have internal predecessors, (46), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 42 [2023-12-25 01:23:01,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:23:01,083 INFO L225 Difference]: With dead ends: 86 [2023-12-25 01:23:01,084 INFO L226 Difference]: Without dead ends: 65 [2023-12-25 01:23:01,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2023-12-25 01:23:01,084 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 26 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 01:23:01,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 156 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 01:23:01,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-12-25 01:23:01,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2023-12-25 01:23:01,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 50 states have (on average 1.2) internal successors, (60), 52 states have internal predecessors, (60), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-25 01:23:01,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2023-12-25 01:23:01,095 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 42 [2023-12-25 01:23:01,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:23:01,096 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2023-12-25 01:23:01,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 10 states have internal predecessors, (46), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2023-12-25 01:23:01,096 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2023-12-25 01:23:01,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-25 01:23:01,097 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:23:01,097 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:23:01,104 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 (9)] Forceful destruction successful, exit code 0 [2023-12-25 01:23:01,297 WARN L477 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 [2023-12-25 01:23:01,298 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:23:01,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:23:01,298 INFO L85 PathProgramCache]: Analyzing trace with hash -682361828, now seen corresponding path program 1 times [2023-12-25 01:23:01,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:23:01,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [405716760] [2023-12-25 01:23:01,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:23:01,298 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:23:01,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:23:01,299 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) [2023-12-25 01:23:01,329 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 [2023-12-25 01:23:01,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:23:01,385 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-25 01:23:01,386 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:23:01,446 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-25 01:23:01,446 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:23:01,552 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-25 01:23:01,552 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:23:01,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [405716760] [2023-12-25 01:23:01,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [405716760] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:23:01,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:23:01,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2023-12-25 01:23:01,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428807518] [2023-12-25 01:23:01,553 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:23:01,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-25 01:23:01,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:23:01,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-25 01:23:01,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-12-25 01:23:01,554 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-25 01:23:02,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:23:02,347 INFO L93 Difference]: Finished difference Result 208 states and 253 transitions. [2023-12-25 01:23:02,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-25 01:23:02,350 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 41 [2023-12-25 01:23:02,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:23:02,351 INFO L225 Difference]: With dead ends: 208 [2023-12-25 01:23:02,351 INFO L226 Difference]: Without dead ends: 187 [2023-12-25 01:23:02,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=218, Invalid=484, Unknown=0, NotChecked=0, Total=702 [2023-12-25 01:23:02,352 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 196 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-25 01:23:02,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 277 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-25 01:23:02,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2023-12-25 01:23:02,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 90. [2023-12-25 01:23:02,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 74 states have (on average 1.2162162162162162) internal successors, (90), 76 states have internal predecessors, (90), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-25 01:23:02,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 107 transitions. [2023-12-25 01:23:02,372 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 107 transitions. Word has length 41 [2023-12-25 01:23:02,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:23:02,373 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 107 transitions. [2023-12-25 01:23:02,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-25 01:23:02,373 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 107 transitions. [2023-12-25 01:23:02,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-25 01:23:02,375 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:23:02,375 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:23:02,382 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 (10)] Forceful destruction successful, exit code 0 [2023-12-25 01:23:02,579 WARN L477 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 [2023-12-25 01:23:02,579 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:23:02,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:23:02,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1141376884, now seen corresponding path program 3 times [2023-12-25 01:23:02,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:23:02,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1089858609] [2023-12-25 01:23:02,580 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 01:23:02,580 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:23:02,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:23:02,581 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) [2023-12-25 01:23:02,582 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 [2023-12-25 01:23:02,709 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-25 01:23:02,710 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 01:23:02,712 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 01:23:02,714 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:23:03,025 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-25 01:23:03,026 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:23:13,738 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-25 01:23:13,738 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:23:13,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1089858609] [2023-12-25 01:23:13,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1089858609] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:23:13,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:23:13,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2023-12-25 01:23:13,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53029427] [2023-12-25 01:23:13,739 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:23:13,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 01:23:13,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:23:13,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 01:23:13,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2023-12-25 01:23:13,740 INFO L87 Difference]: Start difference. First operand 90 states and 107 transitions. Second operand has 16 states, 16 states have (on average 2.5) internal successors, (40), 14 states have internal predecessors, (40), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-25 01:23:15,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:23:15,168 INFO L93 Difference]: Finished difference Result 124 states and 153 transitions. [2023-12-25 01:23:15,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-25 01:23:15,169 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.5) internal successors, (40), 14 states have internal predecessors, (40), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 42 [2023-12-25 01:23:15,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:23:15,170 INFO L225 Difference]: With dead ends: 124 [2023-12-25 01:23:15,170 INFO L226 Difference]: Without dead ends: 120 [2023-12-25 01:23:15,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2023-12-25 01:23:15,171 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 31 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-25 01:23:15,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 246 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-25 01:23:15,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-12-25 01:23:15,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 69. [2023-12-25 01:23:15,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 58 states have (on average 1.2413793103448276) internal successors, (72), 59 states have internal predecessors, (72), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-25 01:23:15,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 83 transitions. [2023-12-25 01:23:15,199 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 83 transitions. Word has length 42 [2023-12-25 01:23:15,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:23:15,199 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 83 transitions. [2023-12-25 01:23:15,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.5) internal successors, (40), 14 states have internal predecessors, (40), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-25 01:23:15,200 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 83 transitions. [2023-12-25 01:23:15,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-25 01:23:15,200 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:23:15,200 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:23:15,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-25 01:23:15,408 WARN L477 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 [2023-12-25 01:23:15,408 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:23:15,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:23:15,409 INFO L85 PathProgramCache]: Analyzing trace with hash -2080148684, now seen corresponding path program 4 times [2023-12-25 01:23:15,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:23:15,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1767724564] [2023-12-25 01:23:15,410 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-25 01:23:15,410 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:23:15,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:23:15,411 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) [2023-12-25 01:23:15,412 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 [2023-12-25 01:23:16,954 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-25 01:23:16,954 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 01:23:16,963 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-25 01:23:16,965 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:23:18,358 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-25 01:23:18,358 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:23:36,167 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-25 01:23:36,167 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:23:36,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1767724564] [2023-12-25 01:23:36,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1767724564] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:23:36,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:23:36,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2023-12-25 01:23:36,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311566290] [2023-12-25 01:23:36,167 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:23:36,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-25 01:23:36,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:23:36,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-25 01:23:36,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2023-12-25 01:23:36,169 INFO L87 Difference]: Start difference. First operand 69 states and 83 transitions. Second operand has 24 states, 24 states have (on average 2.375) internal successors, (57), 22 states have internal predecessors, (57), 7 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-12-25 01:23:41,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.17s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 01:23:44,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.75s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 01:24:05,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 01:24:16,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:24:16,397 INFO L93 Difference]: Finished difference Result 148 states and 188 transitions. [2023-12-25 01:24:16,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-25 01:24:16,401 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.375) internal successors, (57), 22 states have internal predecessors, (57), 7 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 45 [2023-12-25 01:24:16,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:24:16,402 INFO L225 Difference]: With dead ends: 148 [2023-12-25 01:24:16,402 INFO L226 Difference]: Without dead ends: 115 [2023-12-25 01:24:16,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 35.2s TimeCoverageRelationStatistics Valid=237, Invalid=883, Unknown=2, NotChecked=0, Total=1122 [2023-12-25 01:24:16,403 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 60 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 47 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.7s IncrementalHoareTripleChecker+Time [2023-12-25 01:24:16,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 406 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 303 Invalid, 1 Unknown, 0 Unchecked, 18.7s Time] [2023-12-25 01:24:16,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-12-25 01:24:16,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 100. [2023-12-25 01:24:16,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 82 states have (on average 1.2073170731707317) internal successors, (99), 85 states have internal predecessors, (99), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-25 01:24:16,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 122 transitions. [2023-12-25 01:24:16,426 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 122 transitions. Word has length 45 [2023-12-25 01:24:16,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:24:16,427 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 122 transitions. [2023-12-25 01:24:16,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.375) internal successors, (57), 22 states have internal predecessors, (57), 7 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-12-25 01:24:16,427 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 122 transitions. [2023-12-25 01:24:16,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-25 01:24:16,427 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:24:16,428 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:24:16,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-25 01:24:16,628 WARN L477 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 [2023-12-25 01:24:16,628 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:24:16,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:24:16,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1188718228, now seen corresponding path program 5 times [2023-12-25 01:24:16,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:24:16,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [476943875] [2023-12-25 01:24:16,629 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-25 01:24:16,629 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:24:16,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:24:16,630 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) [2023-12-25 01:24:16,634 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 [2023-12-25 01:24:16,769 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-12-25 01:24:16,769 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 01:24:16,773 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-25 01:24:16,775 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:24:17,234 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 17 proven. 25 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-25 01:24:17,234 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:24:17,664 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 17 proven. 25 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-25 01:24:17,664 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:24:17,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [476943875] [2023-12-25 01:24:17,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [476943875] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:24:17,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:24:17,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2023-12-25 01:24:17,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588585663] [2023-12-25 01:24:17,665 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:24:17,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-25 01:24:17,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:24:17,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-25 01:24:17,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2023-12-25 01:24:17,667 INFO L87 Difference]: Start difference. First operand 100 states and 122 transitions. Second operand has 19 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 17 states have internal predecessors, (60), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2023-12-25 01:24:18,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:24:18,175 INFO L93 Difference]: Finished difference Result 126 states and 154 transitions. [2023-12-25 01:24:18,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-25 01:24:18,176 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 17 states have internal predecessors, (60), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 54 [2023-12-25 01:24:18,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:24:18,176 INFO L225 Difference]: With dead ends: 126 [2023-12-25 01:24:18,176 INFO L226 Difference]: Without dead ends: 100 [2023-12-25 01:24:18,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2023-12-25 01:24:18,177 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 18 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 01:24:18,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 284 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-25 01:24:18,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-12-25 01:24:18,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2023-12-25 01:24:18,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 82 states have (on average 1.1951219512195121) internal successors, (98), 85 states have internal predecessors, (98), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-25 01:24:18,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 121 transitions. [2023-12-25 01:24:18,220 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 121 transitions. Word has length 54 [2023-12-25 01:24:18,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:24:18,220 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 121 transitions. [2023-12-25 01:24:18,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 17 states have internal predecessors, (60), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2023-12-25 01:24:18,220 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 121 transitions. [2023-12-25 01:24:18,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-25 01:24:18,222 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:24:18,222 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:24:18,226 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 [2023-12-25 01:24:18,426 WARN L477 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 [2023-12-25 01:24:18,426 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:24:18,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:24:18,426 INFO L85 PathProgramCache]: Analyzing trace with hash -882275711, now seen corresponding path program 6 times [2023-12-25 01:24:18,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:24:18,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [538286987] [2023-12-25 01:24:18,429 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-25 01:24:18,429 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:24:18,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:24:18,430 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) [2023-12-25 01:24:18,433 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 [2023-12-25 01:24:51,384 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-12-25 01:24:51,385 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 01:24:51,433 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-25 01:24:51,434 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:25:36,699 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 19 proven. 26 refuted. 9 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-25 01:25:36,699 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:26:41,899 WARN L293 SmtUtils]: Spent 5.35s on a formula simplification that was a NOOP. DAG size: 51 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:27:07,252 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 01:27:07,271 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 19 proven. 35 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-25 01:27:07,271 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:27:07,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [538286987] [2023-12-25 01:27:07,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [538286987] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:27:07,271 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:27:07,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2023-12-25 01:27:07,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692129337] [2023-12-25 01:27:07,271 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:27:07,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-12-25 01:27:07,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:27:07,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-12-25 01:27:07,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=757, Unknown=12, NotChecked=0, Total=930 [2023-12-25 01:27:07,272 INFO L87 Difference]: Start difference. First operand 100 states and 121 transitions. Second operand has 31 states, 31 states have (on average 2.2903225806451615) internal successors, (71), 28 states have internal predecessors, (71), 9 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-12-25 01:27:43,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 01:27:47,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 01:27:53,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.56s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 01:28:28,415 WARN L293 SmtUtils]: Spent 24.20s on a formula simplification that was a NOOP. DAG size: 93 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:28:30,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:29:06,194 WARN L293 SmtUtils]: Spent 26.63s on a formula simplification. DAG size of input: 133 DAG size of output: 124 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:29:08,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.48s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 01:29:13,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 01:29:37,638 WARN L293 SmtUtils]: Spent 10.03s on a formula simplification. DAG size of input: 76 DAG size of output: 60 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:29:41,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 01:29:45,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 01:29:49,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 01:29:54,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 01:29:58,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 01:29:59,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:30:21,217 WARN L293 SmtUtils]: Spent 5.21s on a formula simplification. DAG size of input: 54 DAG size of output: 52 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:31:01,396 WARN L293 SmtUtils]: Spent 22.01s on a formula simplification. DAG size of input: 132 DAG size of output: 125 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:31:37,409 WARN L293 SmtUtils]: Spent 17.76s on a formula simplification. DAG size of input: 55 DAG size of output: 52 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:31:41,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.66s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 01:31:44,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.54s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 01:32:28,289 WARN L293 SmtUtils]: Spent 35.77s on a formula simplification. DAG size of input: 146 DAG size of output: 123 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:32:30,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.63s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:32:32,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:32:48,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:33:25,740 WARN L293 SmtUtils]: Spent 23.43s on a formula simplification. DAG size of input: 115 DAG size of output: 106 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:33:29,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:33:30,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:33:30,713 INFO L93 Difference]: Finished difference Result 156 states and 197 transitions. [2023-12-25 01:33:30,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-12-25 01:33:30,729 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.2903225806451615) internal successors, (71), 28 states have internal predecessors, (71), 9 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 57 [2023-12-25 01:33:30,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:33:30,730 INFO L225 Difference]: With dead ends: 156 [2023-12-25 01:33:30,730 INFO L226 Difference]: Without dead ends: 150 [2023-12-25 01:33:30,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 395.7s TimeCoverageRelationStatistics Valid=536, Invalid=2085, Unknown=31, NotChecked=0, Total=2652 [2023-12-25 01:33:30,731 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 137 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 85 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 76.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 76.7s IncrementalHoareTripleChecker+Time [2023-12-25 01:33:30,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 617 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 427 Invalid, 11 Unknown, 0 Unchecked, 76.7s Time] [2023-12-25 01:33:30,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-12-25 01:33:30,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 122. [2023-12-25 01:33:30,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 99 states have (on average 1.1919191919191918) internal successors, (118), 103 states have internal predecessors, (118), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-25 01:33:30,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 149 transitions. [2023-12-25 01:33:30,786 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 149 transitions. Word has length 57 [2023-12-25 01:33:30,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:33:30,786 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 149 transitions. [2023-12-25 01:33:30,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.2903225806451615) internal successors, (71), 28 states have internal predecessors, (71), 9 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-12-25 01:33:30,789 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 149 transitions. [2023-12-25 01:33:30,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-12-25 01:33:30,789 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:33:30,789 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:33:30,805 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 [2023-12-25 01:33:31,004 WARN L477 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 [2023-12-25 01:33:31,005 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:33:31,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:33:31,005 INFO L85 PathProgramCache]: Analyzing trace with hash 91567591, now seen corresponding path program 7 times [2023-12-25 01:33:31,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:33:31,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1501661538] [2023-12-25 01:33:31,005 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-25 01:33:31,005 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:33:31,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:33:31,007 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) [2023-12-25 01:33:31,008 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 [2023-12-25 01:33:31,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 01:33:31,111 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-25 01:33:31,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 01:33:31,251 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-25 01:33:31,251 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-25 01:33:31,252 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 01:33:31,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-12-25 01:33:31,453 WARN L477 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 [2023-12-25 01:33:31,456 INFO L445 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:33:31,458 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 01:33:31,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 01:33:31 BoogieIcfgContainer [2023-12-25 01:33:31,511 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 01:33:31,511 INFO L158 Benchmark]: Toolchain (without parser) took 643357.19ms. Allocated memory was 372.2MB in the beginning and 446.7MB in the end (delta: 74.4MB). Free memory was 319.8MB in the beginning and 304.4MB in the end (delta: 15.4MB). Peak memory consumption was 90.9MB. Max. memory is 8.0GB. [2023-12-25 01:33:31,511 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 229.6MB. Free memory was 179.5MB in the beginning and 179.3MB in the end (delta: 181.9kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 01:33:31,512 INFO L158 Benchmark]: CACSL2BoogieTranslator took 167.93ms. Allocated memory is still 372.2MB. Free memory was 319.8MB in the beginning and 308.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 01:33:31,512 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.89ms. Allocated memory is still 372.2MB. Free memory was 308.3MB in the beginning and 306.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 01:33:31,512 INFO L158 Benchmark]: Boogie Preprocessor took 37.31ms. Allocated memory is still 372.2MB. Free memory was 306.7MB in the beginning and 304.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 01:33:31,512 INFO L158 Benchmark]: RCFGBuilder took 305.45ms. Allocated memory is still 372.2MB. Free memory was 304.6MB in the beginning and 292.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-25 01:33:31,513 INFO L158 Benchmark]: TraceAbstraction took 642821.52ms. Allocated memory was 372.2MB in the beginning and 446.7MB in the end (delta: 74.4MB). Free memory was 291.0MB in the beginning and 304.4MB in the end (delta: -13.4MB). Peak memory consumption was 62.6MB. Max. memory is 8.0GB. [2023-12-25 01:33:31,515 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 229.6MB. Free memory was 179.5MB in the beginning and 179.3MB in the end (delta: 181.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 167.93ms. Allocated memory is still 372.2MB. Free memory was 319.8MB in the beginning and 308.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 20.89ms. Allocated memory is still 372.2MB. Free memory was 308.3MB in the beginning and 306.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.31ms. Allocated memory is still 372.2MB. Free memory was 306.7MB in the beginning and 304.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 305.45ms. Allocated memory is still 372.2MB. Free memory was 304.6MB in the beginning and 292.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 642821.52ms. Allocated memory was 372.2MB in the beginning and 446.7MB in the end (delta: 74.4MB). Free memory was 291.0MB in the beginning and 304.4MB in the end (delta: -13.4MB). Peak memory consumption was 62.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 - CounterExampleResult [Line: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] int counter = 0; [L27] unsigned A, B; [L28] unsigned q, r, b; [L29] A = __VERIFIER_nondet_uint() [L30] B = __VERIFIER_nondet_uint() [L31] CALL assume_abort_if_not(B < (0x7fffffff * 2U + 1U)/2) VAL [\old(cond)=1, counter=0] [L16] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, counter=0] [L31] RET assume_abort_if_not(B < (0x7fffffff * 2U + 1U)/2) VAL [B=1431655767, counter=0] [L32] CALL assume_abort_if_not(B >= 1) VAL [\old(cond)=1, counter=0] [L16] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, counter=0] [L32] RET assume_abort_if_not(B >= 1) VAL [B=1431655767, counter=0] [L33] q = 0 [L34] r = A [L35] b = B VAL [A=-1431655756, B=1431655767, b=1431655767, counter=0, q=0, r=-1431655756] [L36] EXPR counter++ VAL [A=-1431655756, B=1431655767, b=1431655767, counter=1, q=0, r=-1431655756] [L36] COND TRUE counter++<20 [L37] COND FALSE !(!(r >= b)) [L38] b = 2 * b VAL [A=-1431655756, B=1431655767, b=-1431655762, counter=1, q=0, r=-1431655756] [L36] EXPR counter++ VAL [A=-1431655756, B=1431655767, b=-1431655762, counter=2, q=0, r=-1431655756] [L36] COND TRUE counter++<20 [L37] COND FALSE !(!(r >= b)) [L38] b = 2 * b VAL [A=-1431655756, B=1431655767, b=1431655772, counter=2, q=0, r=-1431655756] [L36] EXPR counter++ VAL [A=-1431655756, B=1431655767, b=1431655772, counter=3, q=0, r=-1431655756] [L36] COND TRUE counter++<20 [L37] COND FALSE !(!(r >= b)) [L38] b = 2 * b VAL [A=-1431655756, B=1431655767, b=-1431655752, counter=3, q=0, r=-1431655756] [L36] EXPR counter++ VAL [A=-1431655756, B=1431655767, b=-1431655752, counter=4, q=0, r=-1431655756] [L36] COND TRUE counter++<20 [L37] COND TRUE !(r >= b) VAL [A=-1431655756, B=1431655767, b=-1431655752, counter=4, q=0, r=-1431655756] [L40] EXPR counter++ VAL [A=-1431655756, B=1431655767, b=-1431655752, counter=5, q=0, r=-1431655756] [L40] COND TRUE counter++<20 [L41] CALL __VERIFIER_assert(A == q * b + r) VAL [\old(cond)=1, counter=5] [L19] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L41] RET __VERIFIER_assert(A == q * b + r) VAL [A=-1431655756, B=1431655767, b=-1431655752, counter=5, q=0, r=-1431655756] [L42] COND FALSE !(!(b != B)) [L43] q = 2 * q [L44] b = b / 2 VAL [A=-1431655756, B=1431655767, b=1431655772, counter=5, q=0, r=-1431655756] [L45] COND TRUE r >= b [L46] q = q + 1 [L47] r = r - b VAL [A=-1431655756, B=1431655767, b=1431655772, counter=5, q=1, r=1431655768] [L40] EXPR counter++ VAL [A=-1431655756, B=1431655767, b=1431655772, counter=6, q=1, r=1431655768] [L40] COND TRUE counter++<20 [L41] CALL __VERIFIER_assert(A == q * b + r) VAL [\old(cond)=1, counter=6] [L19] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L41] RET __VERIFIER_assert(A == q * b + r) VAL [A=-1431655756, B=1431655767, b=1431655772, counter=6, q=1, r=1431655768] [L42] COND FALSE !(!(b != B)) [L43] q = 2 * q [L44] b = b / 2 VAL [A=-1431655756, B=1431655767, b=715827886, counter=6, q=2, r=1431655768] [L45] COND TRUE r >= b [L46] q = q + 1 [L47] r = r - b VAL [A=-1431655756, B=1431655767, b=715827886, counter=6, q=3, r=715827882] [L40] EXPR counter++ VAL [A=-1431655756, B=1431655767, b=715827886, counter=7, q=3, r=715827882] [L40] COND TRUE counter++<20 [L41] CALL __VERIFIER_assert(A == q * b + r) VAL [\old(cond)=1, counter=7] [L19] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L41] RET __VERIFIER_assert(A == q * b + r) VAL [A=-1431655756, B=1431655767, b=715827886, counter=7, q=3, r=715827882] [L42] COND FALSE !(!(b != B)) [L43] q = 2 * q [L44] b = b / 2 VAL [A=-1431655756, B=1431655767, b=357913943, counter=7, q=6, r=715827882] [L45] COND TRUE r >= b [L46] q = q + 1 [L47] r = r - b VAL [A=-1431655756, B=1431655767, b=357913943, counter=7, q=7, r=357913939] [L40] EXPR counter++ VAL [A=-1431655756, B=1431655767, b=357913943, counter=8, q=7, r=357913939] [L40] COND TRUE counter++<20 [L41] CALL __VERIFIER_assert(A == q * b + r) VAL [\old(cond)=1, counter=8] [L19] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L41] RET __VERIFIER_assert(A == q * b + r) VAL [A=-1431655756, B=1431655767, b=357913943, counter=8, q=7, r=357913939] [L42] COND FALSE !(!(b != B)) [L43] q = 2 * q [L44] b = b / 2 VAL [A=-1431655756, B=1431655767, b=178956971, counter=8, q=14, r=357913939] [L45] COND TRUE r >= b [L46] q = q + 1 [L47] r = r - b VAL [A=-1431655756, B=1431655767, b=178956971, counter=8, q=15, r=178956968] [L40] EXPR counter++ VAL [A=-1431655756, B=1431655767, b=178956971, counter=9, q=15, r=178956968] [L40] COND TRUE counter++<20 [L41] CALL __VERIFIER_assert(A == q * b + r) VAL [\old(cond)=0, counter=9] [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=9] [L21] reach_error() VAL [\old(cond)=0, cond=0, counter=9] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 642.7s, OverallIterations: 14, TraceHistogramMax: 5, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 431.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 12 mSolverCounterUnknown, 663 SdHoareTripleChecker+Valid, 99.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 649 mSDsluCounter, 2672 SdHoareTripleChecker+Invalid, 98.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2309 mSDsCounter, 262 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1643 IncrementalHoareTripleChecker+Invalid, 1917 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 262 mSolverCounterUnsat, 363 mSDtfsCounter, 1643 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 861 GetRequests, 646 SyntacticMatches, 2 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1314 ImplicationChecksByTransitivity, 447.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=13, InterpolantAutomatonStates: 163, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 229 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 35.1s SatisfiabilityAnalysisTime, 172.1s InterpolantComputationTime, 516 NumberOfCodeBlocks, 507 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 786 ConstructedInterpolants, 80 QuantifiedInterpolants, 9621 SizeOfPredicates, 31 NumberOfNonLiveVariables, 829 ConjunctsInSsa, 140 ConjunctsInUnsatCore, 22 InterpolantComputations, 5 PerfectInterpolantSequences, 314/570 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-12-25 01:33:31,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...