/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_label12.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-22 09:11:35,446 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-22 09:11:35,516 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:11:35,521 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-22 09:11:35,521 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-22 09:11:35,544 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-22 09:11:35,545 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-22 09:11:35,545 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-22 09:11:35,545 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-22 09:11:35,548 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-22 09:11:35,548 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-22 09:11:35,549 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-22 09:11:35,549 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-22 09:11:35,550 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-22 09:11:35,550 INFO L153 SettingsManager]: * Use SBE=true [2023-12-22 09:11:35,551 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-22 09:11:35,551 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-22 09:11:35,551 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-22 09:11:35,551 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-22 09:11:35,552 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-22 09:11:35,552 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-22 09:11:35,552 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-22 09:11:35,553 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-22 09:11:35,553 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-22 09:11:35,553 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-22 09:11:35,553 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-22 09:11:35,553 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-22 09:11:35,553 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-22 09:11:35,553 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-22 09:11:35,554 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-22 09:11:35,554 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-22 09:11:35,554 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-22 09:11:35,554 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-22 09:11:35,555 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-22 09:11:35,555 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-22 09:11:35,555 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-22 09:11:35,555 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-22 09:11:35,555 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-22 09:11:35,555 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-22 09:11:35,555 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-22 09:11:35,555 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-22 09:11:35,556 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-22 09:11:35,556 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-22 09:11:35,556 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-22 09:11:35,557 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-22 09:11:35,557 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-22 09:11:35,557 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:11:35,769 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-22 09:11:35,786 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-22 09:11:35,788 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-22 09:11:35,788 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-22 09:11:35,793 INFO L274 PluginConnector]: CDTParser initialized [2023-12-22 09:11:35,794 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label12.c [2023-12-22 09:11:36,860 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-22 09:11:37,077 INFO L384 CDTParser]: Found 1 translation units. [2023-12-22 09:11:37,078 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label12.c [2023-12-22 09:11:37,091 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/beaa0096c/18e4a1c246114d409aaffd9e880bc13b/FLAG44dbf1088 [2023-12-22 09:11:37,109 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/beaa0096c/18e4a1c246114d409aaffd9e880bc13b [2023-12-22 09:11:37,111 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-22 09:11:37,112 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-22 09:11:37,114 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-22 09:11:37,114 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-22 09:11:37,118 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-22 09:11:37,118 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 09:11:37" (1/1) ... [2023-12-22 09:11:37,119 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24feb28c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 09:11:37, skipping insertion in model container [2023-12-22 09:11:37,119 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 09:11:37" (1/1) ... [2023-12-22 09:11:37,166 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-22 09:11:37,319 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_label12.c[3684,3697] [2023-12-22 09:11:37,517 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-22 09:11:37,526 INFO L202 MainTranslator]: Completed pre-run [2023-12-22 09:11:37,539 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_label12.c[3684,3697] [2023-12-22 09:11:37,685 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-22 09:11:37,696 INFO L206 MainTranslator]: Completed translation [2023-12-22 09:11:37,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 09:11:37 WrapperNode [2023-12-22 09:11:37,697 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-22 09:11:37,698 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-22 09:11:37,698 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-22 09:11:37,698 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-22 09:11:37,703 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:11:37" (1/1) ... [2023-12-22 09:11:37,729 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:11:37" (1/1) ... [2023-12-22 09:11:37,792 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 998 [2023-12-22 09:11:37,792 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-22 09:11:37,793 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-22 09:11:37,793 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-22 09:11:37,793 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-22 09:11:37,801 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 09:11:37" (1/1) ... [2023-12-22 09:11:37,801 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 09:11:37" (1/1) ... [2023-12-22 09:11:37,812 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 09:11:37" (1/1) ... [2023-12-22 09:11:37,851 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:11:37,851 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 09:11:37" (1/1) ... [2023-12-22 09:11:37,851 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 09:11:37" (1/1) ... [2023-12-22 09:11:37,882 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 09:11:37" (1/1) ... [2023-12-22 09:11:37,888 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 09:11:37" (1/1) ... [2023-12-22 09:11:37,894 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 09:11:37" (1/1) ... [2023-12-22 09:11:37,899 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 09:11:37" (1/1) ... [2023-12-22 09:11:37,906 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-22 09:11:37,907 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-22 09:11:37,907 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-22 09:11:37,907 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-22 09:11:37,907 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 09:11:37" (1/1) ... [2023-12-22 09:11:37,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-22 09:11:37,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-22 09:11:37,950 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:11:37,958 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:11:37,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-22 09:11:37,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-22 09:11:37,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-22 09:11:37,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-22 09:11:38,052 INFO L241 CfgBuilder]: Building ICFG [2023-12-22 09:11:38,054 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-22 09:11:45,554 INFO L282 CfgBuilder]: Performing block encoding [2023-12-22 09:11:45,628 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-22 09:11:45,628 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-22 09:11:45,628 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 09:11:45 BoogieIcfgContainer [2023-12-22 09:11:45,628 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-22 09:11:45,630 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-22 09:11:45,630 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-22 09:11:45,632 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-22 09:11:45,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 09:11:37" (1/3) ... [2023-12-22 09:11:45,633 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ac68151 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 09:11:45, skipping insertion in model container [2023-12-22 09:11:45,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 09:11:37" (2/3) ... [2023-12-22 09:11:45,633 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ac68151 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 09:11:45, skipping insertion in model container [2023-12-22 09:11:45,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 09:11:45" (3/3) ... [2023-12-22 09:11:45,634 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label12.c [2023-12-22 09:11:45,648 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-22 09:11:45,648 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-22 09:11:45,690 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-22 09:11:45,695 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;@7a7bfccd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-22 09:11:45,695 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-22 09:11:45,700 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:11:45,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-22 09:11:45,705 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 09:11:45,705 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] [2023-12-22 09:11:45,706 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 09:11:45,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 09:11:45,710 INFO L85 PathProgramCache]: Analyzing trace with hash -278545201, now seen corresponding path program 1 times [2023-12-22 09:11:45,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 09:11:45,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [260114462] [2023-12-22 09:11:45,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 09:11:45,723 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:11:45,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 09:11:45,728 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:11:45,764 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:11:45,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 09:11:45,794 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-22 09:11:45,797 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 09:11:45,822 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:11:45,822 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 09:11:45,822 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 09:11:45,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [260114462] [2023-12-22 09:11:45,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [260114462] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 09:11:45,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 09:11:45,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-22 09:11:45,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799573253] [2023-12-22 09:11:45,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 09:11:45,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-22 09:11:45,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 09:11:45,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-22 09:11:45,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-22 09:11:45,866 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 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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:11:45,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 09:11:45,923 INFO L93 Difference]: Finished difference Result 441 states and 839 transitions. [2023-12-22 09:11:45,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-22 09:11:45,927 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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 24 [2023-12-22 09:11:45,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 09:11:45,940 INFO L225 Difference]: With dead ends: 441 [2023-12-22 09:11:45,941 INFO L226 Difference]: Without dead ends: 219 [2023-12-22 09:11:45,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 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:11:45,948 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:11:45,949 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:11:45,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2023-12-22 09:11:46,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2023-12-22 09:11:46,004 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:11:46,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 355 transitions. [2023-12-22 09:11:46,007 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 355 transitions. Word has length 24 [2023-12-22 09:11:46,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 09:11:46,007 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 355 transitions. [2023-12-22 09:11:46,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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:11:46,007 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 355 transitions. [2023-12-22 09:11:46,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-22 09:11:46,008 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 09:11:46,008 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] [2023-12-22 09:11:46,018 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:11:46,211 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:11:46,212 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 09:11:46,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 09:11:46,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1393381098, now seen corresponding path program 1 times [2023-12-22 09:11:46,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 09:11:46,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1001744142] [2023-12-22 09:11:46,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 09:11:46,215 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:11:46,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 09:11:46,233 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:11:46,269 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:11:46,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 09:11:46,293 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 09:11:46,294 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 09:11:46,358 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:11:46,358 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 09:11:46,359 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 09:11:46,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1001744142] [2023-12-22 09:11:46,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1001744142] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 09:11:46,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 09:11:46,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-22 09:11:46,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036791939] [2023-12-22 09:11:46,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 09:11:46,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 09:11:46,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 09:11:46,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 09:11:46,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 09:11:46,361 INFO L87 Difference]: Start difference. First operand 219 states and 355 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 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:11:54,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 09:11:54,078 INFO L93 Difference]: Finished difference Result 629 states and 1028 transitions. [2023-12-22 09:11:54,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 09:11:54,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 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 24 [2023-12-22 09:11:54,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 09:11:54,088 INFO L225 Difference]: With dead ends: 629 [2023-12-22 09:11:54,089 INFO L226 Difference]: Without dead ends: 411 [2023-12-22 09:11:54,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 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:11:54,090 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 181 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2023-12-22 09:11:54,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 144 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 7.7s Time] [2023-12-22 09:11:54,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2023-12-22 09:11:54,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 408. [2023-12-22 09:11:54,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 407 states have (on average 1.4594594594594594) internal successors, (594), 407 states have internal predecessors, (594), 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:11:54,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 594 transitions. [2023-12-22 09:11:54,113 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 594 transitions. Word has length 24 [2023-12-22 09:11:54,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 09:11:54,113 INFO L495 AbstractCegarLoop]: Abstraction has 408 states and 594 transitions. [2023-12-22 09:11:54,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 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:11:54,113 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 594 transitions. [2023-12-22 09:11:54,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-12-22 09:11:54,115 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 09:11:54,115 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:54,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-22 09:11:54,319 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:11:54,321 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 09:11:54,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 09:11:54,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1606278301, now seen corresponding path program 1 times [2023-12-22 09:11:54,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 09:11:54,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [381334392] [2023-12-22 09:11:54,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 09:11:54,327 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:11:54,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 09:11:54,330 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:11:54,341 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:11:54,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 09:11:54,403 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 09:11:54,405 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 09:11:54,562 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 09:11:54,562 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 09:11:54,562 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 09:11:54,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [381334392] [2023-12-22 09:11:54,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [381334392] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 09:11:54,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 09:11:54,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-22 09:11:54,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045176147] [2023-12-22 09:11:54,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 09:11:54,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 09:11:54,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 09:11:54,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 09:11:54,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 09:11:54,564 INFO L87 Difference]: Start difference. First operand 408 states and 594 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 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:12:04,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 09:12:04,306 INFO L93 Difference]: Finished difference Result 1198 states and 1750 transitions. [2023-12-22 09:12:04,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 09:12:04,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 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 92 [2023-12-22 09:12:04,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 09:12:04,315 INFO L225 Difference]: With dead ends: 1198 [2023-12-22 09:12:04,315 INFO L226 Difference]: Without dead ends: 791 [2023-12-22 09:12:04,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 90 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:12:04,317 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 132 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2023-12-22 09:12:04,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 181 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 9.7s Time] [2023-12-22 09:12:04,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2023-12-22 09:12:04,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 780. [2023-12-22 09:12:04,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 779 states have (on average 1.3478818998716302) internal successors, (1050), 779 states have internal predecessors, (1050), 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:12:04,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1050 transitions. [2023-12-22 09:12:04,342 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1050 transitions. Word has length 92 [2023-12-22 09:12:04,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 09:12:04,343 INFO L495 AbstractCegarLoop]: Abstraction has 780 states and 1050 transitions. [2023-12-22 09:12:04,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 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:12:04,343 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1050 transitions. [2023-12-22 09:12:04,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-22 09:12:04,345 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 09:12:04,345 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:04,353 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:12:04,549 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:12:04,549 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 09:12:04,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 09:12:04,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1476741768, now seen corresponding path program 1 times [2023-12-22 09:12:04,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 09:12:04,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1839407634] [2023-12-22 09:12:04,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 09:12:04,551 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:12:04,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 09:12:04,559 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:12:04,593 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:12:04,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 09:12:04,658 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 09:12:04,660 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 09:12:04,776 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 09:12:04,776 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 09:12:04,776 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 09:12:04,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1839407634] [2023-12-22 09:12:04,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1839407634] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 09:12:04,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 09:12:04,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-22 09:12:04,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958187321] [2023-12-22 09:12:04,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 09:12:04,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 09:12:04,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 09:12:04,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 09:12:04,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 09:12:04,778 INFO L87 Difference]: Start difference. First operand 780 states and 1050 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 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:12:12,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 09:12:12,901 INFO L93 Difference]: Finished difference Result 1928 states and 2650 transitions. [2023-12-22 09:12:12,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 09:12:12,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 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 95 [2023-12-22 09:12:12,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 09:12:12,913 INFO L225 Difference]: With dead ends: 1928 [2023-12-22 09:12:12,913 INFO L226 Difference]: Without dead ends: 1149 [2023-12-22 09:12:12,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 93 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:12:12,915 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 148 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 152 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:12:12,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 152 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 8.1s Time] [2023-12-22 09:12:12,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2023-12-22 09:12:12,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 1149. [2023-12-22 09:12:12,930 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:12:12,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1443 transitions. [2023-12-22 09:12:12,932 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 1443 transitions. Word has length 95 [2023-12-22 09:12:12,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 09:12:12,932 INFO L495 AbstractCegarLoop]: Abstraction has 1149 states and 1443 transitions. [2023-12-22 09:12:12,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 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:12:12,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1443 transitions. [2023-12-22 09:12:12,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-12-22 09:12:12,936 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 09:12:12,936 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:12,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-22 09:12:13,141 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:12:13,141 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 09:12:13,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 09:12:13,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1910011112, now seen corresponding path program 1 times [2023-12-22 09:12:13,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 09:12:13,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [217617635] [2023-12-22 09:12:13,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 09:12:13,157 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:12:13,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 09:12:13,173 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:12:13,178 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:12:13,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 09:12:13,277 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 09:12:13,287 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 09:12:13,340 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 09:12:13,340 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 09:12:13,341 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 09:12:13,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [217617635] [2023-12-22 09:12:13,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [217617635] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 09:12:13,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 09:12:13,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 09:12:13,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230945674] [2023-12-22 09:12:13,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 09:12:13,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 09:12:13,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 09:12:13,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 09:12:13,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 09:12:13,344 INFO L87 Difference]: Start difference. First operand 1149 states and 1443 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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:12:20,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 09:12:20,566 INFO L93 Difference]: Finished difference Result 1947 states and 2631 transitions. [2023-12-22 09:12:20,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 09:12:20,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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 151 [2023-12-22 09:12:20,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 09:12:20,578 INFO L225 Difference]: With dead ends: 1947 [2023-12-22 09:12:20,579 INFO L226 Difference]: Without dead ends: 1541 [2023-12-22 09:12:20,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 149 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:12:20,580 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 210 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 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.2s IncrementalHoareTripleChecker+Time [2023-12-22 09:12:20,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 319 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2023-12-22 09:12:20,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1541 states. [2023-12-22 09:12:20,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1541 to 1538. [2023-12-22 09:12:20,595 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:12:20,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1538 states and 1954 transitions. [2023-12-22 09:12:20,598 INFO L78 Accepts]: Start accepts. Automaton has 1538 states and 1954 transitions. Word has length 151 [2023-12-22 09:12:20,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 09:12:20,599 INFO L495 AbstractCegarLoop]: Abstraction has 1538 states and 1954 transitions. [2023-12-22 09:12:20,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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:12:20,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1538 states and 1954 transitions. [2023-12-22 09:12:20,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2023-12-22 09:12:20,602 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 09:12:20,602 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 09:12:20,613 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:12:20,804 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:12:20,805 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 09:12:20,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 09:12:20,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1115983264, now seen corresponding path program 1 times [2023-12-22 09:12:20,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 09:12:20,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [729645269] [2023-12-22 09:12:20,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 09:12:20,806 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:12:20,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 09:12:20,807 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:12:20,829 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:12:20,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 09:12:20,928 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 09:12:20,932 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 09:12:21,040 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 09:12:21,041 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 09:12:21,041 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 09:12:21,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [729645269] [2023-12-22 09:12:21,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [729645269] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 09:12:21,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 09:12:21,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 09:12:21,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602449538] [2023-12-22 09:12:21,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 09:12:21,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 09:12:21,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 09:12:21,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 09:12:21,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 09:12:21,042 INFO L87 Difference]: Start difference. First operand 1538 states and 1954 transitions. Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 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:12:28,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 09:12:28,219 INFO L93 Difference]: Finished difference Result 3278 states and 4344 transitions. [2023-12-22 09:12:28,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 09:12:28,227 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 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 204 [2023-12-22 09:12:28,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 09:12:28,233 INFO L225 Difference]: With dead ends: 3278 [2023-12-22 09:12:28,233 INFO L226 Difference]: Without dead ends: 2109 [2023-12-22 09:12:28,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 202 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:12:28,235 INFO L413 NwaCegarLoop]: 317 mSDtfsCounter, 137 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s 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.1s IncrementalHoareTripleChecker+Time [2023-12-22 09:12:28,235 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.1s Time] [2023-12-22 09:12:28,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2109 states. [2023-12-22 09:12:28,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2109 to 2096. [2023-12-22 09:12:28,256 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:12:28,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2096 states to 2096 states and 2627 transitions. [2023-12-22 09:12:28,259 INFO L78 Accepts]: Start accepts. Automaton has 2096 states and 2627 transitions. Word has length 204 [2023-12-22 09:12:28,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 09:12:28,259 INFO L495 AbstractCegarLoop]: Abstraction has 2096 states and 2627 transitions. [2023-12-22 09:12:28,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 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:12:28,259 INFO L276 IsEmpty]: Start isEmpty. Operand 2096 states and 2627 transitions. [2023-12-22 09:12:28,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2023-12-22 09:12:28,261 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 09:12:28,261 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 09:12:28,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-12-22 09:12:28,465 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:12:28,466 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 09:12:28,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 09:12:28,466 INFO L85 PathProgramCache]: Analyzing trace with hash -116435904, now seen corresponding path program 1 times [2023-12-22 09:12:28,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 09:12:28,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1576076324] [2023-12-22 09:12:28,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 09:12:28,467 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:12:28,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 09:12:28,468 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:12:28,486 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:12:28,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 09:12:28,593 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-22 09:12:28,596 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 09:12:29,387 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 45 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 09:12:29,387 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 09:12:31,081 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 09:12:31,081 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 09:12:31,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1576076324] [2023-12-22 09:12:31,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1576076324] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-22 09:12:31,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-22 09:12:31,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-12-22 09:12:31,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856866710] [2023-12-22 09:12:31,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 09:12:31,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 09:12:31,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 09:12:31,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 09:12:31,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-22 09:12:31,083 INFO L87 Difference]: Start difference. First operand 2096 states and 2627 transitions. Second operand has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 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:12:46,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 09:12:46,846 INFO L93 Difference]: Finished difference Result 4187 states and 5465 transitions. [2023-12-22 09:12:46,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 09:12:46,853 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 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 205 [2023-12-22 09:12:46,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 09:12:46,861 INFO L225 Difference]: With dead ends: 4187 [2023-12-22 09:12:46,861 INFO L226 Difference]: Without dead ends: 3018 [2023-12-22 09:12:46,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 405 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:12:46,863 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 149 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.2s 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, 15.7s IncrementalHoareTripleChecker+Time [2023-12-22 09:12:46,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 47 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 15.7s Time] [2023-12-22 09:12:46,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3018 states. [2023-12-22 09:12:46,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3018 to 3018. [2023-12-22 09:12:46,897 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:12:46,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 3018 states and 3833 transitions. [2023-12-22 09:12:46,902 INFO L78 Accepts]: Start accepts. Automaton has 3018 states and 3833 transitions. Word has length 205 [2023-12-22 09:12:46,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 09:12:46,903 INFO L495 AbstractCegarLoop]: Abstraction has 3018 states and 3833 transitions. [2023-12-22 09:12:46,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 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:12:46,903 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 3833 transitions. [2023-12-22 09:12:46,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2023-12-22 09:12:46,905 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 09:12:46,905 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, 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:12:46,911 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:12:47,110 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:12:47,111 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 09:12:47,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 09:12:47,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1206514562, now seen corresponding path program 1 times [2023-12-22 09:12:47,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 09:12:47,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1046105910] [2023-12-22 09:12:47,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 09:12:47,112 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:12:47,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 09:12:47,114 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:12:47,119 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:12:47,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 09:12:47,234 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-22 09:12:47,237 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 09:12:49,494 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 24 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 09:12:49,494 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 09:13:28,649 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 103 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 09:13:28,649 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 09:13:28,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1046105910] [2023-12-22 09:13:28,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1046105910] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-22 09:13:28,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-22 09:13:28,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-12-22 09:13:28,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593662578] [2023-12-22 09:13:28,650 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-22 09:13:28,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-22 09:13:28,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 09:13:28,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-22 09:13:28,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-12-22 09:13:28,651 INFO L87 Difference]: Start difference. First operand 3018 states and 3833 transitions. Second operand has 8 states, 8 states have (on average 52.375) internal successors, (419), 7 states have internal predecessors, (419), 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:13:34,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:13:36,190 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:13:41,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.38s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:13:44,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.55s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:13:47,722 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:13:50,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:13:53,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:13:56,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:14:06,086 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:14:09,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:14:13,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.45s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:14:16,882 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:14:21,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:14:27,578 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:14:28,918 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:14:31,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:14:35,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:14:41,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.66s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:14:46,063 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:14:48,302 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:14:54,229 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:14:59,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:15:04,410 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:15:08,205 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:15:12,460 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:15:17,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:15:22,385 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:15:24,500 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:15:25,708 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:15:28,380 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:15:34,904 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:15:35,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 09:15:35,564 INFO L93 Difference]: Finished difference Result 8082 states and 10561 transitions. [2023-12-22 09:15:35,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-22 09:15:35,565 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 52.375) internal successors, (419), 7 states have internal predecessors, (419), 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 216 [2023-12-22 09:15:35,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 09:15:35,577 INFO L225 Difference]: With dead ends: 8082 [2023-12-22 09:15:35,577 INFO L226 Difference]: Without dead ends: 5411 [2023-12-22 09:15:35,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 424 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:15:35,581 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 376 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 2808 mSolverCounterSat, 265 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 118.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 3075 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 2808 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 126.2s IncrementalHoareTripleChecker+Time [2023-12-22 09:15:35,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 248 Invalid, 3075 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 2808 Invalid, 2 Unknown, 0 Unchecked, 126.2s Time] [2023-12-22 09:15:35,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5411 states. [2023-12-22 09:15:35,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5411 to 4116. [2023-12-22 09:15:35,653 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:15:35,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4116 states to 4116 states and 5081 transitions. [2023-12-22 09:15:35,659 INFO L78 Accepts]: Start accepts. Automaton has 4116 states and 5081 transitions. Word has length 216 [2023-12-22 09:15:35,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 09:15:35,659 INFO L495 AbstractCegarLoop]: Abstraction has 4116 states and 5081 transitions. [2023-12-22 09:15:35,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 52.375) internal successors, (419), 7 states have internal predecessors, (419), 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:15:35,659 INFO L276 IsEmpty]: Start isEmpty. Operand 4116 states and 5081 transitions. [2023-12-22 09:15:35,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2023-12-22 09:15:35,661 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 09:15:35,661 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, 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, 1, 1, 1, 1, 1, 1, 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:15:35,681 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:15:35,866 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:15:35,866 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 09:15:35,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 09:15:35,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1287579065, now seen corresponding path program 1 times [2023-12-22 09:15:35,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 09:15:35,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [547782477] [2023-12-22 09:15:35,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 09:15:35,868 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:15:35,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 09:15:35,869 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:15:35,871 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:15:35,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 09:15:36,005 INFO L262 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-22 09:15:36,014 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 09:15:36,395 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 45 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 09:15:36,396 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 09:15:36,772 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 09:15:36,772 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 09:15:36,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [547782477] [2023-12-22 09:15:36,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [547782477] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-22 09:15:36,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-22 09:15:36,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-12-22 09:15:36,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829205709] [2023-12-22 09:15:36,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 09:15:36,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 09:15:36,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 09:15:36,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 09:15:36,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-22 09:15:36,774 INFO L87 Difference]: Start difference. First operand 4116 states and 5081 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 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:15:48,209 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:15:56,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 09:15:56,533 INFO L93 Difference]: Finished difference Result 9889 states and 12322 transitions. [2023-12-22 09:15:56,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 09:15:56,534 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 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 216 [2023-12-22 09:15:56,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 09:15:56,548 INFO L225 Difference]: With dead ends: 9889 [2023-12-22 09:15:56,549 INFO L226 Difference]: Without dead ends: 6326 [2023-12-22 09:15:56,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 427 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:15:56,556 INFO L413 NwaCegarLoop]: 303 mSDtfsCounter, 143 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.0s 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, 19.7s IncrementalHoareTripleChecker+Time [2023-12-22 09:15:56,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 324 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 19.7s Time] [2023-12-22 09:15:56,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6326 states. [2023-12-22 09:15:56,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6326 to 6326. [2023-12-22 09:15:56,629 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:15:56,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6326 states to 6326 states and 7523 transitions. [2023-12-22 09:15:56,640 INFO L78 Accepts]: Start accepts. Automaton has 6326 states and 7523 transitions. Word has length 216 [2023-12-22 09:15:56,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 09:15:56,640 INFO L495 AbstractCegarLoop]: Abstraction has 6326 states and 7523 transitions. [2023-12-22 09:15:56,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 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:15:56,640 INFO L276 IsEmpty]: Start isEmpty. Operand 6326 states and 7523 transitions. [2023-12-22 09:15:56,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2023-12-22 09:15:56,642 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 09:15:56,643 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 09:15:56,659 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:15:56,848 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:15:56,849 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 09:15:56,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 09:15:56,849 INFO L85 PathProgramCache]: Analyzing trace with hash -186188179, now seen corresponding path program 1 times [2023-12-22 09:15:56,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 09:15:56,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1163570373] [2023-12-22 09:15:56,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 09:15:56,851 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:15:56,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 09:15:56,852 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:15:56,854 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:15:56,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 09:15:56,983 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-22 09:15:56,987 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 09:15:59,073 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 14 proven. 127 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 09:15:59,079 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 09:17:35,772 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 125 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 09:17:35,773 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 09:17:35,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1163570373] [2023-12-22 09:17:35,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1163570373] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-22 09:17:35,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-22 09:17:35,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-12-22 09:17:35,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938717463] [2023-12-22 09:17:35,773 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-22 09:17:35,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-22 09:17:35,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 09:17:35,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-22 09:17:35,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-22 09:17:35,775 INFO L87 Difference]: Start difference. First operand 6326 states and 7523 transitions. Second operand has 8 states, 8 states have (on average 59.75) internal successors, (478), 7 states have internal predecessors, (478), 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:18:00,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.53s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:18:06,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:18:19,411 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:18:23,116 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:18:26,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:18:30,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.81s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:18:33,013 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:18:35,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:18:39,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.32s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:18:41,836 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:18:44,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.01s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:18:50,790 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:18:54,800 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:18:57,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:19:01,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.31s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:19:04,443 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:19:10,805 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:19:14,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.90s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:19:18,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:19:22,419 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:19:25,623 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:19:30,383 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:19:31,553 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:19:33,170 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:19:34,748 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:19:37,533 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:19:39,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:19:43,986 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:19:46,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:19:51,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:19:56,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:19:58,775 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:20:00,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:20:03,510 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:20:07,520 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:20:09,945 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:20:11,856 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:20:15,628 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:20:17,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:20:22,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:20:24,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.43s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:20:26,477 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:20:27,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:20:29,081 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:20:33,093 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:20:37,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.49s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:20:40,509 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:20:44,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.55s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:20:46,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:20:50,070 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:20:53,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.18s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:20:56,434 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:20:57,779 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:20:59,897 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:21:02,556 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:21:06,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.83s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:21:10,352 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:21:13,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.79s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:21:15,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:21:16,726 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:21:18,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:21:20,980 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:21:22,869 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:21:26,400 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:21:32,300 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:21:34,332 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:21:38,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.40s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:21:42,585 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:21:45,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:21:46,971 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:21:48,480 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:21:51,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.20s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:21:55,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:22:04,292 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:22:07,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.58s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:22:19,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:22:22,311 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:22:26,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:22:31,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:22:35,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.72s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:22:39,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 09:22:39,477 INFO L93 Difference]: Finished difference Result 15079 states and 18079 transitions. [2023-12-22 09:22:39,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-22 09:22:39,487 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 59.75) internal successors, (478), 7 states have internal predecessors, (478), 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 243 [2023-12-22 09:22:39,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 09:22:39,510 INFO L225 Difference]: With dead ends: 15079 [2023-12-22 09:22:39,510 INFO L226 Difference]: Without dead ends: 9274 [2023-12-22 09:22:39,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 478 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-12-22 09:22:39,549 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 425 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 2341 mSolverCounterSat, 298 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 284.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 2647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 2341 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 302.2s IncrementalHoareTripleChecker+Time [2023-12-22 09:22:39,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 241 Invalid, 2647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 2341 Invalid, 8 Unknown, 0 Unchecked, 302.2s Time] [2023-12-22 09:22:39,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9274 states. [2023-12-22 09:22:39,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9274 to 6510. [2023-12-22 09:22:39,619 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:22:39,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6510 states to 6510 states and 7681 transitions. [2023-12-22 09:22:39,627 INFO L78 Accepts]: Start accepts. Automaton has 6510 states and 7681 transitions. Word has length 243 [2023-12-22 09:22:39,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 09:22:39,628 INFO L495 AbstractCegarLoop]: Abstraction has 6510 states and 7681 transitions. [2023-12-22 09:22:39,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 59.75) internal successors, (478), 7 states have internal predecessors, (478), 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:22:39,628 INFO L276 IsEmpty]: Start isEmpty. Operand 6510 states and 7681 transitions. [2023-12-22 09:22:39,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2023-12-22 09:22:39,630 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 09:22:39,630 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 09:22:39,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-22 09:22:39,836 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:22:39,836 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 09:22:39,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 09:22:39,837 INFO L85 PathProgramCache]: Analyzing trace with hash -2117218510, now seen corresponding path program 1 times [2023-12-22 09:22:39,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 09:22:39,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1896814745] [2023-12-22 09:22:39,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 09:22:39,838 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:22:39,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 09:22:39,839 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:22:39,857 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:22:39,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 09:22:39,937 INFO L262 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-22 09:22:39,940 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 09:22:40,716 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 45 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 09:22:40,716 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 09:22:41,567 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:22:41,567 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 09:22:41,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1896814745] [2023-12-22 09:22:41,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1896814745] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-22 09:22:41,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-22 09:22:41,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-12-22 09:22:41,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849812081] [2023-12-22 09:22:41,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 09:22:41,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 09:22:41,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 09:22:41,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 09:22:41,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-22 09:22:41,569 INFO L87 Difference]: Start difference. First operand 6510 states and 7681 transitions. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 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:23:17,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 09:23:17,585 INFO L93 Difference]: Finished difference Result 15417 states and 18493 transitions. [2023-12-22 09:23:17,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 09:23:17,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 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 246 [2023-12-22 09:23:17,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 09:23:17,609 INFO L225 Difference]: With dead ends: 15417 [2023-12-22 09:23:17,609 INFO L226 Difference]: Without dead ends: 9828 [2023-12-22 09:23:17,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 487 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:23:17,614 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 137 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.9s 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, 35.9s IncrementalHoareTripleChecker+Time [2023-12-22 09:23:17,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 74 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 35.9s Time] [2023-12-22 09:23:17,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9828 states. [2023-12-22 09:23:17,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9828 to 9454. [2023-12-22 09:23:17,715 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:23:17,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9454 states to 9454 states and 11173 transitions. [2023-12-22 09:23:17,725 INFO L78 Accepts]: Start accepts. Automaton has 9454 states and 11173 transitions. Word has length 246 [2023-12-22 09:23:17,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 09:23:17,726 INFO L495 AbstractCegarLoop]: Abstraction has 9454 states and 11173 transitions. [2023-12-22 09:23:17,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 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:23:17,726 INFO L276 IsEmpty]: Start isEmpty. Operand 9454 states and 11173 transitions. [2023-12-22 09:23:17,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2023-12-22 09:23:17,729 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 09:23:17,730 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:17,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-22 09:23:17,934 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:23:17,935 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 09:23:17,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 09:23:17,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1640492375, now seen corresponding path program 1 times [2023-12-22 09:23:17,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 09:23:17,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1198515475] [2023-12-22 09:23:17,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 09:23:17,937 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:23:17,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 09:23:17,938 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:23:17,938 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:23:18,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 09:23:18,035 INFO L262 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-22 09:23:18,038 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 09:23:23,598 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2023-12-22 09:23:23,599 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 09:23:28,730 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2023-12-22 09:23:28,731 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 09:23:28,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1198515475] [2023-12-22 09:23:28,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1198515475] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-22 09:23:28,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-22 09:23:28,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-12-22 09:23:28,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94284691] [2023-12-22 09:23:28,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 09:23:28,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 09:23:28,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 09:23:28,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 09:23:28,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-22 09:23:28,732 INFO L87 Difference]: Start difference. First operand 9454 states and 11173 transitions. Second operand has 4 states, 4 states have (on average 48.25) internal successors, (193), 3 states have internal predecessors, (193), 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:23:35,510 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:23:41,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 09:23:41,848 INFO L93 Difference]: Finished difference Result 17818 states and 21378 transitions. [2023-12-22 09:23:41,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-22 09:23:41,848 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 48.25) internal successors, (193), 3 states have internal predecessors, (193), 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 259 [2023-12-22 09:23:41,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 09:23:41,860 INFO L225 Difference]: With dead ends: 17818 [2023-12-22 09:23:41,860 INFO L226 Difference]: Without dead ends: 10742 [2023-12-22 09:23:41,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 512 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:23:41,866 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 55 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s 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.0s IncrementalHoareTripleChecker+Time [2023-12-22 09:23:41,866 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.0s Time] [2023-12-22 09:23:41,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10742 states. [2023-12-22 09:23:41,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10742 to 9270. [2023-12-22 09:23:41,962 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:23:41,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9270 states to 9270 states and 10913 transitions. [2023-12-22 09:23:41,973 INFO L78 Accepts]: Start accepts. Automaton has 9270 states and 10913 transitions. Word has length 259 [2023-12-22 09:23:41,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 09:23:41,974 INFO L495 AbstractCegarLoop]: Abstraction has 9270 states and 10913 transitions. [2023-12-22 09:23:41,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.25) internal successors, (193), 3 states have internal predecessors, (193), 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:23:41,974 INFO L276 IsEmpty]: Start isEmpty. Operand 9270 states and 10913 transitions. [2023-12-22 09:23:41,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2023-12-22 09:23:41,978 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 09:23:41,978 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, 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, 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:23:41,986 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:23:42,188 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:23:42,188 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 09:23:42,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 09:23:42,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1289916577, now seen corresponding path program 1 times [2023-12-22 09:23:42,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 09:23:42,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1131492350] [2023-12-22 09:23:42,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 09:23:42,190 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 09:23:42,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 09:23:42,191 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:23:42,192 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:23:42,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 09:23:42,311 INFO L262 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-22 09:23:42,314 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 09:23:46,716 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 09:23:46,716 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 09:25:03,846 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 120 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 09:25:03,847 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 09:25:03,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1131492350] [2023-12-22 09:25:03,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1131492350] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-22 09:25:03,847 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-22 09:25:03,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-12-22 09:25:03,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996279940] [2023-12-22 09:25:03,847 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-22 09:25:03,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-22 09:25:03,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 09:25:03,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-22 09:25:03,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-12-22 09:25:03,848 INFO L87 Difference]: Start difference. First operand 9270 states and 10913 transitions. Second operand has 9 states, 9 states have (on average 56.666666666666664) internal successors, (510), 8 states have internal predecessors, (510), 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:25:26,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:25:29,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:25:33,493 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:25:38,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.33s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:25:40,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:25:44,925 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:25:48,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.19s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:25:53,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:25:58,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] Received shutdown request... [2023-12-22 09:26:15,336 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:26:15,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:26:16,287 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:26:16,374 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:26:16,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 515 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-12-22 09:26:16,389 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 739 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 3060 mSolverCounterSat, 70 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 66.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 739 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 3132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 3060 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 72.3s IncrementalHoareTripleChecker+Time [2023-12-22 09:26:16,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [739 Valid, 154 Invalid, 3132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 3060 Invalid, 1 Unknown, 0 Unchecked, 72.3s Time] [2023-12-22 09:26:16,391 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-22 09:26:16,391 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-12-22 09:26:16,397 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 09:26:16,408 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-22 09:26:16,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 09:26:16 BoogieIcfgContainer [2023-12-22 09:26:16,412 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-22 09:26:16,412 INFO L158 Benchmark]: Toolchain (without parser) took 879300.00ms. Allocated memory was 294.6MB in the beginning and 372.2MB in the end (delta: 77.6MB). Free memory was 237.8MB in the beginning and 281.5MB in the end (delta: -43.7MB). Peak memory consumption was 246.8MB. Max. memory is 8.0GB. [2023-12-22 09:26:16,412 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 173.0MB. Free memory is still 121.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-22 09:26:16,412 INFO L158 Benchmark]: CACSL2BoogieTranslator took 583.07ms. Allocated memory is still 294.6MB. Free memory was 237.3MB in the beginning and 184.4MB in the end (delta: 53.0MB). Peak memory consumption was 52.4MB. Max. memory is 8.0GB. [2023-12-22 09:26:16,412 INFO L158 Benchmark]: Boogie Procedure Inliner took 94.50ms. Allocated memory is still 294.6MB. Free memory was 184.4MB in the beginning and 175.4MB in the end (delta: 9.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-12-22 09:26:16,413 INFO L158 Benchmark]: Boogie Preprocessor took 113.10ms. Allocated memory is still 294.6MB. Free memory was 175.4MB in the beginning and 165.5MB in the end (delta: 9.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-12-22 09:26:16,413 INFO L158 Benchmark]: RCFGBuilder took 7721.70ms. Allocated memory is still 294.6MB. Free memory was 165.5MB in the beginning and 240.6MB in the end (delta: -75.1MB). Peak memory consumption was 69.6MB. Max. memory is 8.0GB. [2023-12-22 09:26:16,413 INFO L158 Benchmark]: TraceAbstraction took 870781.93ms. Allocated memory was 294.6MB in the beginning and 372.2MB in the end (delta: 77.6MB). Free memory was 239.6MB in the beginning and 281.5MB in the end (delta: -41.9MB). Peak memory consumption was 247.5MB. Max. memory is 8.0GB. [2023-12-22 09:26:16,414 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 173.0MB. Free memory is still 121.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 583.07ms. Allocated memory is still 294.6MB. Free memory was 237.3MB in the beginning and 184.4MB in the end (delta: 53.0MB). Peak memory consumption was 52.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 94.50ms. Allocated memory is still 294.6MB. Free memory was 184.4MB in the beginning and 175.4MB in the end (delta: 9.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 113.10ms. Allocated memory is still 294.6MB. Free memory was 175.4MB in the beginning and 165.5MB in the end (delta: 9.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * RCFGBuilder took 7721.70ms. Allocated memory is still 294.6MB. Free memory was 165.5MB in the beginning and 240.6MB in the end (delta: -75.1MB). Peak memory consumption was 69.6MB. Max. memory is 8.0GB. * TraceAbstraction took 870781.93ms. Allocated memory was 294.6MB in the beginning and 372.2MB in the end (delta: 77.6MB). Free memory was 239.6MB in the beginning and 281.5MB in the end (delta: -41.9MB). Peak memory consumption was 247.5MB. 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: 91]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 91). Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 221 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 870.7s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 628.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 11 mSolverCounterUnknown, 2832 SdHoareTripleChecker+Valid, 624.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2832 mSDsluCounter, 2732 SdHoareTripleChecker+Invalid, 580.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 507 mSDsCounter, 1712 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13356 IncrementalHoareTripleChecker+Invalid, 15080 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1712 mSolverCounterUnsat, 2225 mSDtfsCounter, 13356 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3867 GetRequests, 3827 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s 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.6s AutomataMinimizationTime, 12 MinimizatonAttempts, 5935 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 237.9s InterpolantComputationTime, 2237 NumberOfCodeBlocks, 2237 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 3864 ConstructedInterpolants, 0 QuantifiedInterpolants, 38645 SizeOfPredicates, 8 NumberOfNonLiveVariables, 2880 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 20 InterpolantComputations, 10 PerfectInterpolantSequences, 1251/1966 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