/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/eca-rers2012/Problem11_label32.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-22 09:31:57,650 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-22 09:31:57,709 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-22 09:31:57,716 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-22 09:31:57,717 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-22 09:31:57,735 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-22 09:31:57,735 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-22 09:31:57,735 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-22 09:31:57,736 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-22 09:31:57,739 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-22 09:31:57,739 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-22 09:31:57,739 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-22 09:31:57,740 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-22 09:31:57,741 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-22 09:31:57,741 INFO L153 SettingsManager]: * Use SBE=true [2023-12-22 09:31:57,742 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-22 09:31:57,742 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-22 09:31:57,742 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-22 09:31:57,742 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-22 09:31:57,742 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-22 09:31:57,742 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-22 09:31:57,743 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-22 09:31:57,743 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-22 09:31:57,743 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-22 09:31:57,743 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-22 09:31:57,743 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-22 09:31:57,743 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-22 09:31:57,743 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-22 09:31:57,744 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-22 09:31:57,744 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-22 09:31:57,745 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-22 09:31:57,745 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-22 09:31:57,745 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-22 09:31:57,745 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-22 09:31:57,745 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-22 09:31:57,745 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-22 09:31:57,745 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-22 09:31:57,745 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-22 09:31:57,745 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-22 09:31:57,746 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-22 09:31:57,746 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-22 09:31:57,746 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-22 09:31:57,746 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-22 09:31:57,746 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-22 09:31:57,746 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-22 09:31:57,747 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-22 09:31:57,747 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-22 09:31:57,947 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-22 09:31:57,967 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-22 09:31:57,969 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-22 09:31:57,970 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-22 09:31:57,970 INFO L274 PluginConnector]: CDTParser initialized [2023-12-22 09:31:57,972 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label32.c [2023-12-22 09:31:59,141 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-22 09:31:59,409 INFO L384 CDTParser]: Found 1 translation units. [2023-12-22 09:31:59,410 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label32.c [2023-12-22 09:31:59,427 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd517986b/671aa6763c6b4327abd07737f242820e/FLAG33722c5f4 [2023-12-22 09:31:59,439 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd517986b/671aa6763c6b4327abd07737f242820e [2023-12-22 09:31:59,441 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-22 09:31:59,443 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-22 09:31:59,445 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-22 09:31:59,445 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-22 09:31:59,448 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-22 09:31:59,449 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 09:31:59" (1/1) ... [2023-12-22 09:31:59,450 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6faf8db8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 09:31:59, skipping insertion in model container [2023-12-22 09:31:59,450 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 09:31:59" (1/1) ... [2023-12-22 09:31:59,509 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-22 09:31:59,713 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label32.c[5857,5870] [2023-12-22 09:31:59,950 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-22 09:31:59,958 INFO L202 MainTranslator]: Completed pre-run [2023-12-22 09:31:59,977 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label32.c[5857,5870] [2023-12-22 09:32:00,082 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-22 09:32:00,095 INFO L206 MainTranslator]: Completed translation [2023-12-22 09:32:00,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 09:32:00 WrapperNode [2023-12-22 09:32:00,097 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-22 09:32:00,098 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-22 09:32:00,098 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-22 09:32:00,098 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-22 09:32:00,103 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 09:32:00" (1/1) ... [2023-12-22 09:32:00,134 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 09:32:00" (1/1) ... [2023-12-22 09:32:00,194 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 998 [2023-12-22 09:32:00,195 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-22 09:32:00,195 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-22 09:32:00,195 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-22 09:32:00,195 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-22 09:32:00,211 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 09:32:00" (1/1) ... [2023-12-22 09:32:00,211 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 09:32:00" (1/1) ... [2023-12-22 09:32:00,216 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 09:32:00" (1/1) ... [2023-12-22 09:32:00,248 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-22 09:32:00,249 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 09:32:00" (1/1) ... [2023-12-22 09:32:00,249 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 09:32:00" (1/1) ... [2023-12-22 09:32:00,277 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 09:32:00" (1/1) ... [2023-12-22 09:32:00,292 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 09:32:00" (1/1) ... [2023-12-22 09:32:00,296 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 09:32:00" (1/1) ... [2023-12-22 09:32:00,301 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 09:32:00" (1/1) ... [2023-12-22 09:32:00,310 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-22 09:32:00,312 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-22 09:32:00,312 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-22 09:32:00,312 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-22 09:32:00,313 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 09:32:00" (1/1) ... [2023-12-22 09:32:00,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-22 09:32:00,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-22 09:32:00,333 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-22 09:32:00,349 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-22 09:32:00,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-22 09:32:00,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-22 09:32:00,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-22 09:32:00,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-22 09:32:00,408 INFO L241 CfgBuilder]: Building ICFG [2023-12-22 09:32:00,410 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-22 09:32:06,772 INFO L282 CfgBuilder]: Performing block encoding [2023-12-22 09:32:06,801 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-22 09:32:06,801 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-22 09:32:06,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 09:32:06 BoogieIcfgContainer [2023-12-22 09:32:06,802 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-22 09:32:06,803 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-22 09:32:06,803 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-22 09:32:06,805 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-22 09:32:06,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 09:31:59" (1/3) ... [2023-12-22 09:32:06,806 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62216910 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 09:32:06, skipping insertion in model container [2023-12-22 09:32:06,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 09:32:00" (2/3) ... [2023-12-22 09:32:06,806 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62216910 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 09:32:06, skipping insertion in model container [2023-12-22 09:32:06,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 09:32:06" (3/3) ... [2023-12-22 09:32:06,808 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label32.c [2023-12-22 09:32:06,820 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-22 09:32:06,820 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-22 09:32:06,865 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-22 09:32:06,870 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;@9fcdcfc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-22 09:32:06,871 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-22 09:32:06,877 INFO L276 IsEmpty]: Start isEmpty. Operand has 221 states, 219 states have (on average 1.917808219178082) internal successors, (420), 220 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 09:32:06,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-22 09:32:06,884 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 09:32:06,884 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 09:32:06,885 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 09:32:06,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 09:32:06,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1199903927, now seen corresponding path program 1 times [2023-12-22 09:32:06,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 09:32:06,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1481112540] [2023-12-22 09:32:06,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 09:32:06,906 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 09:32:06,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 09:32:06,932 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-22 09:32:06,968 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-22 09:32:07,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 09:32:07,029 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-22 09:32:07,032 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 09:32:07,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 09:32:07,056 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 09:32:07,056 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 09:32:07,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1481112540] [2023-12-22 09:32:07,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1481112540] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 09:32:07,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 09:32:07,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-22 09:32:07,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339631471] [2023-12-22 09:32:07,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 09:32:07,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-22 09:32:07,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 09:32:07,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-22 09:32:07,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-22 09:32:07,083 INFO L87 Difference]: Start difference. First operand has 221 states, 219 states have (on average 1.917808219178082) internal successors, (420), 220 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 09:32:07,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 09:32:07,148 INFO L93 Difference]: Finished difference Result 441 states and 839 transitions. [2023-12-22 09:32:07,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-22 09:32:07,151 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2023-12-22 09:32:07,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 09:32:07,162 INFO L225 Difference]: With dead ends: 441 [2023-12-22 09:32:07,162 INFO L226 Difference]: Without dead ends: 219 [2023-12-22 09:32:07,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 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-22 09:32:07,169 INFO L413 NwaCegarLoop]: 355 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, 355 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-22 09:32:07,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 355 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 09:32:07,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2023-12-22 09:32:07,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2023-12-22 09:32:07,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 1.628440366972477) internal successors, (355), 218 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 09:32:07,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 355 transitions. [2023-12-22 09:32:07,221 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 355 transitions. Word has length 39 [2023-12-22 09:32:07,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 09:32:07,222 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 355 transitions. [2023-12-22 09:32:07,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 09:32:07,222 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 355 transitions. [2023-12-22 09:32:07,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-22 09:32:07,223 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 09:32:07,223 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 09:32:07,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-22 09:32:07,428 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-22 09:32:07,429 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 09:32:07,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 09:32:07,432 INFO L85 PathProgramCache]: Analyzing trace with hash 428400437, now seen corresponding path program 1 times [2023-12-22 09:32:07,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 09:32:07,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [214422708] [2023-12-22 09:32:07,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 09:32:07,434 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-22 09:32:07,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 09:32:07,451 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-22 09:32:07,472 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-22 09:32:07,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 09:32:07,506 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 09:32:07,508 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 09:32:07,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 09:32:07,607 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 09:32:07,607 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 09:32:07,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [214422708] [2023-12-22 09:32:07,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [214422708] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 09:32:07,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 09:32:07,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-22 09:32:07,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769433351] [2023-12-22 09:32:07,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 09:32:07,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 09:32:07,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 09:32:07,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 09:32:07,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 09:32:07,614 INFO L87 Difference]: Start difference. First operand 219 states and 355 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 09:32:15,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 09:32:15,781 INFO L93 Difference]: Finished difference Result 627 states and 1023 transitions. [2023-12-22 09:32:15,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 09:32:15,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2023-12-22 09:32:15,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 09:32:15,791 INFO L225 Difference]: With dead ends: 627 [2023-12-22 09:32:15,791 INFO L226 Difference]: Without dead ends: 409 [2023-12-22 09:32:15,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 09:32:15,793 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 181 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2023-12-22 09:32:15,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 153 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 8.1s Time] [2023-12-22 09:32:15,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2023-12-22 09:32:15,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 409. [2023-12-22 09:32:15,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 408 states have (on average 1.4583333333333333) internal successors, (595), 408 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 09:32:15,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 595 transitions. [2023-12-22 09:32:15,815 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 595 transitions. Word has length 39 [2023-12-22 09:32:15,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 09:32:15,816 INFO L495 AbstractCegarLoop]: Abstraction has 409 states and 595 transitions. [2023-12-22 09:32:15,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 09:32:15,816 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 595 transitions. [2023-12-22 09:32:15,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-22 09:32:15,818 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 09:32:15,818 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 09:32:15,824 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-22 09:32:16,020 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-22 09:32:16,021 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 09:32:16,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 09:32:16,021 INFO L85 PathProgramCache]: Analyzing trace with hash 425145965, now seen corresponding path program 1 times [2023-12-22 09:32:16,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 09:32:16,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [673857845] [2023-12-22 09:32:16,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 09:32:16,022 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-22 09:32:16,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 09:32:16,023 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-22 09:32:16,027 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-22 09:32:16,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 09:32:16,104 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 09:32:16,106 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 09:32:16,241 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 09:32:16,241 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 09:32:16,241 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 09:32:16,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [673857845] [2023-12-22 09:32:16,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [673857845] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 09:32:16,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 09:32:16,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-22 09:32:16,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800663293] [2023-12-22 09:32:16,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 09:32:16,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 09:32:16,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 09:32:16,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 09:32:16,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 09:32:16,243 INFO L87 Difference]: Start difference. First operand 409 states and 595 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 09:32:24,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 09:32:24,547 INFO L93 Difference]: Finished difference Result 1201 states and 1753 transitions. [2023-12-22 09:32:24,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 09:32:24,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2023-12-22 09:32:24,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 09:32:24,556 INFO L225 Difference]: With dead ends: 1201 [2023-12-22 09:32:24,556 INFO L226 Difference]: Without dead ends: 793 [2023-12-22 09:32:24,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 09:32:24,558 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 132 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2023-12-22 09:32:24,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 185 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 8.3s Time] [2023-12-22 09:32:24,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2023-12-22 09:32:24,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 781. [2023-12-22 09:32:24,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 780 states have (on average 1.3474358974358975) internal successors, (1051), 780 states have internal predecessors, (1051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 09:32:24,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1051 transitions. [2023-12-22 09:32:24,573 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1051 transitions. Word has length 107 [2023-12-22 09:32:24,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 09:32:24,573 INFO L495 AbstractCegarLoop]: Abstraction has 781 states and 1051 transitions. [2023-12-22 09:32:24,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 09:32:24,574 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1051 transitions. [2023-12-22 09:32:24,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-22 09:32:24,576 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 09:32:24,576 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 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-22 09:32:24,591 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-22 09:32:24,780 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-22 09:32:24,781 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 09:32:24,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 09:32:24,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1873591769, now seen corresponding path program 1 times [2023-12-22 09:32:24,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 09:32:24,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1160428530] [2023-12-22 09:32:24,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 09:32:24,783 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-22 09:32:24,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 09:32:24,799 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-22 09:32:24,803 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-22 09:32:24,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 09:32:24,894 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 09:32:24,896 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 09:32:25,003 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 09:32:25,003 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 09:32:25,004 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 09:32:25,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1160428530] [2023-12-22 09:32:25,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1160428530] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 09:32:25,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 09:32:25,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-22 09:32:25,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684961857] [2023-12-22 09:32:25,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 09:32:25,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 09:32:25,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 09:32:25,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 09:32:25,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 09:32:25,006 INFO L87 Difference]: Start difference. First operand 781 states and 1051 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 09:32:31,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 09:32:31,313 INFO L93 Difference]: Finished difference Result 1930 states and 2543 transitions. [2023-12-22 09:32:31,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 09:32:31,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2023-12-22 09:32:31,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 09:32:31,333 INFO L225 Difference]: With dead ends: 1930 [2023-12-22 09:32:31,334 INFO L226 Difference]: Without dead ends: 1150 [2023-12-22 09:32:31,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 09:32:31,335 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 112 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2023-12-22 09:32:31,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 192 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2023-12-22 09:32:31,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2023-12-22 09:32:31,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 1149. [2023-12-22 09:32:31,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1149 states, 1148 states have (on average 1.2569686411149825) internal successors, (1443), 1148 states have internal predecessors, (1443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 09:32:31,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1443 transitions. [2023-12-22 09:32:31,351 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 1443 transitions. Word has length 115 [2023-12-22 09:32:31,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 09:32:31,352 INFO L495 AbstractCegarLoop]: Abstraction has 1149 states and 1443 transitions. [2023-12-22 09:32:31,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 09:32:31,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1443 transitions. [2023-12-22 09:32:31,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2023-12-22 09:32:31,356 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 09:32:31,356 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 09:32:31,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-22 09:32:31,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 09:32:31,564 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 09:32:31,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 09:32:31,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1157723100, now seen corresponding path program 1 times [2023-12-22 09:32:31,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 09:32:31,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [997935303] [2023-12-22 09:32:31,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 09:32:31,582 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-22 09:32:31,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 09:32:31,584 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 09:32:31,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-22 09:32:31,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 09:32:31,679 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 09:32:31,688 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 09:32:31,757 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 09:32:31,757 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 09:32:31,757 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 09:32:31,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [997935303] [2023-12-22 09:32:31,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [997935303] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 09:32:31,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 09:32:31,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 09:32:31,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736017141] [2023-12-22 09:32:31,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 09:32:31,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 09:32:31,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 09:32:31,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 09:32:31,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 09:32:31,760 INFO L87 Difference]: Start difference. First operand 1149 states and 1443 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 09:32:39,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 09:32:39,530 INFO L93 Difference]: Finished difference Result 1947 states and 2631 transitions. [2023-12-22 09:32:39,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 09:32:39,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 166 [2023-12-22 09:32:39,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 09:32:39,544 INFO L225 Difference]: With dead ends: 1947 [2023-12-22 09:32:39,545 INFO L226 Difference]: Without dead ends: 1541 [2023-12-22 09:32:39,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 09:32:39,546 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 195 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2023-12-22 09:32:39,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 319 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 7.7s Time] [2023-12-22 09:32:39,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1541 states. [2023-12-22 09:32:39,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1541 to 1538. [2023-12-22 09:32:39,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1538 states, 1537 states have (on average 1.2713077423552375) internal successors, (1954), 1537 states have internal predecessors, (1954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 09:32:39,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1538 states and 1954 transitions. [2023-12-22 09:32:39,567 INFO L78 Accepts]: Start accepts. Automaton has 1538 states and 1954 transitions. Word has length 166 [2023-12-22 09:32:39,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 09:32:39,568 INFO L495 AbstractCegarLoop]: Abstraction has 1538 states and 1954 transitions. [2023-12-22 09:32:39,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 09:32:39,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1538 states and 1954 transitions. [2023-12-22 09:32:39,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2023-12-22 09:32:39,572 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 09:32:39,572 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 09:32:39,575 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 (6)] Forceful destruction successful, exit code 0 [2023-12-22 09:32:39,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 09:32:39,775 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 09:32:39,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 09:32:39,776 INFO L85 PathProgramCache]: Analyzing trace with hash 554045929, now seen corresponding path program 1 times [2023-12-22 09:32:39,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 09:32:39,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1380935078] [2023-12-22 09:32:39,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 09:32:39,777 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-22 09:32:39,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 09:32:39,778 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-22 09:32:39,779 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-22 09:32:39,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 09:32:39,916 INFO L262 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 09:32:39,919 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 09:32:40,044 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 09:32:40,045 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 09:32:40,045 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 09:32:40,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1380935078] [2023-12-22 09:32:40,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1380935078] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 09:32:40,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 09:32:40,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 09:32:40,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823197686] [2023-12-22 09:32:40,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 09:32:40,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 09:32:40,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 09:32:40,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 09:32:40,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 09:32:40,049 INFO L87 Difference]: Start difference. First operand 1538 states and 1954 transitions. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 09:32:47,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 09:32:47,468 INFO L93 Difference]: Finished difference Result 3278 states and 4344 transitions. [2023-12-22 09:32:47,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 09:32:47,477 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 219 [2023-12-22 09:32:47,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 09:32:47,482 INFO L225 Difference]: With dead ends: 3278 [2023-12-22 09:32:47,483 INFO L226 Difference]: Without dead ends: 2109 [2023-12-22 09:32:47,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 09:32:47,485 INFO L413 NwaCegarLoop]: 317 mSDtfsCounter, 137 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2023-12-22 09:32:47,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 336 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2023-12-22 09:32:47,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2109 states. [2023-12-22 09:32:47,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2109 to 2096. [2023-12-22 09:32:47,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2096 states, 2095 states have (on average 1.2539379474940333) internal successors, (2627), 2095 states have internal predecessors, (2627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 09:32:47,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2096 states to 2096 states and 2627 transitions. [2023-12-22 09:32:47,510 INFO L78 Accepts]: Start accepts. Automaton has 2096 states and 2627 transitions. Word has length 219 [2023-12-22 09:32:47,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 09:32:47,511 INFO L495 AbstractCegarLoop]: Abstraction has 2096 states and 2627 transitions. [2023-12-22 09:32:47,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 09:32:47,511 INFO L276 IsEmpty]: Start isEmpty. Operand 2096 states and 2627 transitions. [2023-12-22 09:32:47,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2023-12-22 09:32:47,513 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 09:32:47,513 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 09:32:47,518 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-22 09:32:47,718 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-22 09:32:47,718 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 09:32:47,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 09:32:47,719 INFO L85 PathProgramCache]: Analyzing trace with hash -95913651, now seen corresponding path program 1 times [2023-12-22 09:32:47,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 09:32:47,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [286550167] [2023-12-22 09:32:47,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 09:32:47,720 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-22 09:32:47,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 09:32:47,721 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-22 09:32:47,723 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-22 09:32:47,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 09:32:47,847 INFO L262 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-22 09:32:47,850 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 09:32:48,650 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 75 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 09:32:48,650 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 09:32:50,296 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 09:32:50,297 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 09:32:50,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [286550167] [2023-12-22 09:32:50,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [286550167] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-22 09:32:50,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-22 09:32:50,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-12-22 09:32:50,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064134655] [2023-12-22 09:32:50,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 09:32:50,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 09:32:50,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 09:32:50,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 09:32:50,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-22 09:32:50,298 INFO L87 Difference]: Start difference. First operand 2096 states and 2627 transitions. Second operand has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 09:33:04,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 09:33:04,459 INFO L93 Difference]: Finished difference Result 4187 states and 5465 transitions. [2023-12-22 09:33:04,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 09:33:04,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 220 [2023-12-22 09:33:04,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 09:33:04,475 INFO L225 Difference]: With dead ends: 4187 [2023-12-22 09:33:04,475 INFO L226 Difference]: Without dead ends: 3018 [2023-12-22 09:33:04,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 435 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-22 09:33:04,478 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 149 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.1s IncrementalHoareTripleChecker+Time [2023-12-22 09:33:04,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 47 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 14.1s Time] [2023-12-22 09:33:04,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3018 states. [2023-12-22 09:33:04,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3018 to 3018. [2023-12-22 09:33:04,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3018 states, 3017 states have (on average 1.2704673516738483) internal successors, (3833), 3017 states have internal predecessors, (3833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 09:33:04,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 3018 states and 3833 transitions. [2023-12-22 09:33:04,518 INFO L78 Accepts]: Start accepts. Automaton has 3018 states and 3833 transitions. Word has length 220 [2023-12-22 09:33:04,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 09:33:04,519 INFO L495 AbstractCegarLoop]: Abstraction has 3018 states and 3833 transitions. [2023-12-22 09:33:04,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 09:33:04,519 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 3833 transitions. [2023-12-22 09:33:04,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2023-12-22 09:33:04,522 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 09:33:04,522 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 09:33:04,530 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-22 09:33:04,728 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-22 09:33:04,729 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 09:33:04,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 09:33:04,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1930840843, now seen corresponding path program 1 times [2023-12-22 09:33:04,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 09:33:04,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [979468426] [2023-12-22 09:33:04,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 09:33:04,731 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-22 09:33:04,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 09:33:04,732 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-22 09:33:04,740 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-22 09:33:04,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 09:33:04,842 INFO L262 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-22 09:33:04,846 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 09:33:07,032 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 54 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 09:33:07,033 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 09:33:44,412 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 133 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 09:33:44,413 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 09:33:44,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [979468426] [2023-12-22 09:33:44,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [979468426] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-22 09:33:44,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-22 09:33:44,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-12-22 09:33:44,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026440505] [2023-12-22 09:33:44,413 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-22 09:33:44,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-22 09:33:44,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 09:33:44,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-22 09:33:44,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-12-22 09:33:44,415 INFO L87 Difference]: Start difference. First operand 3018 states and 3833 transitions. Second operand has 8 states, 8 states have (on average 54.25) internal successors, (434), 7 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 09:33:50,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.92s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:33:54,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:33:57,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.34s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:34:00,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:34:02,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:34:05,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.78s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:34:08,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:34:10,640 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-22 09:34:13,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:34:16,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:34:21,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:34:28,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:34:32,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:34:36,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:34:47,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:34:49,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:34:51,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:34:53,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:34:58,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:35:03,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:35:07,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.57s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:35:12,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:35:17,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:35:25,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:35:30,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:35:33,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.12s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:35:38,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:35:41,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:35:46,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.74s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:35:51,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:35:52,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:35:58,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:36:02,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:36:05,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.54s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:36:07,592 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-22 09:36:11,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:36:14,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 09:36:14,439 INFO L93 Difference]: Finished difference Result 8082 states and 10561 transitions. [2023-12-22 09:36:14,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-22 09:36:14,441 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 54.25) internal successors, (434), 7 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 231 [2023-12-22 09:36:14,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 09:36:14,468 INFO L225 Difference]: With dead ends: 8082 [2023-12-22 09:36:14,469 INFO L226 Difference]: Without dead ends: 5411 [2023-12-22 09:36:14,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 454 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-22 09:36:14,488 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 484 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 2115 mSolverCounterSat, 329 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 143.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 2444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 329 IncrementalHoareTripleChecker+Valid, 2115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 149.3s IncrementalHoareTripleChecker+Time [2023-12-22 09:36:14,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 220 Invalid, 2444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [329 Valid, 2115 Invalid, 0 Unknown, 0 Unchecked, 149.3s Time] [2023-12-22 09:36:14,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5411 states. [2023-12-22 09:36:14,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5411 to 4116. [2023-12-22 09:36:14,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4116 states, 4115 states have (on average 1.2347509113001216) internal successors, (5081), 4115 states have internal predecessors, (5081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 09:36:14,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4116 states to 4116 states and 5081 transitions. [2023-12-22 09:36:14,543 INFO L78 Accepts]: Start accepts. Automaton has 4116 states and 5081 transitions. Word has length 231 [2023-12-22 09:36:14,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 09:36:14,543 INFO L495 AbstractCegarLoop]: Abstraction has 4116 states and 5081 transitions. [2023-12-22 09:36:14,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 54.25) internal successors, (434), 7 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 09:36:14,544 INFO L276 IsEmpty]: Start isEmpty. Operand 4116 states and 5081 transitions. [2023-12-22 09:36:14,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2023-12-22 09:36:14,545 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 09:36:14,546 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 09:36:14,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-12-22 09:36:14,751 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-22 09:36:14,752 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 09:36:14,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 09:36:14,752 INFO L85 PathProgramCache]: Analyzing trace with hash -519634492, now seen corresponding path program 1 times [2023-12-22 09:36:14,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 09:36:14,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1498729673] [2023-12-22 09:36:14,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 09:36:14,753 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-22 09:36:14,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 09:36:14,755 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-22 09:36:14,757 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-22 09:36:14,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 09:36:14,855 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-22 09:36:14,857 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 09:36:15,155 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 75 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 09:36:15,155 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 09:36:15,483 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 09:36:15,484 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 09:36:15,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1498729673] [2023-12-22 09:36:15,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1498729673] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-22 09:36:15,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-22 09:36:15,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-12-22 09:36:15,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232217649] [2023-12-22 09:36:15,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 09:36:15,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 09:36:15,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 09:36:15,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 09:36:15,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-22 09:36:15,485 INFO L87 Difference]: Start difference. First operand 4116 states and 5081 transitions. Second operand has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 09:36:25,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:36:32,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 09:36:32,309 INFO L93 Difference]: Finished difference Result 9889 states and 12322 transitions. [2023-12-22 09:36:32,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 09:36:32,310 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 231 [2023-12-22 09:36:32,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 09:36:32,322 INFO L225 Difference]: With dead ends: 9889 [2023-12-22 09:36:32,322 INFO L226 Difference]: Without dead ends: 6326 [2023-12-22 09:36:32,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 457 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-22 09:36:32,335 INFO L413 NwaCegarLoop]: 303 mSDtfsCounter, 143 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.8s IncrementalHoareTripleChecker+Time [2023-12-22 09:36:32,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 324 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 16.8s Time] [2023-12-22 09:36:32,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6326 states. [2023-12-22 09:36:32,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6326 to 6326. [2023-12-22 09:36:32,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6326 states, 6325 states have (on average 1.189407114624506) internal successors, (7523), 6325 states have internal predecessors, (7523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 09:36:32,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6326 states to 6326 states and 7523 transitions. [2023-12-22 09:36:32,415 INFO L78 Accepts]: Start accepts. Automaton has 6326 states and 7523 transitions. Word has length 231 [2023-12-22 09:36:32,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 09:36:32,415 INFO L495 AbstractCegarLoop]: Abstraction has 6326 states and 7523 transitions. [2023-12-22 09:36:32,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 09:36:32,416 INFO L276 IsEmpty]: Start isEmpty. Operand 6326 states and 7523 transitions. [2023-12-22 09:36:32,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2023-12-22 09:36:32,418 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 09:36:32,419 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 09:36:32,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-22 09:36:32,623 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-22 09:36:32,623 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 09:36:32,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 09:36:32,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1241078592, now seen corresponding path program 1 times [2023-12-22 09:36:32,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 09:36:32,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1631035341] [2023-12-22 09:36:32,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 09:36:32,625 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-22 09:36:32,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 09:36:32,626 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-22 09:36:32,628 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-22 09:36:32,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 09:36:32,741 INFO L262 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-22 09:36:32,760 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 09:36:35,477 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 44 proven. 127 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 09:36:35,477 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 09:38:00,712 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 155 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 09:38:00,712 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 09:38:00,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1631035341] [2023-12-22 09:38:00,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1631035341] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-22 09:38:00,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-22 09:38:00,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-12-22 09:38:00,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637689780] [2023-12-22 09:38:00,713 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-22 09:38:00,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-22 09:38:00,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 09:38:00,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-22 09:38:00,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-22 09:38:00,714 INFO L87 Difference]: Start difference. First operand 6326 states and 7523 transitions. Second operand has 8 states, 8 states have (on average 61.625) internal successors, (493), 7 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 09:38:22,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:38:28,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:38:42,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.30s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:38:45,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:38:50,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.60s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:38:54,472 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-22 09:38:56,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:38:58,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:39:00,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:39:03,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.71s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:39:05,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:39:07,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:39:14,338 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-22 09:39:17,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.50s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:39:19,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:39:23,671 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-22 09:39:27,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:39:31,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:39:33,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:39:36,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.66s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:39:40,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:39:42,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:39:43,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:39:47,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:39:50,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:39:52,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:39:54,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:39:56,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:39:59,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:40:02,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:40:05,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.98s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:40:11,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:40:16,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:40:18,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:40:21,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.93s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:40:24,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:40:28,454 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-22 09:40:30,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:40:31,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:40:34,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:40:40,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:40:43,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:40:47,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:40:50,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:40:53,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:40:56,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.26s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:40:57,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:41:00,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.99s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:41:05,144 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-22 09:41:13,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.53s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:41:15,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:41:17,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:41:19,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:41:21,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:41:23,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:41:25,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:41:27,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:41:28,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:41:30,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:41:36,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:41:38,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:41:41,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:41:45,068 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-22 09:41:49,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:41:50,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:41:53,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:41:58,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:41:59,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:42:05,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:42:15,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.66s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:42:19,663 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-22 09:42:22,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.75s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:42:26,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.97s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:42:29,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:42:33,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:42:37,724 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-22 09:42:40,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.54s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:42:44,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:42:46,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 09:42:46,527 INFO L93 Difference]: Finished difference Result 15445 states and 18512 transitions. [2023-12-22 09:42:46,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-22 09:42:46,538 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 61.625) internal successors, (493), 7 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 258 [2023-12-22 09:42:46,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 09:42:46,559 INFO L225 Difference]: With dead ends: 15445 [2023-12-22 09:42:46,559 INFO L226 Difference]: Without dead ends: 9640 [2023-12-22 09:42:46,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 515 GetRequests, 508 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-12-22 09:42:46,565 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 491 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 2563 mSolverCounterSat, 301 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 267.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 2873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 301 IncrementalHoareTripleChecker+Valid, 2563 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 284.4s IncrementalHoareTripleChecker+Time [2023-12-22 09:42:46,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 203 Invalid, 2873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [301 Valid, 2563 Invalid, 9 Unknown, 0 Unchecked, 284.4s Time] [2023-12-22 09:42:46,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9640 states. [2023-12-22 09:42:46,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9640 to 6510. [2023-12-22 09:42:46,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6510 states, 6509 states have (on average 1.180058380703641) internal successors, (7681), 6509 states have internal predecessors, (7681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 09:42:46,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6510 states to 6510 states and 7681 transitions. [2023-12-22 09:42:46,718 INFO L78 Accepts]: Start accepts. Automaton has 6510 states and 7681 transitions. Word has length 258 [2023-12-22 09:42:46,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 09:42:46,719 INFO L495 AbstractCegarLoop]: Abstraction has 6510 states and 7681 transitions. [2023-12-22 09:42:46,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 61.625) internal successors, (493), 7 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 09:42:46,719 INFO L276 IsEmpty]: Start isEmpty. Operand 6510 states and 7681 transitions. [2023-12-22 09:42:46,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2023-12-22 09:42:46,722 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 09:42:46,722 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 09:42:46,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-12-22 09:42:46,929 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-22 09:42:46,929 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 09:42:46,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 09:42:46,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1653182087, now seen corresponding path program 1 times [2023-12-22 09:42:46,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 09:42:46,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [61448767] [2023-12-22 09:42:46,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 09:42:46,931 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-22 09:42:46,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 09:42:46,932 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-22 09:42:46,933 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-22 09:42:47,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 09:42:47,040 INFO L262 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-22 09:42:47,042 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 09:42:47,986 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 75 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 09:42:47,986 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 09:42:48,676 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 09:42:48,676 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 09:42:48,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [61448767] [2023-12-22 09:42:48,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [61448767] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-22 09:42:48,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-22 09:42:48,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-12-22 09:42:48,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711440221] [2023-12-22 09:42:48,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 09:42:48,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 09:42:48,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 09:42:48,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 09:42:48,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-22 09:42:48,678 INFO L87 Difference]: Start difference. First operand 6510 states and 7681 transitions. Second operand has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 09:43:07,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:43:27,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 09:43:27,279 INFO L93 Difference]: Finished difference Result 15417 states and 18493 transitions. [2023-12-22 09:43:27,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 09:43:27,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 261 [2023-12-22 09:43:27,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 09:43:27,303 INFO L225 Difference]: With dead ends: 15417 [2023-12-22 09:43:27,304 INFO L226 Difference]: Without dead ends: 9828 [2023-12-22 09:43:27,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 517 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-22 09:43:27,308 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 137 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 38.5s IncrementalHoareTripleChecker+Time [2023-12-22 09:43:27,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 74 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 38.5s Time] [2023-12-22 09:43:27,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9828 states. [2023-12-22 09:43:27,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9828 to 9454. [2023-12-22 09:43:27,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9454 states, 9453 states have (on average 1.1819528192108326) internal successors, (11173), 9453 states have internal predecessors, (11173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 09:43:27,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9454 states to 9454 states and 11173 transitions. [2023-12-22 09:43:27,403 INFO L78 Accepts]: Start accepts. Automaton has 9454 states and 11173 transitions. Word has length 261 [2023-12-22 09:43:27,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 09:43:27,403 INFO L495 AbstractCegarLoop]: Abstraction has 9454 states and 11173 transitions. [2023-12-22 09:43:27,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 09:43:27,404 INFO L276 IsEmpty]: Start isEmpty. Operand 9454 states and 11173 transitions. [2023-12-22 09:43:27,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2023-12-22 09:43:27,406 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 09:43:27,407 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 09:43:27,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-12-22 09:43:27,612 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-22 09:43:27,613 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 09:43:27,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 09:43:27,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1844321292, now seen corresponding path program 1 times [2023-12-22 09:43:27,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 09:43:27,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1320999989] [2023-12-22 09:43:27,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 09:43:27,614 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-22 09:43:27,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 09:43:27,616 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-22 09:43:27,638 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-22 09:43:27,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 09:43:27,716 INFO L262 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-22 09:43:27,719 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 09:43:33,285 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 42 proven. 33 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2023-12-22 09:43:33,286 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 09:43:38,518 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2023-12-22 09:43:38,518 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 09:43:38,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1320999989] [2023-12-22 09:43:38,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1320999989] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-22 09:43:38,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-22 09:43:38,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-12-22 09:43:38,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765696207] [2023-12-22 09:43:38,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 09:43:38,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 09:43:38,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 09:43:38,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 09:43:38,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-22 09:43:38,520 INFO L87 Difference]: Start difference. First operand 9454 states and 11173 transitions. Second operand has 4 states, 4 states have (on average 52.0) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 09:43:45,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:43:51,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 09:43:51,871 INFO L93 Difference]: Finished difference Result 17818 states and 21378 transitions. [2023-12-22 09:43:51,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-22 09:43:51,872 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 52.0) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 274 [2023-12-22 09:43:51,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 09:43:51,887 INFO L225 Difference]: With dead ends: 17818 [2023-12-22 09:43:51,887 INFO L226 Difference]: Without dead ends: 10742 [2023-12-22 09:43:51,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 546 GetRequests, 542 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-22 09:43:51,896 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 55 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.2s IncrementalHoareTripleChecker+Time [2023-12-22 09:43:51,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 157 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 13.2s Time] [2023-12-22 09:43:51,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10742 states. [2023-12-22 09:43:52,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10742 to 9270. [2023-12-22 09:43:52,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9270 states, 9269 states have (on average 1.1773654115870105) internal successors, (10913), 9269 states have internal predecessors, (10913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 09:43:52,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9270 states to 9270 states and 10913 transitions. [2023-12-22 09:43:52,041 INFO L78 Accepts]: Start accepts. Automaton has 9270 states and 10913 transitions. Word has length 274 [2023-12-22 09:43:52,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 09:43:52,041 INFO L495 AbstractCegarLoop]: Abstraction has 9270 states and 10913 transitions. [2023-12-22 09:43:52,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.0) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 09:43:52,041 INFO L276 IsEmpty]: Start isEmpty. Operand 9270 states and 10913 transitions. [2023-12-22 09:43:52,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2023-12-22 09:43:52,044 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 09:43:52,044 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2023-12-22 09:43:52,060 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-22 09:43:52,249 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-22 09:43:52,249 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 09:43:52,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 09:43:52,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1182732918, now seen corresponding path program 1 times [2023-12-22 09:43:52,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 09:43:52,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1865180307] [2023-12-22 09:43:52,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 09:43:52,251 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-22 09:43:52,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 09:43:52,252 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 09:43:52,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-22 09:43:52,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 09:43:52,377 INFO L262 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-22 09:43:52,380 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 09:43:57,135 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 09:43:57,135 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 09:45:17,828 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 120 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 09:45:17,828 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 09:45:17,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1865180307] [2023-12-22 09:45:17,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1865180307] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-22 09:45:17,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-22 09:45:17,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-12-22 09:45:17,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016077571] [2023-12-22 09:45:17,829 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-22 09:45:17,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-22 09:45:17,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 09:45:17,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-22 09:45:17,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-12-22 09:45:17,830 INFO L87 Difference]: Start difference. First operand 9270 states and 10913 transitions. Second operand has 9 states, 9 states have (on average 58.333333333333336) internal successors, (525), 8 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 09:45:53,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:45:58,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:46:00,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:46:04,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:46:05,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:46:13,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:46:14,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:46:22,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.03s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:46:25,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:46:29,316 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-22 09:46:35,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] Received shutdown request... [2023-12-22 09:46:37,350 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 (14)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-22 09:46:37,350 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-22 09:46:37,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-22 09:46:37,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 553 GetRequests, 545 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-12-22 09:46:37,446 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 596 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 2531 mSolverCounterSat, 32 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 70.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 2565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2531 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 79.4s IncrementalHoareTripleChecker+Time [2023-12-22 09:46:37,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [596 Valid, 119 Invalid, 2565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2531 Invalid, 2 Unknown, 0 Unchecked, 79.4s Time] [2023-12-22 09:46:37,447 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-22 09:46:37,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-12-22 09:46:37,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 09:46:37,649 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (9270states) and FLOYD_HOARE automaton (currently 9 states, 9 states before enhancement),while ReachableStatesComputation was computing reachable states (2506 states constructed, input type IntersectNwa). [2023-12-22 09:46:37,652 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 09:46:37,654 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-22 09:46:37,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 09:46:37 BoogieIcfgContainer [2023-12-22 09:46:37,655 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-22 09:46:37,656 INFO L158 Benchmark]: Toolchain (without parser) took 878212.70ms. Allocated memory was 277.9MB in the beginning and 333.4MB in the end (delta: 55.6MB). Free memory was 224.6MB in the beginning and 155.6MB in the end (delta: 69.0MB). Peak memory consumption was 230.5MB. Max. memory is 8.0GB. [2023-12-22 09:46:37,656 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 196.1MB. Free memory was 143.8MB in the beginning and 143.7MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-22 09:46:37,656 INFO L158 Benchmark]: CACSL2BoogieTranslator took 652.25ms. Allocated memory is still 277.9MB. Free memory was 224.6MB in the beginning and 237.1MB in the end (delta: -12.5MB). Peak memory consumption was 57.8MB. Max. memory is 8.0GB. [2023-12-22 09:46:37,656 INFO L158 Benchmark]: Boogie Procedure Inliner took 96.65ms. Allocated memory is still 277.9MB. Free memory was 237.1MB in the beginning and 227.7MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-12-22 09:46:37,656 INFO L158 Benchmark]: Boogie Preprocessor took 115.89ms. Allocated memory is still 277.9MB. Free memory was 227.7MB in the beginning and 217.7MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-12-22 09:46:37,656 INFO L158 Benchmark]: RCFGBuilder took 6489.79ms. Allocated memory is still 277.9MB. Free memory was 217.7MB in the beginning and 140.7MB in the end (delta: 77.1MB). Peak memory consumption was 84.4MB. Max. memory is 8.0GB. [2023-12-22 09:46:37,657 INFO L158 Benchmark]: TraceAbstraction took 870852.40ms. Allocated memory was 277.9MB in the beginning and 333.4MB in the end (delta: 55.6MB). Free memory was 140.1MB in the beginning and 155.6MB in the end (delta: -15.5MB). Peak memory consumption was 145.0MB. Max. memory is 8.0GB. [2023-12-22 09:46:37,657 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 196.1MB. Free memory was 143.8MB in the beginning and 143.7MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 652.25ms. Allocated memory is still 277.9MB. Free memory was 224.6MB in the beginning and 237.1MB in the end (delta: -12.5MB). Peak memory consumption was 57.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 96.65ms. Allocated memory is still 277.9MB. Free memory was 237.1MB in the beginning and 227.7MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 115.89ms. Allocated memory is still 277.9MB. Free memory was 227.7MB in the beginning and 217.7MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * RCFGBuilder took 6489.79ms. Allocated memory is still 277.9MB. Free memory was 217.7MB in the beginning and 140.7MB in the end (delta: 77.1MB). Peak memory consumption was 84.4MB. Max. memory is 8.0GB. * TraceAbstraction took 870852.40ms. Allocated memory was 277.9MB in the beginning and 333.4MB in the end (delta: 55.6MB). Free memory was 140.1MB in the beginning and 155.6MB in the end (delta: -15.5MB). Peak memory consumption was 145.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: 136]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 136). Cancelled while NwaCegarLoop was constructing difference of abstraction (9270states) and FLOYD_HOARE automaton (currently 9 states, 9 states before enhancement),while ReachableStatesComputation was computing reachable states (2506 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 221 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 870.8s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 636.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 11 mSolverCounterUnknown, 2812 SdHoareTripleChecker+Valid, 633.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2812 mSDsluCounter, 2684 SdHoareTripleChecker+Invalid, 588.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 429 mSDsCounter, 1694 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12331 IncrementalHoareTripleChecker+Invalid, 14036 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1694 mSolverCounterUnsat, 2255 mSDtfsCounter, 12331 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4172 GetRequests, 4132 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9454occurred in iteration=11, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 12 MinimizatonAttempts, 6300 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 229.2s InterpolantComputationTime, 2437 NumberOfCodeBlocks, 2437 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 4169 ConstructedInterpolants, 0 QuantifiedInterpolants, 39110 SizeOfPredicates, 8 NumberOfNonLiveVariables, 3091 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 20 InterpolantComputations, 10 PerfectInterpolantSequences, 1686/2461 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