/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/dijkstra-u_valuebound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 01:10:05,050 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 01:10:05,120 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:10:05,124 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 01:10:05,125 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 01:10:05,147 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 01:10:05,148 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 01:10:05,148 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 01:10:05,148 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 01:10:05,151 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 01:10:05,152 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 01:10:05,152 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 01:10:05,152 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 01:10:05,153 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 01:10:05,153 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 01:10:05,154 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 01:10:05,154 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 01:10:05,154 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 01:10:05,154 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 01:10:05,154 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 01:10:05,154 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 01:10:05,155 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 01:10:05,155 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 01:10:05,155 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 01:10:05,155 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 01:10:05,155 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 01:10:05,155 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 01:10:05,156 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 01:10:05,156 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 01:10:05,156 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 01:10:05,157 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 01:10:05,157 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 01:10:05,157 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 01:10:05,157 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 01:10:05,157 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 01:10:05,157 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 01:10:05,157 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 01:10:05,158 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 01:10:05,158 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 01:10:05,158 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 01:10:05,158 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 01:10:05,158 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 01:10:05,158 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 01:10:05,158 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 01:10:05,159 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 01:10:05,159 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 01:10:05,159 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:10:05,364 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 01:10:05,384 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 01:10:05,387 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 01:10:05,388 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 01:10:05,388 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 01:10:05,390 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound5.c [2023-12-25 01:10:06,433 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 01:10:06,570 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 01:10:06,571 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound5.c [2023-12-25 01:10:06,576 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfb447f0d/ead02eb789a14c739a4f8ddec31780f3/FLAG651511c9c [2023-12-25 01:10:06,587 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfb447f0d/ead02eb789a14c739a4f8ddec31780f3 [2023-12-25 01:10:06,590 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 01:10:06,591 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 01:10:06,594 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 01:10:06,594 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 01:10:06,597 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 01:10:06,598 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 01:10:06" (1/1) ... [2023-12-25 01:10:06,598 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@779644c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:10:06, skipping insertion in model container [2023-12-25 01:10:06,598 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 01:10:06" (1/1) ... [2023-12-25 01:10:06,619 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 01:10:06,747 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/dijkstra-u_valuebound5.c[525,538] [2023-12-25 01:10:06,786 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 01:10:06,802 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 01:10:06,814 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/dijkstra-u_valuebound5.c[525,538] [2023-12-25 01:10:06,835 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 01:10:06,847 INFO L206 MainTranslator]: Completed translation [2023-12-25 01:10:06,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:10:06 WrapperNode [2023-12-25 01:10:06,848 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 01:10:06,849 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 01:10:06,849 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 01:10:06,849 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 01:10:06,854 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:10:06" (1/1) ... [2023-12-25 01:10:06,866 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:10:06" (1/1) ... [2023-12-25 01:10:06,887 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 53 [2023-12-25 01:10:06,887 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 01:10:06,888 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 01:10:06,888 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 01:10:06,888 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 01:10:06,896 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:10:06" (1/1) ... [2023-12-25 01:10:06,896 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:10:06" (1/1) ... [2023-12-25 01:10:06,900 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:10:06" (1/1) ... [2023-12-25 01:10:06,912 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:10:06,913 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:10:06" (1/1) ... [2023-12-25 01:10:06,913 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:10:06" (1/1) ... [2023-12-25 01:10:06,920 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:10:06" (1/1) ... [2023-12-25 01:10:06,923 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:10:06" (1/1) ... [2023-12-25 01:10:06,924 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:10:06" (1/1) ... [2023-12-25 01:10:06,924 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:10:06" (1/1) ... [2023-12-25 01:10:06,926 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 01:10:06,926 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 01:10:06,926 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 01:10:06,926 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 01:10:06,927 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:10:06" (1/1) ... [2023-12-25 01:10:06,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 01:10:06,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 01:10:06,974 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:10:06,986 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:10:07,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 01:10:07,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 01:10:07,017 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-25 01:10:07,018 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-25 01:10:07,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 01:10:07,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 01:10:07,018 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 01:10:07,019 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 01:10:07,066 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 01:10:07,069 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 01:10:07,275 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 01:10:07,308 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 01:10:07,309 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-25 01:10:07,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 01:10:07 BoogieIcfgContainer [2023-12-25 01:10:07,309 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 01:10:07,310 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 01:10:07,311 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 01:10:07,313 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 01:10:07,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 01:10:06" (1/3) ... [2023-12-25 01:10:07,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fe077ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 01:10:07, skipping insertion in model container [2023-12-25 01:10:07,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:10:06" (2/3) ... [2023-12-25 01:10:07,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fe077ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 01:10:07, skipping insertion in model container [2023-12-25 01:10:07,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 01:10:07" (3/3) ... [2023-12-25 01:10:07,315 INFO L112 eAbstractionObserver]: Analyzing ICFG dijkstra-u_valuebound5.c [2023-12-25 01:10:07,329 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 01:10:07,330 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 01:10:07,368 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 01:10:07,373 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;@528d1f11, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 01:10:07,373 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 01:10:07,376 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-25 01:10:07,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-25 01:10:07,382 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:10:07,382 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:10:07,383 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:10:07,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:10:07,388 INFO L85 PathProgramCache]: Analyzing trace with hash -10312671, now seen corresponding path program 1 times [2023-12-25 01:10:07,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:10:07,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1558431669] [2023-12-25 01:10:07,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:10:07,397 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:10:07,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:10:07,399 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:10:07,420 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:10:07,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:10:07,496 INFO L262 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 01:10:07,499 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:10:07,518 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:10:07,518 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 01:10:07,519 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:10:07,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1558431669] [2023-12-25 01:10:07,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1558431669] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 01:10:07,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 01:10:07,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 01:10:07,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28627582] [2023-12-25 01:10:07,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:10:07,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 01:10:07,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:10:07,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 01:10:07,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 01:10:07,552 INFO L87 Difference]: Start difference. First operand has 30 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) 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:10:07,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:10:07,579 INFO L93 Difference]: Finished difference Result 58 states and 102 transitions. [2023-12-25 01:10:07,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 01:10:07,581 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:10:07,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:10:07,586 INFO L225 Difference]: With dead ends: 58 [2023-12-25 01:10:07,586 INFO L226 Difference]: Without dead ends: 28 [2023-12-25 01:10:07,590 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:10:07,593 INFO L413 NwaCegarLoop]: 39 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, 39 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:10:07,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 01:10:07,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-25 01:10:07,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-12-25 01:10:07,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-25 01:10:07,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2023-12-25 01:10:07,625 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 18 [2023-12-25 01:10:07,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:10:07,626 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2023-12-25 01:10:07,626 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:10:07,627 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2023-12-25 01:10:07,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-25 01:10:07,628 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:10:07,628 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:10:07,632 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:10:07,832 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:10:07,833 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:10:07,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:10:07,834 INFO L85 PathProgramCache]: Analyzing trace with hash 763841584, now seen corresponding path program 1 times [2023-12-25 01:10:07,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:10:07,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1289379385] [2023-12-25 01:10:07,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:10:07,835 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:10:07,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:10:07,836 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:10:07,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-25 01:10:07,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:10:07,871 INFO L262 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-25 01:10:07,873 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:10:08,071 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:10:08,071 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:10:08,225 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:10:08,225 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:10:08,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1289379385] [2023-12-25 01:10:08,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1289379385] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 01:10:08,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 01:10:08,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2023-12-25 01:10:08,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402070115] [2023-12-25 01:10:08,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:10:08,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 01:10:08,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:10:08,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 01:10:08,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2023-12-25 01:10:08,228 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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:10:10,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:10:10,053 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2023-12-25 01:10:10,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 01:10:10,068 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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 19 [2023-12-25 01:10:10,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:10:10,070 INFO L225 Difference]: With dead ends: 47 [2023-12-25 01:10:10,070 INFO L226 Difference]: Without dead ends: 45 [2023-12-25 01:10:10,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-12-25 01:10:10,071 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 8 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-25 01:10:10,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 149 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-25 01:10:10,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-12-25 01:10:10,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 36. [2023-12-25 01:10:10,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-25 01:10:10,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2023-12-25 01:10:10,079 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 19 [2023-12-25 01:10:10,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:10:10,079 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2023-12-25 01:10:10,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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:10:10,080 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2023-12-25 01:10:10,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-25 01:10:10,080 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:10:10,080 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:10:10,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-25 01:10:10,282 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:10:10,283 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:10:10,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:10:10,283 INFO L85 PathProgramCache]: Analyzing trace with hash -82339253, now seen corresponding path program 1 times [2023-12-25 01:10:10,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:10:10,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [498004547] [2023-12-25 01:10:10,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:10:10,284 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:10:10,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:10:10,287 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:10:10,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-25 01:10:10,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:10:10,309 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-25 01:10:10,311 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:10:10,752 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-25 01:10:10,753 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:10:11,155 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:10:11,155 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:10:11,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [498004547] [2023-12-25 01:10:11,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [498004547] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:10:11,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:10:11,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2023-12-25 01:10:11,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000132453] [2023-12-25 01:10:11,156 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:10:11,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-25 01:10:11,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:10:11,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-25 01:10:11,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2023-12-25 01:10:11,157 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand has 15 states, 15 states have (on average 1.6) internal successors, (24), 12 states have internal predecessors, (24), 4 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:10:17,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:10:21,244 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 [] [2023-12-25 01:10:25,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:10:34,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:10:38,069 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 [] [2023-12-25 01:10:42,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:10:46,487 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 [] [2023-12-25 01:10:51,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:10:55,015 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 [] [2023-12-25 01:10:55,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:10:55,015 INFO L93 Difference]: Finished difference Result 128 states and 204 transitions. [2023-12-25 01:10:55,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-25 01:10:55,031 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6) internal successors, (24), 12 states have internal predecessors, (24), 4 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 21 [2023-12-25 01:10:55,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:10:55,033 INFO L225 Difference]: With dead ends: 128 [2023-12-25 01:10:55,033 INFO L226 Difference]: Without dead ends: 108 [2023-12-25 01:10:55,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2023-12-25 01:10:55,035 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 52 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 122 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 43.3s IncrementalHoareTripleChecker+Time [2023-12-25 01:10:55,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 381 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 386 Invalid, 8 Unknown, 0 Unchecked, 43.3s Time] [2023-12-25 01:10:55,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-12-25 01:10:55,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 74. [2023-12-25 01:10:55,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 33 states have call successors, (33), 4 states have call predecessors, (33), 4 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2023-12-25 01:10:55,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 109 transitions. [2023-12-25 01:10:55,062 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 109 transitions. Word has length 21 [2023-12-25 01:10:55,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:10:55,063 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 109 transitions. [2023-12-25 01:10:55,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.6) internal successors, (24), 12 states have internal predecessors, (24), 4 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:10:55,063 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 109 transitions. [2023-12-25 01:10:55,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-25 01:10:55,064 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:10:55,064 INFO L195 NwaCegarLoop]: trace histogram [3, 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:10:55,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-25 01:10:55,266 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:10:55,266 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:10:55,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:10:55,267 INFO L85 PathProgramCache]: Analyzing trace with hash -93184560, now seen corresponding path program 1 times [2023-12-25 01:10:55,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:10:55,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [211899210] [2023-12-25 01:10:55,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:10:55,267 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:10:55,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:10:55,268 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:10:55,270 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:10:55,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:10:55,441 INFO L262 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 01:10:55,443 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:10:55,747 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-25 01:10:55,747 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:10:59,533 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:10:59,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [211899210] [2023-12-25 01:10:59,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [211899210] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 01:10:59,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1542096376] [2023-12-25 01:10:59,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:10:59,533 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 01:10:59,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 01:10:59,566 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 01:10:59,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2023-12-25 01:10:59,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:10:59,817 INFO L262 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 01:10:59,819 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:11:00,276 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-25 01:11:00,276 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 01:11:00,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1542096376] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 01:11:00,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 01:11:00,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2023-12-25 01:11:00,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174550789] [2023-12-25 01:11:00,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:11:00,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 01:11:00,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:11:00,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 01:11:00,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-12-25 01:11:00,278 INFO L87 Difference]: Start difference. First operand 74 states and 109 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-25 01:11:02,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:11:02,506 INFO L93 Difference]: Finished difference Result 95 states and 137 transitions. [2023-12-25 01:11:02,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 01:11:02,519 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2023-12-25 01:11:02,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:11:02,521 INFO L225 Difference]: With dead ends: 95 [2023-12-25 01:11:02,521 INFO L226 Difference]: Without dead ends: 79 [2023-12-25 01:11:02,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2023-12-25 01:11:02,522 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 7 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-25 01:11:02,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 122 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-25 01:11:02,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-12-25 01:11:02,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2023-12-25 01:11:02,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 43 states have internal predecessors, (48), 34 states have call successors, (34), 5 states have call predecessors, (34), 5 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-25 01:11:02,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 114 transitions. [2023-12-25 01:11:02,544 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 114 transitions. Word has length 29 [2023-12-25 01:11:02,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:11:02,544 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 114 transitions. [2023-12-25 01:11:02,545 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-25 01:11:02,545 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 114 transitions. [2023-12-25 01:11:02,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-25 01:11:02,545 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:11:02,545 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:11:02,553 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:11:02,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2023-12-25 01:11:02,957 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,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-25 01:11:02,957 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:11:02,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:11:02,958 INFO L85 PathProgramCache]: Analyzing trace with hash 471953405, now seen corresponding path program 1 times [2023-12-25 01:11:02,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:11:02,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [22060151] [2023-12-25 01:11:02,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:11:02,958 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:11:02,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:11:02,960 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:11:02,962 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:11:03,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:11:03,021 INFO L262 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 01:11:03,023 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:11:03,600 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-25 01:11:03,600 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:11:08,257 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:11:08,257 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:11:08,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [22060151] [2023-12-25 01:11:08,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [22060151] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:11:08,258 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:11:08,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2023-12-25 01:11:08,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879277617] [2023-12-25 01:11:08,258 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:11:08,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-25 01:11:08,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:11:08,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-25 01:11:08,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2023-12-25 01:11:08,259 INFO L87 Difference]: Start difference. First operand 79 states and 114 transitions. Second operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 12 states have internal predecessors, (31), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-25 01:11:14,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:11:18,848 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 [] [2023-12-25 01:11:23,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:11:27,240 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 [] [2023-12-25 01:11:31,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:11:35,989 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 [] [2023-12-25 01:11:41,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:11:45,391 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 [] [2023-12-25 01:11:52,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:11:56,779 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 [] [2023-12-25 01:12:01,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:12:05,272 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 [] [2023-12-25 01:12:11,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:12:15,463 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 [] [2023-12-25 01:12:15,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:12:15,481 INFO L93 Difference]: Finished difference Result 155 states and 230 transitions. [2023-12-25 01:12:15,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-25 01:12:15,482 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 12 states have internal predecessors, (31), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 28 [2023-12-25 01:12:15,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:12:15,483 INFO L225 Difference]: With dead ends: 155 [2023-12-25 01:12:15,483 INFO L226 Difference]: Without dead ends: 113 [2023-12-25 01:12:15,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2023-12-25 01:12:15,484 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 34 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 48 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 64.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 65.9s IncrementalHoareTripleChecker+Time [2023-12-25 01:12:15,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 417 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 311 Invalid, 14 Unknown, 0 Unchecked, 65.9s Time] [2023-12-25 01:12:15,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-12-25 01:12:15,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 99. [2023-12-25 01:12:15,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 49 states have internal predecessors, (53), 45 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2023-12-25 01:12:15,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 142 transitions. [2023-12-25 01:12:15,538 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 142 transitions. Word has length 28 [2023-12-25 01:12:15,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:12:15,538 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 142 transitions. [2023-12-25 01:12:15,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 12 states have internal predecessors, (31), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-25 01:12:15,539 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 142 transitions. [2023-12-25 01:12:15,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-25 01:12:15,539 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:12:15,539 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:12:15,547 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 (7)] Forceful destruction successful, exit code 0 [2023-12-25 01:12:15,748 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:12:15,749 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:12:15,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:12:15,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1319121432, now seen corresponding path program 1 times [2023-12-25 01:12:15,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:12:15,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1425524025] [2023-12-25 01:12:15,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:12:15,750 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:12:15,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:12:15,751 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:12:15,784 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:12:15,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:12:16,012 INFO L262 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 01:12:16,014 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:12:16,691 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-25 01:12:16,691 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:13:01,053 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-25 01:13:01,053 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:13:01,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1425524025] [2023-12-25 01:13:01,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1425524025] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:13:01,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:13:01,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2023-12-25 01:13:01,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744346848] [2023-12-25 01:13:01,054 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:13:01,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-25 01:13:01,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:13:01,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-25 01:13:01,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2023-12-25 01:13:01,055 INFO L87 Difference]: Start difference. First operand 99 states and 142 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 12 states have internal predecessors, (27), 4 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-12-25 01:13:20,673 WARN L293 SmtUtils]: Spent 6.71s on a formula simplification that was a NOOP. DAG size: 52 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:13:26,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:13:27,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:13:33,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:13:38,470 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:13:41,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.67s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:13:42,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:13:46,582 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:13:50,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:13:52,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:13:56,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:13:57,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:14:04,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:14:10,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:14:10,044 INFO L93 Difference]: Finished difference Result 116 states and 156 transitions. [2023-12-25 01:14:10,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-25 01:14:10,103 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 12 states have internal predecessors, (27), 4 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 36 [2023-12-25 01:14:10,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:14:10,104 INFO L225 Difference]: With dead ends: 116 [2023-12-25 01:14:10,104 INFO L226 Difference]: Without dead ends: 114 [2023-12-25 01:14:10,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 45.8s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2023-12-25 01:14:10,107 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 33 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 43 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 50.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 53.3s IncrementalHoareTripleChecker+Time [2023-12-25 01:14:10,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 197 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 243 Invalid, 2 Unknown, 0 Unchecked, 53.3s Time] [2023-12-25 01:14:10,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-12-25 01:14:10,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2023-12-25 01:14:10,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 58 states have internal predecessors, (62), 45 states have call successors, (45), 10 states have call predecessors, (45), 10 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2023-12-25 01:14:10,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 151 transitions. [2023-12-25 01:14:10,154 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 151 transitions. Word has length 36 [2023-12-25 01:14:10,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:14:10,154 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 151 transitions. [2023-12-25 01:14:10,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 12 states have internal predecessors, (27), 4 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-12-25 01:14:10,154 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 151 transitions. [2023-12-25 01:14:10,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-25 01:14:10,155 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:14:10,155 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:14:10,167 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:14:10,356 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:14:10,356 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:14:10,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:14:10,357 INFO L85 PathProgramCache]: Analyzing trace with hash -2119770422, now seen corresponding path program 1 times [2023-12-25 01:14:10,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:14:10,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [102107718] [2023-12-25 01:14:10,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:14:10,357 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:14:10,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:14:10,358 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:14:10,359 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:14:10,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:14:10,691 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-25 01:14:10,693 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:14:11,823 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2023-12-25 01:14:11,824 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:14:13,960 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-12-25 01:14:13,962 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:14:13,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [102107718] [2023-12-25 01:14:13,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [102107718] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:14:13,964 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:14:13,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2023-12-25 01:14:13,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742349522] [2023-12-25 01:14:13,966 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:14:13,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-25 01:14:13,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:14:13,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-25 01:14:13,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2023-12-25 01:14:13,969 INFO L87 Difference]: Start difference. First operand 111 states and 151 transitions. Second operand has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 16 states have internal predecessors, (33), 6 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2023-12-25 01:14:20,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.75s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:14:21,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:14:26,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.80s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:14:30,611 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 [] [2023-12-25 01:14:40,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:14:40,774 INFO L93 Difference]: Finished difference Result 173 states and 248 transitions. [2023-12-25 01:14:40,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-25 01:14:40,779 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 16 states have internal predecessors, (33), 6 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 54 [2023-12-25 01:14:40,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:14:40,780 INFO L225 Difference]: With dead ends: 173 [2023-12-25 01:14:40,780 INFO L226 Difference]: Without dead ends: 144 [2023-12-25 01:14:40,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2023-12-25 01:14:40,782 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 71 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 184 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.0s IncrementalHoareTripleChecker+Time [2023-12-25 01:14:40,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 414 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 407 Invalid, 1 Unknown, 0 Unchecked, 25.0s Time] [2023-12-25 01:14:40,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-12-25 01:14:40,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 119. [2023-12-25 01:14:40,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 62 states have (on average 1.096774193548387) internal successors, (68), 65 states have internal predecessors, (68), 44 states have call successors, (44), 12 states have call predecessors, (44), 12 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43) [2023-12-25 01:14:40,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 155 transitions. [2023-12-25 01:14:40,826 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 155 transitions. Word has length 54 [2023-12-25 01:14:40,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:14:40,826 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 155 transitions. [2023-12-25 01:14:40,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 16 states have internal predecessors, (33), 6 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2023-12-25 01:14:40,826 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 155 transitions. [2023-12-25 01:14:40,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-25 01:14:40,827 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:14:40,827 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:14:40,839 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:14:41,040 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:14:41,040 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:14:41,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:14:41,043 INFO L85 PathProgramCache]: Analyzing trace with hash -749177843, now seen corresponding path program 1 times [2023-12-25 01:14:41,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:14:41,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [16069298] [2023-12-25 01:14:41,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:14:41,044 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:14:41,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:14:41,048 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:14:41,049 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:14:41,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:14:41,396 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 01:14:41,398 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:14:42,328 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2023-12-25 01:14:42,328 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:14:42,974 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-12-25 01:14:42,975 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:14:42,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [16069298] [2023-12-25 01:14:42,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [16069298] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:14:42,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:14:42,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2023-12-25 01:14:42,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142231503] [2023-12-25 01:14:42,975 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:14:42,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-25 01:14:42,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:14:42,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-25 01:14:42,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-12-25 01:14:42,976 INFO L87 Difference]: Start difference. First operand 119 states and 155 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2023-12-25 01:14:46,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:14:46,041 INFO L93 Difference]: Finished difference Result 143 states and 187 transitions. [2023-12-25 01:14:46,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 01:14:46,042 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 56 [2023-12-25 01:14:46,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:14:46,047 INFO L225 Difference]: With dead ends: 143 [2023-12-25 01:14:46,047 INFO L226 Difference]: Without dead ends: 102 [2023-12-25 01:14:46,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2023-12-25 01:14:46,054 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 32 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-12-25 01:14:46,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 310 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-12-25 01:14:46,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-12-25 01:14:46,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2023-12-25 01:14:46,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 57 states have (on average 1.0701754385964912) internal successors, (61), 59 states have internal predecessors, (61), 30 states have call successors, (30), 12 states have call predecessors, (30), 12 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2023-12-25 01:14:46,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 120 transitions. [2023-12-25 01:14:46,090 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 120 transitions. Word has length 56 [2023-12-25 01:14:46,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:14:46,091 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 120 transitions. [2023-12-25 01:14:46,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2023-12-25 01:14:46,091 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 120 transitions. [2023-12-25 01:14:46,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-25 01:14:46,094 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:14:46,094 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:14:46,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-12-25 01:14:46,295 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:14:46,296 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:14:46,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:14:46,296 INFO L85 PathProgramCache]: Analyzing trace with hash -665291431, now seen corresponding path program 2 times [2023-12-25 01:14:46,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:14:46,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2069523036] [2023-12-25 01:14:46,296 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 01:14:46,297 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:14:46,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:14:46,307 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:14:46,322 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:14:46,620 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 01:14:46,620 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 01:14:46,649 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-25 01:14:46,651 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:14:48,109 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 31 proven. 9 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2023-12-25 01:14:48,109 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:15:16,841 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 31 proven. 6 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-12-25 01:15:16,841 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:15:16,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2069523036] [2023-12-25 01:15:16,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2069523036] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:15:16,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:15:16,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 22 [2023-12-25 01:15:16,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687160159] [2023-12-25 01:15:16,842 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:15:16,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-25 01:15:16,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:15:16,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-25 01:15:16,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2023-12-25 01:15:16,843 INFO L87 Difference]: Start difference. First operand 100 states and 120 transitions. Second operand has 22 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 19 states have internal predecessors, (38), 7 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2023-12-25 01:15:34,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:15:40,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.45s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:15:44,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.65s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:16:04,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.63s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:16:15,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:16:19,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:16:22,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:16:24,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:16:30,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:16:30,430 INFO L93 Difference]: Finished difference Result 127 states and 157 transitions. [2023-12-25 01:16:30,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-25 01:16:30,471 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 19 states have internal predecessors, (38), 7 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) Word has length 59 [2023-12-25 01:16:30,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:16:30,472 INFO L225 Difference]: With dead ends: 127 [2023-12-25 01:16:30,472 INFO L226 Difference]: Without dead ends: 125 [2023-12-25 01:16:30,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 39.9s TimeCoverageRelationStatistics Valid=148, Invalid=722, Unknown=0, NotChecked=0, Total=870 [2023-12-25 01:16:30,472 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 43 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 49.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 53.1s IncrementalHoareTripleChecker+Time [2023-12-25 01:16:30,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 382 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 53.1s Time] [2023-12-25 01:16:30,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-12-25 01:16:30,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 111. [2023-12-25 01:16:30,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 63 states have (on average 1.0634920634920635) internal successors, (67), 66 states have internal predecessors, (67), 33 states have call successors, (33), 14 states have call predecessors, (33), 14 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-25 01:16:30,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 132 transitions. [2023-12-25 01:16:30,516 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 132 transitions. Word has length 59 [2023-12-25 01:16:30,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:16:30,521 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 132 transitions. [2023-12-25 01:16:30,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 19 states have internal predecessors, (38), 7 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2023-12-25 01:16:30,521 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 132 transitions. [2023-12-25 01:16:30,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-25 01:16:30,523 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:16:30,523 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:16:30,539 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:16:30,736 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:16:30,736 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:16:30,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:16:30,737 INFO L85 PathProgramCache]: Analyzing trace with hash -212420630, now seen corresponding path program 3 times [2023-12-25 01:16:30,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:16:30,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1368823327] [2023-12-25 01:16:30,737 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 01:16:30,737 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:16:30,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:16:30,738 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:16:30,741 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:16:30,848 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-25 01:16:30,848 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 01:16:30,858 INFO L262 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-25 01:16:30,859 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:16:32,301 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2023-12-25 01:16:32,301 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:18:08,154 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2023-12-25 01:18:08,155 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:18:08,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1368823327] [2023-12-25 01:18:08,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1368823327] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:18:08,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:18:08,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2023-12-25 01:18:08,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969396779] [2023-12-25 01:18:08,155 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:18:08,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-25 01:18:08,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:18:08,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-25 01:18:08,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2023-12-25 01:18:08,156 INFO L87 Difference]: Start difference. First operand 111 states and 132 transitions. Second operand has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 16 states have internal predecessors, (33), 6 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) [2023-12-25 01:18:16,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:18:48,403 WARN L293 SmtUtils]: Spent 10.44s on a formula simplification that was a NOOP. DAG size: 110 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:19:01,931 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 [] [2023-12-25 01:19:18,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:19:21,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.83s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:19:23,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:19:27,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.03s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:19:29,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:19:34,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:19:38,107 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 [] [2023-12-25 01:19:42,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:19:44,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:19:46,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:19:48,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:19:49,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:19:52,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:19:55,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:20:52,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:20:57,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:20:57,000 INFO L93 Difference]: Finished difference Result 143 states and 178 transitions. [2023-12-25 01:20:57,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-25 01:20:57,093 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 16 states have internal predecessors, (33), 6 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) Word has length 64 [2023-12-25 01:20:57,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:20:57,094 INFO L225 Difference]: With dead ends: 143 [2023-12-25 01:20:57,094 INFO L226 Difference]: Without dead ends: 93 [2023-12-25 01:20:57,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 131.6s TimeCoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2023-12-25 01:20:57,095 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 39 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 66 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 92.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 102.3s IncrementalHoareTripleChecker+Time [2023-12-25 01:20:57,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 453 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 427 Invalid, 2 Unknown, 0 Unchecked, 102.3s Time] [2023-12-25 01:20:57,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-12-25 01:20:57,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 73. [2023-12-25 01:20:57,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 43 states have (on average 1.069767441860465) internal successors, (46), 45 states have internal predecessors, (46), 20 states have call successors, (20), 9 states have call predecessors, (20), 9 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-25 01:20:57,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 85 transitions. [2023-12-25 01:20:57,161 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 85 transitions. Word has length 64 [2023-12-25 01:20:57,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:20:57,161 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 85 transitions. [2023-12-25 01:20:57,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 16 states have internal predecessors, (33), 6 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) [2023-12-25 01:20:57,161 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2023-12-25 01:20:57,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-25 01:20:57,162 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:20:57,162 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 3, 2, 2, 2, 2, 2, 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:20:57,169 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:20:57,369 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:20:57,370 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:20:57,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:20:57,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1791652116, now seen corresponding path program 4 times [2023-12-25 01:20:57,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:20:57,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [662823721] [2023-12-25 01:20:57,371 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-25 01:20:57,372 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:20:57,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:20:57,373 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:20:57,385 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:20:57,884 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-25 01:20:57,885 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 01:20:57,941 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-25 01:20:57,943 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:21:00,556 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 38 proven. 18 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2023-12-25 01:21:00,556 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:22:22,251 WARN L293 SmtUtils]: Spent 7.34s on a formula simplification that was a NOOP. DAG size: 57 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:24:26,584 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (bvudiv (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~q~0#1|) (_ bv4 32)))) (let ((.cse4 (bvadd .cse1 |c_ULTIMATE.start_main_~p~0#1|))) (let ((.cse0 (bvmul .cse1 |c_ULTIMATE.start_main_~n~0#1|)) (.cse3 (bvudiv |c_ULTIMATE.start_main_~p~0#1| (_ bv2 32))) (.cse2 (bvneg .cse4))) (or (not (bvule |c_ULTIMATE.start_main_~q~0#1| |c_ULTIMATE.start_main_~n~0#1|)) (not (= .cse0 (bvadd (bvmul .cse1 |c_ULTIMATE.start_main_~r~0#1|) (bvmul .cse1 .cse2) (bvmul .cse3 .cse3) (bvmul .cse1 .cse1) (bvmul (_ bv2 32) (bvmul .cse3 .cse1))))) (= (let ((.cse5 (bvadd .cse2 |c_ULTIMATE.start_main_~r~0#1|))) (bvadd (bvneg (bvmul (bvmul .cse4 .cse4) .cse5)) (bvmul (bvmul .cse1 .cse2 |c_ULTIMATE.start_main_~p~0#1|) (_ bv4 32)) (bvmul (_ bv4 32) (bvmul .cse3 |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~p~0#1|)) (bvmul (bvmul .cse1 .cse1 |c_ULTIMATE.start_main_~r~0#1|) (_ bv5 32)) (bvneg (bvmul (bvmul .cse1 (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~n~0#1|)) .cse5)) (bvneg (bvmul (bvadd .cse3 .cse1) (bvmul (bvadd (bvmul (_ bv4 32) .cse1) (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1|)) |c_ULTIMATE.start_main_~n~0#1|))) (bvmul (_ bv4 32) (bvmul .cse1 .cse2 .cse2)) (bvmul (_ bv4 32) (bvmul .cse1 |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~p~0#1|)) (bvneg (bvmul .cse1 .cse0)) (bvmul (_ bv4 32) (bvmul .cse3 .cse2 |c_ULTIMATE.start_main_~p~0#1|)) (bvmul (_ bv2 32) (bvmul .cse1 |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~p~0#1|)) (bvmul (_ bv4 32) (bvmul .cse1 |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) (bvmul |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~p~0#1| |c_ULTIMATE.start_main_~p~0#1|) (bvmul (_ bv8 32) (bvmul .cse1 .cse2 |c_ULTIMATE.start_main_~r~0#1|)) (bvmul (_ bv4 32) (bvmul .cse3 .cse1 .cse2)) (bvmul (_ bv4 32) (bvmul .cse3 .cse1 |c_ULTIMATE.start_main_~r~0#1|)) (bvmul (_ bv4 32) (bvmul .cse1 |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~n~0#1|)) (bvmul .cse1 .cse1 |c_ULTIMATE.start_main_~n~0#1|) (bvmul (bvmul .cse1 .cse1 .cse2) (_ bv5 32)))) (_ bv0 32)))))) is different from true [2023-12-25 01:24:39,208 WARN L293 SmtUtils]: Spent 5.04s on a formula simplification that was a NOOP. DAG size: 63 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 01:24:45,878 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (bvudiv (bvmul (_ bv16 32) |c_ULTIMATE.start_main_~q~0#1|) (_ bv4 32)))) (let ((.cse5 (bvadd .cse2 |c_ULTIMATE.start_main_~p~0#1|))) (let ((.cse0 (bvmul .cse2 |c_ULTIMATE.start_main_~n~0#1|)) (.cse3 (bvudiv |c_ULTIMATE.start_main_~p~0#1| (_ bv2 32))) (.cse1 (bvneg .cse5))) (or (not (bvule (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~q~0#1|) |c_ULTIMATE.start_main_~n~0#1|)) (not (= .cse0 (bvadd (bvmul .cse1 .cse2) (bvmul .cse2 .cse2) (bvmul (_ bv2 32) (bvmul .cse3 .cse2)) (bvmul .cse3 .cse3) (bvmul .cse2 |c_ULTIMATE.start_main_~r~0#1|)))) (= (_ bv0 32) (let ((.cse4 (bvadd .cse1 |c_ULTIMATE.start_main_~r~0#1|))) (bvadd (bvneg (bvmul .cse4 (bvmul (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~n~0#1|) .cse2))) (bvmul (_ bv4 32) (bvmul .cse3 |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~p~0#1|)) (bvmul (_ bv2 32) (bvmul .cse2 |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~p~0#1|)) (bvneg (bvmul .cse2 .cse0)) (bvmul (_ bv8 32) (bvmul .cse1 .cse2 |c_ULTIMATE.start_main_~r~0#1|)) (bvmul .cse2 .cse2 |c_ULTIMATE.start_main_~n~0#1|) (bvmul (_ bv4 32) (bvmul .cse1 .cse1 .cse2)) (bvmul (_ bv4 32) (bvmul .cse2 |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) (bvmul (_ bv4 32) (bvmul .cse1 .cse3 |c_ULTIMATE.start_main_~p~0#1|)) (bvmul (bvmul .cse2 |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~p~0#1|) (_ bv4 32)) (bvneg (bvmul (bvmul (bvadd (bvmul (_ bv4 32) .cse2) (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1|)) |c_ULTIMATE.start_main_~n~0#1|) (bvadd .cse3 .cse2))) (bvmul (bvmul .cse2 .cse2 |c_ULTIMATE.start_main_~r~0#1|) (_ bv5 32)) (bvmul (_ bv4 32) (bvmul .cse3 .cse2 |c_ULTIMATE.start_main_~r~0#1|)) (bvmul (_ bv4 32) (bvmul .cse2 |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~n~0#1|)) (bvmul (bvmul .cse1 .cse2 .cse2) (_ bv5 32)) (bvmul |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~p~0#1| |c_ULTIMATE.start_main_~p~0#1|) (bvneg (bvmul .cse4 (bvmul .cse5 .cse5))) (bvmul (_ bv4 32) (bvmul .cse1 .cse3 .cse2)) (bvmul (_ bv4 32) (bvmul .cse1 .cse2 |c_ULTIMATE.start_main_~p~0#1|))))))))) is different from true Received shutdown request... [2023-12-25 01:24:50,396 WARN L340 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)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 01:24:50,397 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 01:24:51,047 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 01:24:51,067 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:51,248 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:51,248 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 72 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-3-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ATOM-1 context. [2023-12-25 01:24:51,252 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:24:51,261 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 01:24:51,263 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 01:24:51 BoogieIcfgContainer [2023-12-25 01:24:51,263 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 01:24:51,264 INFO L158 Benchmark]: Toolchain (without parser) took 884672.26ms. Allocated memory was 183.5MB in the beginning and 222.3MB in the end (delta: 38.8MB). Free memory was 117.6MB in the beginning and 177.1MB in the end (delta: -59.6MB). Peak memory consumption was 101.7MB. Max. memory is 8.0GB. [2023-12-25 01:24:51,264 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 183.5MB. Free memory is still 133.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 01:24:51,264 INFO L158 Benchmark]: CACSL2BoogieTranslator took 254.46ms. Allocated memory is still 183.5MB. Free memory was 117.3MB in the beginning and 104.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-25 01:24:51,264 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.25ms. Allocated memory is still 183.5MB. Free memory was 104.7MB in the beginning and 102.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 01:24:51,265 INFO L158 Benchmark]: Boogie Preprocessor took 37.84ms. Allocated memory is still 183.5MB. Free memory was 102.9MB in the beginning and 100.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 01:24:51,265 INFO L158 Benchmark]: RCFGBuilder took 382.80ms. Allocated memory was 183.5MB in the beginning and 222.3MB in the end (delta: 38.8MB). Free memory was 100.8MB in the beginning and 180.1MB in the end (delta: -79.3MB). Peak memory consumption was 10.1MB. Max. memory is 8.0GB. [2023-12-25 01:24:51,265 INFO L158 Benchmark]: TraceAbstraction took 883952.84ms. Allocated memory is still 222.3MB. Free memory was 179.5MB in the beginning and 177.1MB in the end (delta: 2.4MB). Peak memory consumption was 124.0MB. Max. memory is 8.0GB. [2023-12-25 01:24:51,266 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.16ms. Allocated memory is still 183.5MB. Free memory is still 133.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 254.46ms. Allocated memory is still 183.5MB. Free memory was 117.3MB in the beginning and 104.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.25ms. Allocated memory is still 183.5MB. Free memory was 104.7MB in the beginning and 102.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.84ms. Allocated memory is still 183.5MB. Free memory was 102.9MB in the beginning and 100.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 382.80ms. Allocated memory was 183.5MB in the beginning and 222.3MB in the end (delta: 38.8MB). Free memory was 100.8MB in the beginning and 180.1MB in the end (delta: -79.3MB). Peak memory consumption was 10.1MB. Max. memory is 8.0GB. * TraceAbstraction took 883952.84ms. Allocated memory is still 222.3MB. Free memory was 179.5MB in the beginning and 177.1MB in the end (delta: 2.4MB). Peak memory consumption was 124.0MB. 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 - TimeoutResultAtElement [Line: 14]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 14). Cancelled while NwaCegarLoop was analyzing trace of length 72 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-3-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ATOM-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 883.9s, OverallIterations: 11, TraceHistogramMax: 10, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 456.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 27 mSolverCounterUnknown, 426 SdHoareTripleChecker+Valid, 349.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 319 mSDsluCounter, 2864 SdHoareTripleChecker+Invalid, 326.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2451 mSDsCounter, 603 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2596 IncrementalHoareTripleChecker+Invalid, 3226 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 603 mSolverCounterUnsat, 413 mSDtfsCounter, 2596 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 783 GetRequests, 611 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 577 ImplicationChecksByTransitivity, 231.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=119occurred in iteration=7, InterpolantAutomatonStates: 127, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 121 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 188.6s InterpolantComputationTime, 413 NumberOfCodeBlocks, 383 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 731 ConstructedInterpolants, 0 QuantifiedInterpolants, 7279 SizeOfPredicates, 28 NumberOfNonLiveVariables, 688 ConjunctsInSsa, 129 ConjunctsInUnsatCore, 19 InterpolantComputations, 3 PerfectInterpolantSequences, 847/938 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 could not prove your program: Timeout Completed graceful shutdown