/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/recursive-simple/id_i25_o25-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 06:26:56,125 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 06:26:56,161 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-25 06:26:56,164 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 06:26:56,165 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 06:26:56,178 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 06:26:56,178 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 06:26:56,178 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 06:26:56,179 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 06:26:56,179 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 06:26:56,179 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 06:26:56,180 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 06:26:56,180 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 06:26:56,180 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 06:26:56,181 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 06:26:56,181 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 06:26:56,181 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 06:26:56,181 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 06:26:56,182 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 06:26:56,182 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 06:26:56,182 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 06:26:56,182 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 06:26:56,183 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 06:26:56,183 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 06:26:56,183 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 06:26:56,183 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 06:26:56,184 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 06:26:56,184 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 06:26:56,184 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 06:26:56,184 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 06:26:56,185 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 06:26:56,185 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 06:26:56,185 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 06:26:56,185 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 06:26:56,186 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 06:26:56,186 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 06:26:56,186 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 06:26:56,186 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 06:26:56,187 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 06:26:56,187 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 06:26:56,187 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 06:26:56,187 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 06:26:56,188 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 06:26:56,188 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 06:26:56,188 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 06:26:56,188 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 06:26:56,188 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-25 06:26:56,355 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 06:26:56,380 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 06:26:56,382 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 06:26:56,382 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 06:26:56,388 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 06:26:56,390 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_i25_o25-2.c [2023-12-25 06:26:57,458 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 06:26:57,614 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 06:26:57,614 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_i25_o25-2.c [2023-12-25 06:26:57,619 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a73acec7b/2f14fc3294ee42b6adf3f9b3fdeb5e1c/FLAG83fd0bac2 [2023-12-25 06:26:57,636 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a73acec7b/2f14fc3294ee42b6adf3f9b3fdeb5e1c [2023-12-25 06:26:57,638 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 06:26:57,639 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 06:26:57,640 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 06:26:57,640 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 06:26:57,643 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 06:26:57,644 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 06:26:57" (1/1) ... [2023-12-25 06:26:57,644 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@128f1384 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:26:57, skipping insertion in model container [2023-12-25 06:26:57,645 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 06:26:57" (1/1) ... [2023-12-25 06:26:57,660 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 06:26:57,773 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_i25_o25-2.c[454,467] [2023-12-25 06:26:57,775 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 06:26:57,784 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 06:26:57,796 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_i25_o25-2.c[454,467] [2023-12-25 06:26:57,796 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 06:26:57,807 INFO L206 MainTranslator]: Completed translation [2023-12-25 06:26:57,808 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:26:57 WrapperNode [2023-12-25 06:26:57,808 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 06:26:57,809 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 06:26:57,809 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 06:26:57,809 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 06:26:57,814 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:26:57" (1/1) ... [2023-12-25 06:26:57,819 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:26:57" (1/1) ... [2023-12-25 06:26:57,830 INFO L138 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 17 [2023-12-25 06:26:57,831 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 06:26:57,831 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 06:26:57,831 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 06:26:57,832 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 06:26:57,838 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:26:57" (1/1) ... [2023-12-25 06:26:57,839 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:26:57" (1/1) ... [2023-12-25 06:26:57,840 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:26:57" (1/1) ... [2023-12-25 06:26:57,847 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-25 06:26:57,848 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:26:57" (1/1) ... [2023-12-25 06:26:57,848 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:26:57" (1/1) ... [2023-12-25 06:26:57,850 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:26:57" (1/1) ... [2023-12-25 06:26:57,851 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:26:57" (1/1) ... [2023-12-25 06:26:57,852 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:26:57" (1/1) ... [2023-12-25 06:26:57,853 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:26:57" (1/1) ... [2023-12-25 06:26:57,860 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 06:26:57,860 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 06:26:57,860 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 06:26:57,861 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 06:26:57,861 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:26:57" (1/1) ... [2023-12-25 06:26:57,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 06:26:57,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 06:26:57,911 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-25 06:26:57,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-25 06:26:57,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 06:26:57,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 06:26:57,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 06:26:57,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 06:26:57,937 INFO L130 BoogieDeclarations]: Found specification of procedure id [2023-12-25 06:26:57,937 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2023-12-25 06:26:57,985 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 06:26:57,988 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 06:26:58,106 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 06:26:58,130 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 06:26:58,130 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-25 06:26:58,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 06:26:58 BoogieIcfgContainer [2023-12-25 06:26:58,130 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 06:26:58,134 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 06:26:58,134 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 06:26:58,137 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 06:26:58,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 06:26:57" (1/3) ... [2023-12-25 06:26:58,138 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18d74b82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 06:26:58, skipping insertion in model container [2023-12-25 06:26:58,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:26:57" (2/3) ... [2023-12-25 06:26:58,138 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18d74b82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 06:26:58, skipping insertion in model container [2023-12-25 06:26:58,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 06:26:58" (3/3) ... [2023-12-25 06:26:58,140 INFO L112 eAbstractionObserver]: Analyzing ICFG id_i25_o25-2.c [2023-12-25 06:26:58,153 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 06:26:58,153 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 06:26:58,189 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 06:26:58,211 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;@1daa20df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 06:26:58,212 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 06:26:58,215 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 06:26:58,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-25 06:26:58,241 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:26:58,241 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:26:58,242 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:26:58,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:26:58,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1493244868, now seen corresponding path program 1 times [2023-12-25 06:26:58,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:26:58,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2058148416] [2023-12-25 06:26:58,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:26:58,255 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 06:26:58,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:26:58,268 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 06:26:58,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-25 06:26:58,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:26:58,313 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 06:26:58,316 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:26:58,374 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-25 06:26:58,374 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 06:26:58,375 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:26:58,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2058148416] [2023-12-25 06:26:58,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2058148416] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 06:26:58,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 06:26:58,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 06:26:58,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280207304] [2023-12-25 06:26:58,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 06:26:58,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 06:26:58,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:26:58,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 06:26:58,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 06:26:58,399 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-25 06:26:58,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:26:58,442 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2023-12-25 06:26:58,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 06:26:58,445 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2023-12-25 06:26:58,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:26:58,450 INFO L225 Difference]: With dead ends: 22 [2023-12-25 06:26:58,450 INFO L226 Difference]: Without dead ends: 14 [2023-12-25 06:26:58,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-25 06:26:58,455 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 9 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 06:26:58,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 23 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 06:26:58,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2023-12-25 06:26:58,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2023-12-25 06:26:58,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 10 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-25 06:26:58,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2023-12-25 06:26:58,480 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2023-12-25 06:26:58,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:26:58,480 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2023-12-25 06:26:58,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-25 06:26:58,480 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2023-12-25 06:26:58,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-25 06:26:58,481 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:26:58,481 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:26:58,485 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-25 06:26:58,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 06:26:58,684 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:26:58,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:26:58,686 INFO L85 PathProgramCache]: Analyzing trace with hash -642736818, now seen corresponding path program 1 times [2023-12-25 06:26:58,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:26:58,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1429691380] [2023-12-25 06:26:58,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:26:58,686 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 06:26:58,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:26:58,687 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 06:26:58,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-25 06:26:58,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:26:58,725 INFO L262 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 06:26:58,726 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:26:58,789 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-25 06:26:58,789 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:26:58,924 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-25 06:26:58,924 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:26:58,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1429691380] [2023-12-25 06:26:58,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1429691380] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:26:58,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:26:58,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2023-12-25 06:26:58,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825991205] [2023-12-25 06:26:58,925 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:26:58,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 06:26:58,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:26:58,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 06:26:58,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-12-25 06:26:58,927 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 9 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 06:26:58,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:26:58,975 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2023-12-25 06:26:58,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 06:26:58,975 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) Word has length 15 [2023-12-25 06:26:58,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:26:58,976 INFO L225 Difference]: With dead ends: 21 [2023-12-25 06:26:58,976 INFO L226 Difference]: Without dead ends: 17 [2023-12-25 06:26:58,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-12-25 06:26:58,977 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 9 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 06:26:58,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 38 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 06:26:58,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-12-25 06:26:58,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-12-25 06:26:58,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 12 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-25 06:26:58,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2023-12-25 06:26:58,981 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2023-12-25 06:26:58,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:26:58,982 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2023-12-25 06:26:58,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 06:26:58,982 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2023-12-25 06:26:58,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-25 06:26:58,983 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:26:58,983 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:26:58,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-25 06:26:59,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 06:26:59,185 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:26:59,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:26:59,186 INFO L85 PathProgramCache]: Analyzing trace with hash -2123675004, now seen corresponding path program 2 times [2023-12-25 06:26:59,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:26:59,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1216047544] [2023-12-25 06:26:59,186 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 06:26:59,187 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 06:26:59,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:26:59,188 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 06:26:59,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-25 06:26:59,215 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 06:26:59,215 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:26:59,216 INFO L262 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 06:26:59,217 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:26:59,265 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-25 06:26:59,265 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:26:59,433 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-25 06:26:59,433 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:26:59,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1216047544] [2023-12-25 06:26:59,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1216047544] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:26:59,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:26:59,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 11 [2023-12-25 06:26:59,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690078441] [2023-12-25 06:26:59,434 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:26:59,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-25 06:26:59,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:26:59,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-25 06:26:59,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-12-25 06:26:59,435 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2023-12-25 06:26:59,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:26:59,496 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2023-12-25 06:26:59,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 06:26:59,496 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Word has length 21 [2023-12-25 06:26:59,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:26:59,497 INFO L225 Difference]: With dead ends: 24 [2023-12-25 06:26:59,497 INFO L226 Difference]: Without dead ends: 20 [2023-12-25 06:26:59,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-12-25 06:26:59,500 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 32 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 06:26:59,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 40 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 06:26:59,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-12-25 06:26:59,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-12-25 06:26:59,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 14 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 06:26:59,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2023-12-25 06:26:59,509 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 21 [2023-12-25 06:26:59,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:26:59,509 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2023-12-25 06:26:59,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2023-12-25 06:26:59,510 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2023-12-25 06:26:59,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-25 06:26:59,511 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:26:59,511 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:26:59,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-25 06:26:59,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 06:26:59,714 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:26:59,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:26:59,714 INFO L85 PathProgramCache]: Analyzing trace with hash 54189198, now seen corresponding path program 3 times [2023-12-25 06:26:59,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:26:59,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [282838804] [2023-12-25 06:26:59,715 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 06:26:59,715 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 06:26:59,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:26:59,728 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 06:26:59,768 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-25 06:26:59,768 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:26:59,769 INFO L262 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-25 06:26:59,786 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:26:59,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-25 06:26:59,849 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-25 06:26:59,849 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:27:00,101 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-25 06:27:00,104 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:27:00,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [282838804] [2023-12-25 06:27:00,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [282838804] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:27:00,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:27:00,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 13 [2023-12-25 06:27:00,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838174345] [2023-12-25 06:27:00,105 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:27:00,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-25 06:27:00,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:27:00,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-25 06:27:00,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-12-25 06:27:00,109 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 4 states have call predecessors, (8), 6 states have call successors, (8) [2023-12-25 06:27:00,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:27:00,198 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2023-12-25 06:27:00,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 06:27:00,199 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 4 states have call predecessors, (8), 6 states have call successors, (8) Word has length 27 [2023-12-25 06:27:00,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:27:00,199 INFO L225 Difference]: With dead ends: 27 [2023-12-25 06:27:00,199 INFO L226 Difference]: Without dead ends: 23 [2023-12-25 06:27:00,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2023-12-25 06:27:00,202 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 40 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 06:27:00,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 61 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 06:27:00,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-25 06:27:00,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-12-25 06:27:00,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-25 06:27:00,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2023-12-25 06:27:00,211 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 27 [2023-12-25 06:27:00,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:27:00,212 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2023-12-25 06:27:00,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 4 states have call predecessors, (8), 6 states have call successors, (8) [2023-12-25 06:27:00,212 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2023-12-25 06:27:00,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-25 06:27:00,214 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:27:00,214 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:27:00,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-25 06:27:00,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 06:27:00,418 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:27:00,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:27:00,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1269749436, now seen corresponding path program 4 times [2023-12-25 06:27:00,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:27:00,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1888835084] [2023-12-25 06:27:00,421 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-25 06:27:00,421 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 06:27:00,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:27:00,424 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 06:27:00,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-25 06:27:00,476 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-25 06:27:00,476 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:27:00,477 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 06:27:00,479 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:27:00,554 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-25 06:27:00,554 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:27:00,862 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-25 06:27:00,862 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:27:00,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1888835084] [2023-12-25 06:27:00,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1888835084] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:27:00,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:27:00,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 15 [2023-12-25 06:27:00,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199062179] [2023-12-25 06:27:00,863 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:27:00,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-25 06:27:00,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:27:00,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-25 06:27:00,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2023-12-25 06:27:00,865 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 15 states, 13 states have (on average 2.076923076923077) internal successors, (27), 14 states have internal predecessors, (27), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) [2023-12-25 06:27:00,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:27:00,960 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2023-12-25 06:27:00,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 06:27:00,961 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.076923076923077) internal successors, (27), 14 states have internal predecessors, (27), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) Word has length 33 [2023-12-25 06:27:00,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:27:00,962 INFO L225 Difference]: With dead ends: 30 [2023-12-25 06:27:00,962 INFO L226 Difference]: Without dead ends: 26 [2023-12-25 06:27:00,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2023-12-25 06:27:00,963 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 65 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:27:00,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 91 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 06:27:00,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-25 06:27:00,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-12-25 06:27:00,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 18 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 6 states have return successors, (7), 6 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-25 06:27:00,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2023-12-25 06:27:00,968 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 33 [2023-12-25 06:27:00,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:27:00,970 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2023-12-25 06:27:00,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.076923076923077) internal successors, (27), 14 states have internal predecessors, (27), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) [2023-12-25 06:27:00,971 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2023-12-25 06:27:00,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-25 06:27:00,971 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:27:00,971 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:27:00,990 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-25 06:27:01,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 06:27:01,172 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:27:01,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:27:01,173 INFO L85 PathProgramCache]: Analyzing trace with hash -4035634, now seen corresponding path program 5 times [2023-12-25 06:27:01,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:27:01,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1148877745] [2023-12-25 06:27:01,173 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-25 06:27:01,173 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 06:27:01,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:27:01,177 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 06:27:01,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-25 06:27:01,243 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-12-25 06:27:01,243 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:27:01,244 INFO L262 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-25 06:27:01,249 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:27:01,342 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-25 06:27:01,342 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:27:01,807 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-25 06:27:01,807 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:27:01,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1148877745] [2023-12-25 06:27:01,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1148877745] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:27:01,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:27:01,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15] total 17 [2023-12-25 06:27:01,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492107082] [2023-12-25 06:27:01,808 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:27:01,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-25 06:27:01,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:27:01,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-25 06:27:01,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2023-12-25 06:27:01,810 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 17 states, 15 states have (on average 2.066666666666667) internal successors, (31), 16 states have internal predecessors, (31), 8 states have call successors, (8), 1 states have call predecessors, (8), 6 states have return successors, (12), 6 states have call predecessors, (12), 8 states have call successors, (12) [2023-12-25 06:27:01,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:27:01,913 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2023-12-25 06:27:01,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 06:27:01,914 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.066666666666667) internal successors, (31), 16 states have internal predecessors, (31), 8 states have call successors, (8), 1 states have call predecessors, (8), 6 states have return successors, (12), 6 states have call predecessors, (12), 8 states have call successors, (12) Word has length 39 [2023-12-25 06:27:01,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:27:01,915 INFO L225 Difference]: With dead ends: 33 [2023-12-25 06:27:01,915 INFO L226 Difference]: Without dead ends: 29 [2023-12-25 06:27:01,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2023-12-25 06:27:01,916 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 65 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:27:01,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 128 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 06:27:01,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-12-25 06:27:01,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-12-25 06:27:01,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 20 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 7 states have return successors, (8), 7 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-25 06:27:01,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2023-12-25 06:27:01,920 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 39 [2023-12-25 06:27:01,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:27:01,920 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2023-12-25 06:27:01,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.066666666666667) internal successors, (31), 16 states have internal predecessors, (31), 8 states have call successors, (8), 1 states have call predecessors, (8), 6 states have return successors, (12), 6 states have call predecessors, (12), 8 states have call successors, (12) [2023-12-25 06:27:01,920 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2023-12-25 06:27:01,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-25 06:27:01,921 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:27:01,921 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:27:01,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-25 06:27:02,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 06:27:02,124 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:27:02,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:27:02,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1047611388, now seen corresponding path program 6 times [2023-12-25 06:27:02,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:27:02,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1687224132] [2023-12-25 06:27:02,124 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-25 06:27:02,124 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 06:27:02,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:27:02,125 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 06:27:02,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-25 06:27:02,166 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2023-12-25 06:27:02,167 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:27:02,169 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-25 06:27:02,171 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:27:02,301 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-12-25 06:27:02,301 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:27:02,689 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-12-25 06:27:02,689 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:27:02,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1687224132] [2023-12-25 06:27:02,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1687224132] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:27:02,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:27:02,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2023-12-25 06:27:02,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544574236] [2023-12-25 06:27:02,690 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:27:02,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-25 06:27:02,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:27:02,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-25 06:27:02,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=844, Unknown=0, NotChecked=0, Total=992 [2023-12-25 06:27:02,691 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 32 states, 32 states have (on average 1.125) internal successors, (36), 18 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 14 states have return successors, (14), 14 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-25 06:27:02,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:27:02,968 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2023-12-25 06:27:02,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-12-25 06:27:02,968 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.125) internal successors, (36), 18 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 14 states have return successors, (14), 14 states have call predecessors, (14), 1 states have call successors, (14) Word has length 45 [2023-12-25 06:27:02,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:27:02,969 INFO L225 Difference]: With dead ends: 56 [2023-12-25 06:27:02,969 INFO L226 Difference]: Without dead ends: 50 [2023-12-25 06:27:02,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=293, Invalid=1429, Unknown=0, NotChecked=0, Total=1722 [2023-12-25 06:27:02,970 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:27:02,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 337 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 06:27:02,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-12-25 06:27:02,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2023-12-25 06:27:02,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 34 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 14 states have return successors, (15), 14 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-25 06:27:02,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2023-12-25 06:27:02,975 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 45 [2023-12-25 06:27:02,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:27:02,975 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2023-12-25 06:27:02,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.125) internal successors, (36), 18 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 14 states have return successors, (14), 14 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-25 06:27:02,975 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2023-12-25 06:27:02,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-12-25 06:27:02,979 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:27:02,979 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:27:02,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-25 06:27:03,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 06:27:03,180 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:27:03,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:27:03,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1570097358, now seen corresponding path program 7 times [2023-12-25 06:27:03,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:27:03,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [727978772] [2023-12-25 06:27:03,181 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-25 06:27:03,181 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 06:27:03,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:27:03,184 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 06:27:03,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-25 06:27:03,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:27:03,230 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-25 06:27:03,233 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:27:03,427 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2023-12-25 06:27:03,427 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:27:05,271 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-12-25 06:27:05,272 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:27:05,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [727978772] [2023-12-25 06:27:05,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [727978772] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:27:05,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:27:05,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 31] total 33 [2023-12-25 06:27:05,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441244309] [2023-12-25 06:27:05,272 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:27:05,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-25 06:27:05,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:27:05,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-25 06:27:05,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=964, Unknown=0, NotChecked=0, Total=1056 [2023-12-25 06:27:05,274 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand has 33 states, 31 states have (on average 2.032258064516129) internal successors, (63), 32 states have internal predecessors, (63), 16 states have call successors, (16), 1 states have call predecessors, (16), 14 states have return successors, (28), 14 states have call predecessors, (28), 16 states have call successors, (28) [2023-12-25 06:27:05,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:27:05,574 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2023-12-25 06:27:05,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-25 06:27:05,575 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 31 states have (on average 2.032258064516129) internal successors, (63), 32 states have internal predecessors, (63), 16 states have call successors, (16), 1 states have call predecessors, (16), 14 states have return successors, (28), 14 states have call predecessors, (28), 16 states have call successors, (28) Word has length 87 [2023-12-25 06:27:05,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:27:05,575 INFO L225 Difference]: With dead ends: 57 [2023-12-25 06:27:05,576 INFO L226 Difference]: Without dead ends: 53 [2023-12-25 06:27:05,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=344, Invalid=1818, Unknown=0, NotChecked=0, Total=2162 [2023-12-25 06:27:05,577 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 204 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 06:27:05,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 470 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 06:27:05,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-12-25 06:27:05,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2023-12-25 06:27:05,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 36 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 15 states have return successors, (16), 15 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-25 06:27:05,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2023-12-25 06:27:05,585 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 87 [2023-12-25 06:27:05,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:27:05,586 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2023-12-25 06:27:05,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 31 states have (on average 2.032258064516129) internal successors, (63), 32 states have internal predecessors, (63), 16 states have call successors, (16), 1 states have call predecessors, (16), 14 states have return successors, (28), 14 states have call predecessors, (28), 16 states have call successors, (28) [2023-12-25 06:27:05,586 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2023-12-25 06:27:05,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-25 06:27:05,587 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:27:05,587 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:27:05,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-25 06:27:05,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 06:27:05,792 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:27:05,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:27:05,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1407069436, now seen corresponding path program 8 times [2023-12-25 06:27:05,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:27:05,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [773613642] [2023-12-25 06:27:05,793 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 06:27:05,793 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 06:27:05,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:27:05,794 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 06:27:05,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-25 06:27:05,849 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 06:27:05,850 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:27:05,852 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 32 conjunts are in the unsatisfiable core [2023-12-25 06:27:05,854 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:27:06,053 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2023-12-25 06:27:06,053 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:27:08,006 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 497 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2023-12-25 06:27:08,007 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:27:08,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [773613642] [2023-12-25 06:27:08,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [773613642] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:27:08,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:27:08,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 33] total 35 [2023-12-25 06:27:08,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192992872] [2023-12-25 06:27:08,007 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:27:08,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-12-25 06:27:08,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:27:08,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-12-25 06:27:08,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1092, Unknown=0, NotChecked=0, Total=1190 [2023-12-25 06:27:08,009 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand has 35 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 34 states have internal predecessors, (67), 17 states have call successors, (17), 1 states have call predecessors, (17), 15 states have return successors, (30), 15 states have call predecessors, (30), 17 states have call successors, (30) [2023-12-25 06:27:08,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:27:08,333 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2023-12-25 06:27:08,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-25 06:27:08,334 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 34 states have internal predecessors, (67), 17 states have call successors, (17), 1 states have call predecessors, (17), 15 states have return successors, (30), 15 states have call predecessors, (30), 17 states have call successors, (30) Word has length 93 [2023-12-25 06:27:08,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:27:08,335 INFO L225 Difference]: With dead ends: 60 [2023-12-25 06:27:08,335 INFO L226 Difference]: Without dead ends: 56 [2023-12-25 06:27:08,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=383, Invalid=2067, Unknown=0, NotChecked=0, Total=2450 [2023-12-25 06:27:08,336 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 308 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 06:27:08,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 529 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 06:27:08,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-12-25 06:27:08,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2023-12-25 06:27:08,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.027027027027027) internal successors, (38), 38 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 16 states have return successors, (17), 16 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-25 06:27:08,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2023-12-25 06:27:08,340 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 93 [2023-12-25 06:27:08,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:27:08,341 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2023-12-25 06:27:08,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 34 states have internal predecessors, (67), 17 states have call successors, (17), 1 states have call predecessors, (17), 15 states have return successors, (30), 15 states have call predecessors, (30), 17 states have call successors, (30) [2023-12-25 06:27:08,341 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2023-12-25 06:27:08,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-25 06:27:08,342 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:27:08,342 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:27:08,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-25 06:27:08,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 06:27:08,545 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:27:08,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:27:08,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1758730226, now seen corresponding path program 9 times [2023-12-25 06:27:08,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:27:08,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2106393472] [2023-12-25 06:27:08,546 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 06:27:08,546 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 06:27:08,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:27:08,547 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 06:27:08,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-25 06:27:08,634 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2023-12-25 06:27:08,634 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:27:08,637 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 34 conjunts are in the unsatisfiable core [2023-12-25 06:27:08,639 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:27:08,878 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2023-12-25 06:27:08,878 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:27:10,641 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 570 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-12-25 06:27:10,642 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:27:10,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2106393472] [2023-12-25 06:27:10,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2106393472] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:27:10,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:27:10,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 35] total 37 [2023-12-25 06:27:10,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832704930] [2023-12-25 06:27:10,642 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:27:10,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-12-25 06:27:10,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:27:10,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-12-25 06:27:10,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1228, Unknown=0, NotChecked=0, Total=1332 [2023-12-25 06:27:10,644 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand has 37 states, 35 states have (on average 2.0285714285714285) internal successors, (71), 36 states have internal predecessors, (71), 18 states have call successors, (18), 1 states have call predecessors, (18), 16 states have return successors, (32), 16 states have call predecessors, (32), 18 states have call successors, (32) [2023-12-25 06:27:10,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:27:10,941 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2023-12-25 06:27:10,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-25 06:27:10,942 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 35 states have (on average 2.0285714285714285) internal successors, (71), 36 states have internal predecessors, (71), 18 states have call successors, (18), 1 states have call predecessors, (18), 16 states have return successors, (32), 16 states have call predecessors, (32), 18 states have call successors, (32) Word has length 99 [2023-12-25 06:27:10,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:27:10,943 INFO L225 Difference]: With dead ends: 63 [2023-12-25 06:27:10,943 INFO L226 Difference]: Without dead ends: 59 [2023-12-25 06:27:10,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=424, Invalid=2332, Unknown=0, NotChecked=0, Total=2756 [2023-12-25 06:27:10,945 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 37 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:27:10,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 637 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 06:27:10,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-12-25 06:27:10,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2023-12-25 06:27:10,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 40 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 17 states have return successors, (18), 17 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-25 06:27:10,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2023-12-25 06:27:10,949 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 99 [2023-12-25 06:27:10,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:27:10,950 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2023-12-25 06:27:10,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 35 states have (on average 2.0285714285714285) internal successors, (71), 36 states have internal predecessors, (71), 18 states have call successors, (18), 1 states have call predecessors, (18), 16 states have return successors, (32), 16 states have call predecessors, (32), 18 states have call successors, (32) [2023-12-25 06:27:10,950 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2023-12-25 06:27:10,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-25 06:27:10,951 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:27:10,951 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:27:10,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-25 06:27:11,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 06:27:11,165 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:27:11,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:27:11,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1678126652, now seen corresponding path program 10 times [2023-12-25 06:27:11,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:27:11,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [818718226] [2023-12-25 06:27:11,166 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-25 06:27:11,166 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 06:27:11,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:27:11,168 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 06:27:11,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-25 06:27:11,256 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-25 06:27:11,256 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:27:11,259 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 36 conjunts are in the unsatisfiable core [2023-12-25 06:27:11,262 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:27:11,482 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2023-12-25 06:27:11,482 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:27:13,798 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2023-12-25 06:27:13,799 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:27:13,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [818718226] [2023-12-25 06:27:13,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [818718226] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:27:13,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:27:13,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 37] total 39 [2023-12-25 06:27:13,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152320588] [2023-12-25 06:27:13,799 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:27:13,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-12-25 06:27:13,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:27:13,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-12-25 06:27:13,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1372, Unknown=0, NotChecked=0, Total=1482 [2023-12-25 06:27:13,801 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand has 39 states, 37 states have (on average 2.027027027027027) internal successors, (75), 38 states have internal predecessors, (75), 19 states have call successors, (19), 1 states have call predecessors, (19), 17 states have return successors, (34), 17 states have call predecessors, (34), 19 states have call successors, (34) [2023-12-25 06:27:14,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:27:14,227 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2023-12-25 06:27:14,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-25 06:27:14,227 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 37 states have (on average 2.027027027027027) internal successors, (75), 38 states have internal predecessors, (75), 19 states have call successors, (19), 1 states have call predecessors, (19), 17 states have return successors, (34), 17 states have call predecessors, (34), 19 states have call successors, (34) Word has length 105 [2023-12-25 06:27:14,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:27:14,228 INFO L225 Difference]: With dead ends: 66 [2023-12-25 06:27:14,228 INFO L226 Difference]: Without dead ends: 62 [2023-12-25 06:27:14,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=467, Invalid=2613, Unknown=0, NotChecked=0, Total=3080 [2023-12-25 06:27:14,230 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 552 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 571 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 06:27:14,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [571 Valid, 671 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 06:27:14,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-12-25 06:27:14,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2023-12-25 06:27:14,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 41 states have (on average 1.024390243902439) internal successors, (42), 42 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 18 states have return successors, (19), 18 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-25 06:27:14,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2023-12-25 06:27:14,236 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 105 [2023-12-25 06:27:14,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:27:14,236 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2023-12-25 06:27:14,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 37 states have (on average 2.027027027027027) internal successors, (75), 38 states have internal predecessors, (75), 19 states have call successors, (19), 1 states have call predecessors, (19), 17 states have return successors, (34), 17 states have call predecessors, (34), 19 states have call successors, (34) [2023-12-25 06:27:14,236 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2023-12-25 06:27:14,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-25 06:27:14,237 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:27:14,237 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:27:14,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-25 06:27:14,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 06:27:14,446 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:27:14,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:27:14,446 INFO L85 PathProgramCache]: Analyzing trace with hash -543729842, now seen corresponding path program 11 times [2023-12-25 06:27:14,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:27:14,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [643651105] [2023-12-25 06:27:14,447 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-25 06:27:14,447 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 06:27:14,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:27:14,448 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 06:27:14,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-25 06:27:14,561 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2023-12-25 06:27:14,562 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:27:14,564 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 38 conjunts are in the unsatisfiable core [2023-12-25 06:27:14,566 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:27:14,844 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2023-12-25 06:27:14,845 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:27:17,225 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 731 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-12-25 06:27:17,226 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:27:17,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [643651105] [2023-12-25 06:27:17,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [643651105] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:27:17,226 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:27:17,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 39] total 41 [2023-12-25 06:27:17,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476717627] [2023-12-25 06:27:17,226 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:27:17,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-12-25 06:27:17,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:27:17,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-12-25 06:27:17,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1524, Unknown=0, NotChecked=0, Total=1640 [2023-12-25 06:27:17,228 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand has 41 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 40 states have internal predecessors, (79), 20 states have call successors, (20), 1 states have call predecessors, (20), 18 states have return successors, (36), 18 states have call predecessors, (36), 20 states have call successors, (36) [2023-12-25 06:27:17,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:27:17,724 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2023-12-25 06:27:17,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-25 06:27:17,725 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 40 states have internal predecessors, (79), 20 states have call successors, (20), 1 states have call predecessors, (20), 18 states have return successors, (36), 18 states have call predecessors, (36), 20 states have call successors, (36) Word has length 111 [2023-12-25 06:27:17,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:27:17,725 INFO L225 Difference]: With dead ends: 69 [2023-12-25 06:27:17,725 INFO L226 Difference]: Without dead ends: 65 [2023-12-25 06:27:17,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=512, Invalid=2910, Unknown=0, NotChecked=0, Total=3422 [2023-12-25 06:27:17,727 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 44 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 06:27:17,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 766 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 06:27:17,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-12-25 06:27:17,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2023-12-25 06:27:17,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 44 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 19 states have return successors, (20), 19 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-25 06:27:17,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2023-12-25 06:27:17,731 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 111 [2023-12-25 06:27:17,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:27:17,731 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2023-12-25 06:27:17,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 40 states have internal predecessors, (79), 20 states have call successors, (20), 1 states have call predecessors, (20), 18 states have return successors, (36), 18 states have call predecessors, (36), 20 states have call successors, (36) [2023-12-25 06:27:17,731 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2023-12-25 06:27:17,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-25 06:27:17,732 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:27:17,732 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:27:17,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-12-25 06:27:17,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 06:27:17,936 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:27:17,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:27:17,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1011974276, now seen corresponding path program 12 times [2023-12-25 06:27:17,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:27:17,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1383755459] [2023-12-25 06:27:17,936 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-25 06:27:17,936 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 06:27:17,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:27:17,938 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 06:27:17,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-25 06:27:18,077 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2023-12-25 06:27:18,077 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:27:18,080 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 40 conjunts are in the unsatisfiable core [2023-12-25 06:27:18,082 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:27:18,355 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2023-12-25 06:27:18,356 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:27:21,392 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 819 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2023-12-25 06:27:21,392 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:27:21,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1383755459] [2023-12-25 06:27:21,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1383755459] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:27:21,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:27:21,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 41] total 43 [2023-12-25 06:27:21,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136007269] [2023-12-25 06:27:21,393 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:27:21,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-12-25 06:27:21,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:27:21,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-12-25 06:27:21,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1684, Unknown=0, NotChecked=0, Total=1806 [2023-12-25 06:27:21,394 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand has 43 states, 41 states have (on average 2.024390243902439) internal successors, (83), 42 states have internal predecessors, (83), 21 states have call successors, (21), 1 states have call predecessors, (21), 19 states have return successors, (38), 19 states have call predecessors, (38), 21 states have call successors, (38) [2023-12-25 06:27:21,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:27:21,890 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2023-12-25 06:27:21,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-25 06:27:21,891 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 41 states have (on average 2.024390243902439) internal successors, (83), 42 states have internal predecessors, (83), 21 states have call successors, (21), 1 states have call predecessors, (21), 19 states have return successors, (38), 19 states have call predecessors, (38), 21 states have call successors, (38) Word has length 117 [2023-12-25 06:27:21,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:27:21,891 INFO L225 Difference]: With dead ends: 72 [2023-12-25 06:27:21,891 INFO L226 Difference]: Without dead ends: 68 [2023-12-25 06:27:21,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=559, Invalid=3223, Unknown=0, NotChecked=0, Total=3782 [2023-12-25 06:27:21,893 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 499 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 06:27:21,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 883 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 06:27:21,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-12-25 06:27:21,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2023-12-25 06:27:21,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 46 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 20 states have return successors, (21), 20 states have call predecessors, (21), 2 states have call successors, (21) [2023-12-25 06:27:21,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2023-12-25 06:27:21,897 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 117 [2023-12-25 06:27:21,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:27:21,897 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2023-12-25 06:27:21,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 41 states have (on average 2.024390243902439) internal successors, (83), 42 states have internal predecessors, (83), 21 states have call successors, (21), 1 states have call predecessors, (21), 19 states have return successors, (38), 19 states have call predecessors, (38), 21 states have call successors, (38) [2023-12-25 06:27:21,897 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2023-12-25 06:27:21,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-25 06:27:21,898 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:27:21,899 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:27:21,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-12-25 06:27:22,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 06:27:22,102 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:27:22,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:27:22,103 INFO L85 PathProgramCache]: Analyzing trace with hash 486282894, now seen corresponding path program 13 times [2023-12-25 06:27:22,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:27:22,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1903727307] [2023-12-25 06:27:22,103 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-25 06:27:22,103 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 06:27:22,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:27:22,104 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 06:27:22,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-12-25 06:27:22,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:27:22,230 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-25 06:27:22,233 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:27:22,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2023-12-25 06:27:22,521 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:27:25,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 912 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-12-25 06:27:25,590 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:27:25,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1903727307] [2023-12-25 06:27:25,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1903727307] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:27:25,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:27:25,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 43] total 45 [2023-12-25 06:27:25,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895714987] [2023-12-25 06:27:25,590 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:27:25,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-12-25 06:27:25,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:27:25,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-12-25 06:27:25,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1852, Unknown=0, NotChecked=0, Total=1980 [2023-12-25 06:27:25,593 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand has 45 states, 43 states have (on average 2.0232558139534884) internal successors, (87), 44 states have internal predecessors, (87), 22 states have call successors, (22), 1 states have call predecessors, (22), 20 states have return successors, (40), 20 states have call predecessors, (40), 22 states have call successors, (40) [2023-12-25 06:27:26,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:27:26,033 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2023-12-25 06:27:26,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-25 06:27:26,034 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 43 states have (on average 2.0232558139534884) internal successors, (87), 44 states have internal predecessors, (87), 22 states have call successors, (22), 1 states have call predecessors, (22), 20 states have return successors, (40), 20 states have call predecessors, (40), 22 states have call successors, (40) Word has length 123 [2023-12-25 06:27:26,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:27:26,035 INFO L225 Difference]: With dead ends: 75 [2023-12-25 06:27:26,035 INFO L226 Difference]: Without dead ends: 71 [2023-12-25 06:27:26,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=608, Invalid=3552, Unknown=0, NotChecked=0, Total=4160 [2023-12-25 06:27:26,037 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 248 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 06:27:26,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 923 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 06:27:26,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-12-25 06:27:26,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2023-12-25 06:27:26,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 48 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 21 states have return successors, (22), 21 states have call predecessors, (22), 2 states have call successors, (22) [2023-12-25 06:27:26,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2023-12-25 06:27:26,041 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 123 [2023-12-25 06:27:26,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:27:26,041 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2023-12-25 06:27:26,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 43 states have (on average 2.0232558139534884) internal successors, (87), 44 states have internal predecessors, (87), 22 states have call successors, (22), 1 states have call predecessors, (22), 20 states have return successors, (40), 20 states have call predecessors, (40), 22 states have call successors, (40) [2023-12-25 06:27:26,041 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2023-12-25 06:27:26,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-12-25 06:27:26,042 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:27:26,042 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:27:26,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-12-25 06:27:26,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 06:27:26,243 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:27:26,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:27:26,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1510268740, now seen corresponding path program 14 times [2023-12-25 06:27:26,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:27:26,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1427264465] [2023-12-25 06:27:26,244 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 06:27:26,244 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 06:27:26,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:27:26,245 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 06:27:26,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-12-25 06:27:26,403 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 06:27:26,404 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:27:26,407 INFO L262 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 44 conjunts are in the unsatisfiable core [2023-12-25 06:27:26,409 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:27:26,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2023-12-25 06:27:26,710 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:27:29,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 0 proven. 1010 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2023-12-25 06:27:29,980 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:27:29,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1427264465] [2023-12-25 06:27:29,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1427264465] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:27:29,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:27:29,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 45] total 47 [2023-12-25 06:27:29,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220226011] [2023-12-25 06:27:29,981 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:27:29,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-12-25 06:27:29,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:27:29,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-12-25 06:27:29,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=2028, Unknown=0, NotChecked=0, Total=2162 [2023-12-25 06:27:29,985 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand has 47 states, 45 states have (on average 2.022222222222222) internal successors, (91), 46 states have internal predecessors, (91), 23 states have call successors, (23), 1 states have call predecessors, (23), 21 states have return successors, (42), 21 states have call predecessors, (42), 23 states have call successors, (42) [2023-12-25 06:27:30,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:27:30,564 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2023-12-25 06:27:30,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-25 06:27:30,564 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 45 states have (on average 2.022222222222222) internal successors, (91), 46 states have internal predecessors, (91), 23 states have call successors, (23), 1 states have call predecessors, (23), 21 states have return successors, (42), 21 states have call predecessors, (42), 23 states have call successors, (42) Word has length 129 [2023-12-25 06:27:30,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:27:30,570 INFO L225 Difference]: With dead ends: 78 [2023-12-25 06:27:30,570 INFO L226 Difference]: Without dead ends: 74 [2023-12-25 06:27:30,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=659, Invalid=3897, Unknown=0, NotChecked=0, Total=4556 [2023-12-25 06:27:30,573 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 302 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 06:27:30,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 997 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 06:27:30,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-12-25 06:27:30,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2023-12-25 06:27:30,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 50 states have internal predecessors, (50), 2 states have call successors, (2), 1 states have call predecessors, (2), 22 states have return successors, (23), 22 states have call predecessors, (23), 2 states have call successors, (23) [2023-12-25 06:27:30,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2023-12-25 06:27:30,583 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 129 [2023-12-25 06:27:30,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:27:30,583 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2023-12-25 06:27:30,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 45 states have (on average 2.022222222222222) internal successors, (91), 46 states have internal predecessors, (91), 23 states have call successors, (23), 1 states have call predecessors, (23), 21 states have return successors, (42), 21 states have call predecessors, (42), 23 states have call successors, (42) [2023-12-25 06:27:30,591 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2023-12-25 06:27:30,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-25 06:27:30,593 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:27:30,593 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:27:30,597 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 (16)] Forceful destruction successful, exit code 0 [2023-12-25 06:27:30,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 06:27:30,797 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:27:30,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:27:30,797 INFO L85 PathProgramCache]: Analyzing trace with hash -92396082, now seen corresponding path program 15 times [2023-12-25 06:27:30,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:27:30,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1279587509] [2023-12-25 06:27:30,798 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 06:27:30,798 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 06:27:30,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:27:30,799 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 06:27:30,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-12-25 06:27:30,999 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2023-12-25 06:27:31,000 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:27:31,003 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 46 conjunts are in the unsatisfiable core [2023-12-25 06:27:31,005 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:27:31,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2023-12-25 06:27:31,340 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:27:34,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 1113 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2023-12-25 06:27:34,709 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:27:34,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1279587509] [2023-12-25 06:27:34,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1279587509] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:27:34,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:27:34,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 47] total 49 [2023-12-25 06:27:34,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379169451] [2023-12-25 06:27:34,709 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:27:34,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-12-25 06:27:34,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:27:34,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-12-25 06:27:34,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=2212, Unknown=0, NotChecked=0, Total=2352 [2023-12-25 06:27:34,711 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand has 49 states, 47 states have (on average 2.021276595744681) internal successors, (95), 48 states have internal predecessors, (95), 24 states have call successors, (24), 1 states have call predecessors, (24), 22 states have return successors, (44), 22 states have call predecessors, (44), 24 states have call successors, (44) [2023-12-25 06:27:35,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:27:35,302 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2023-12-25 06:27:35,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-25 06:27:35,303 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 47 states have (on average 2.021276595744681) internal successors, (95), 48 states have internal predecessors, (95), 24 states have call successors, (24), 1 states have call predecessors, (24), 22 states have return successors, (44), 22 states have call predecessors, (44), 24 states have call successors, (44) Word has length 135 [2023-12-25 06:27:35,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:27:35,304 INFO L225 Difference]: With dead ends: 81 [2023-12-25 06:27:35,304 INFO L226 Difference]: Without dead ends: 77 [2023-12-25 06:27:35,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=712, Invalid=4258, Unknown=0, NotChecked=0, Total=4970 [2023-12-25 06:27:35,308 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 797 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 375 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 1144 SdHoareTripleChecker+Invalid, 1115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 375 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 06:27:35,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 1144 Invalid, 1115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [375 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 06:27:35,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-12-25 06:27:35,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2023-12-25 06:27:35,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 52 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 23 states have return successors, (24), 23 states have call predecessors, (24), 2 states have call successors, (24) [2023-12-25 06:27:35,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2023-12-25 06:27:35,334 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 135 [2023-12-25 06:27:35,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:27:35,335 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2023-12-25 06:27:35,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 47 states have (on average 2.021276595744681) internal successors, (95), 48 states have internal predecessors, (95), 24 states have call successors, (24), 1 states have call predecessors, (24), 22 states have return successors, (44), 22 states have call predecessors, (44), 24 states have call successors, (44) [2023-12-25 06:27:35,336 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2023-12-25 06:27:35,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-12-25 06:27:35,339 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:27:35,340 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:27:35,345 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 (17)] Forceful destruction successful, exit code 0 [2023-12-25 06:27:35,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 06:27:35,544 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:27:35,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:27:35,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1661997564, now seen corresponding path program 16 times [2023-12-25 06:27:35,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:27:35,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1650741940] [2023-12-25 06:27:35,544 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-25 06:27:35,544 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 06:27:35,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:27:35,546 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 06:27:35,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-12-25 06:27:35,728 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-25 06:27:35,728 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:27:35,731 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 48 conjunts are in the unsatisfiable core [2023-12-25 06:27:35,734 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:27:36,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2023-12-25 06:27:36,112 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:27:40,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 0 proven. 1221 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2023-12-25 06:27:40,492 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:27:40,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1650741940] [2023-12-25 06:27:40,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1650741940] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:27:40,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:27:40,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 49] total 51 [2023-12-25 06:27:40,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884554464] [2023-12-25 06:27:40,493 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:27:40,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-12-25 06:27:40,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:27:40,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-12-25 06:27:40,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=2404, Unknown=0, NotChecked=0, Total=2550 [2023-12-25 06:27:40,494 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand has 51 states, 49 states have (on average 2.020408163265306) internal successors, (99), 50 states have internal predecessors, (99), 25 states have call successors, (25), 1 states have call predecessors, (25), 23 states have return successors, (46), 23 states have call predecessors, (46), 25 states have call successors, (46) [2023-12-25 06:27:41,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:27:41,212 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2023-12-25 06:27:41,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-25 06:27:41,213 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 49 states have (on average 2.020408163265306) internal successors, (99), 50 states have internal predecessors, (99), 25 states have call successors, (25), 1 states have call predecessors, (25), 23 states have return successors, (46), 23 states have call predecessors, (46), 25 states have call successors, (46) Word has length 141 [2023-12-25 06:27:41,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:27:41,213 INFO L225 Difference]: With dead ends: 84 [2023-12-25 06:27:41,213 INFO L226 Difference]: Without dead ends: 80 [2023-12-25 06:27:41,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=767, Invalid=4635, Unknown=0, NotChecked=0, Total=5402 [2023-12-25 06:27:41,215 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 1017 mSDsluCounter, 1189 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 484 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1042 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 1278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 484 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 06:27:41,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1042 Valid, 1240 Invalid, 1278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [484 Valid, 794 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-25 06:27:41,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-12-25 06:27:41,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2023-12-25 06:27:41,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 54 states have internal predecessors, (54), 2 states have call successors, (2), 1 states have call predecessors, (2), 24 states have return successors, (25), 24 states have call predecessors, (25), 2 states have call successors, (25) [2023-12-25 06:27:41,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2023-12-25 06:27:41,218 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 141 [2023-12-25 06:27:41,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:27:41,218 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2023-12-25 06:27:41,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 49 states have (on average 2.020408163265306) internal successors, (99), 50 states have internal predecessors, (99), 25 states have call successors, (25), 1 states have call predecessors, (25), 23 states have return successors, (46), 23 states have call predecessors, (46), 25 states have call successors, (46) [2023-12-25 06:27:41,219 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2023-12-25 06:27:41,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-25 06:27:41,219 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:27:41,219 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:27:41,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-12-25 06:27:41,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 06:27:41,420 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:27:41,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:27:41,421 INFO L85 PathProgramCache]: Analyzing trace with hash 675382542, now seen corresponding path program 17 times [2023-12-25 06:27:41,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:27:41,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1439829996] [2023-12-25 06:27:41,421 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-25 06:27:41,421 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 06:27:41,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:27:41,422 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 06:27:41,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-12-25 06:27:41,693 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2023-12-25 06:27:41,693 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:27:41,696 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 50 conjunts are in the unsatisfiable core [2023-12-25 06:27:41,699 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:27:42,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2023-12-25 06:27:42,080 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:27:46,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 1334 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2023-12-25 06:27:46,507 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:27:46,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1439829996] [2023-12-25 06:27:46,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1439829996] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:27:46,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:27:46,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 51] total 53 [2023-12-25 06:27:46,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590230651] [2023-12-25 06:27:46,510 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:27:46,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2023-12-25 06:27:46,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:27:46,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2023-12-25 06:27:46,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=2604, Unknown=0, NotChecked=0, Total=2756 [2023-12-25 06:27:46,514 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand has 53 states, 51 states have (on average 2.019607843137255) internal successors, (103), 52 states have internal predecessors, (103), 26 states have call successors, (26), 1 states have call predecessors, (26), 24 states have return successors, (48), 24 states have call predecessors, (48), 26 states have call successors, (48) [2023-12-25 06:27:47,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:27:47,166 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2023-12-25 06:27:47,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-25 06:27:47,166 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 51 states have (on average 2.019607843137255) internal successors, (103), 52 states have internal predecessors, (103), 26 states have call successors, (26), 1 states have call predecessors, (26), 24 states have return successors, (48), 24 states have call predecessors, (48), 26 states have call successors, (48) Word has length 147 [2023-12-25 06:27:47,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:27:47,167 INFO L225 Difference]: With dead ends: 87 [2023-12-25 06:27:47,167 INFO L226 Difference]: Without dead ends: 83 [2023-12-25 06:27:47,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=824, Invalid=5028, Unknown=0, NotChecked=0, Total=5852 [2023-12-25 06:27:47,169 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 104 mSDsluCounter, 1235 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1288 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 06:27:47,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1288 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 06:27:47,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-12-25 06:27:47,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2023-12-25 06:27:47,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 55 states have (on average 1.018181818181818) internal successors, (56), 56 states have internal predecessors, (56), 2 states have call successors, (2), 1 states have call predecessors, (2), 25 states have return successors, (26), 25 states have call predecessors, (26), 2 states have call successors, (26) [2023-12-25 06:27:47,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2023-12-25 06:27:47,174 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 147 [2023-12-25 06:27:47,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:27:47,174 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2023-12-25 06:27:47,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 51 states have (on average 2.019607843137255) internal successors, (103), 52 states have internal predecessors, (103), 26 states have call successors, (26), 1 states have call predecessors, (26), 24 states have return successors, (48), 24 states have call predecessors, (48), 26 states have call successors, (48) [2023-12-25 06:27:47,174 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2023-12-25 06:27:47,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-12-25 06:27:47,175 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:27:47,175 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:27:47,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2023-12-25 06:27:47,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 06:27:47,381 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:27:47,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:27:47,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1206824132, now seen corresponding path program 18 times [2023-12-25 06:27:47,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:27:47,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1961515253] [2023-12-25 06:27:47,382 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-25 06:27:47,382 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 06:27:47,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:27:47,383 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 06:27:47,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-12-25 06:27:47,735 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2023-12-25 06:27:47,735 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:27:47,740 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 52 conjunts are in the unsatisfiable core [2023-12-25 06:27:47,743 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:27:48,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1752 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2023-12-25 06:27:48,010 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:27:51,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1752 backedges. 0 proven. 1452 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2023-12-25 06:27:51,902 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:27:51,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1961515253] [2023-12-25 06:27:51,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1961515253] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:27:51,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:27:51,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 53] total 55 [2023-12-25 06:27:51,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702019042] [2023-12-25 06:27:51,902 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:27:51,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2023-12-25 06:27:51,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:27:51,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2023-12-25 06:27:51,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2812, Unknown=0, NotChecked=0, Total=2970 [2023-12-25 06:27:51,919 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand has 55 states, 53 states have (on average 2.018867924528302) internal successors, (107), 54 states have internal predecessors, (107), 27 states have call successors, (27), 1 states have call predecessors, (27), 25 states have return successors, (50), 25 states have call predecessors, (50), 27 states have call successors, (50) [2023-12-25 06:27:52,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:27:52,456 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2023-12-25 06:27:52,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-12-25 06:27:52,457 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 53 states have (on average 2.018867924528302) internal successors, (107), 54 states have internal predecessors, (107), 27 states have call successors, (27), 1 states have call predecessors, (27), 25 states have return successors, (50), 25 states have call predecessors, (50), 27 states have call successors, (50) Word has length 153 [2023-12-25 06:27:52,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:27:52,461 INFO L225 Difference]: With dead ends: 90 [2023-12-25 06:27:52,461 INFO L226 Difference]: Without dead ends: 86 [2023-12-25 06:27:52,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=883, Invalid=5437, Unknown=0, NotChecked=0, Total=6320 [2023-12-25 06:27:52,463 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 208 mSDsluCounter, 1338 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 1393 SdHoareTripleChecker+Invalid, 957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 06:27:52,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 1393 Invalid, 957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 06:27:52,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-12-25 06:27:52,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2023-12-25 06:27:52,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 57 states have (on average 1.0175438596491229) internal successors, (58), 58 states have internal predecessors, (58), 2 states have call successors, (2), 1 states have call predecessors, (2), 26 states have return successors, (27), 26 states have call predecessors, (27), 2 states have call successors, (27) [2023-12-25 06:27:52,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2023-12-25 06:27:52,485 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 153 [2023-12-25 06:27:52,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:27:52,486 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2023-12-25 06:27:52,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 53 states have (on average 2.018867924528302) internal successors, (107), 54 states have internal predecessors, (107), 27 states have call successors, (27), 1 states have call predecessors, (27), 25 states have return successors, (50), 25 states have call predecessors, (50), 27 states have call successors, (50) [2023-12-25 06:27:52,487 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2023-12-25 06:27:52,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-12-25 06:27:52,499 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:27:52,499 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:27:52,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-12-25 06:27:52,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 06:27:52,700 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:27:52,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:27:52,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1687538610, now seen corresponding path program 19 times [2023-12-25 06:27:52,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:27:52,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1242364839] [2023-12-25 06:27:52,700 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-25 06:27:52,700 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 06:27:52,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:27:52,701 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 06:27:52,703 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 (21)] Waiting until timeout for monitored process [2023-12-25 06:27:53,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 06:27:53,066 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-25 06:27:53,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 06:27:53,207 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-25 06:27:53,207 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-25 06:27:53,208 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 06:27:53,217 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 (21)] Forceful destruction successful, exit code 0 [2023-12-25 06:27:53,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 06:27:53,412 INFO L445 BasicCegarLoop]: Path program histogram: [19, 1] [2023-12-25 06:27:53,415 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 06:27:53,461 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 06:27:53 BoogieIcfgContainer [2023-12-25 06:27:53,461 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 06:27:53,462 INFO L158 Benchmark]: Toolchain (without parser) took 55822.53ms. Allocated memory was 210.8MB in the beginning and 539.0MB in the end (delta: 328.2MB). Free memory was 148.0MB in the beginning and 405.4MB in the end (delta: -257.4MB). Peak memory consumption was 71.7MB. Max. memory is 8.0GB. [2023-12-25 06:27:53,462 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 210.8MB. Free memory is still 160.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 06:27:53,462 INFO L158 Benchmark]: CACSL2BoogieTranslator took 168.25ms. Allocated memory is still 210.8MB. Free memory was 147.7MB in the beginning and 137.2MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-25 06:27:53,462 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.18ms. Allocated memory is still 210.8MB. Free memory was 137.2MB in the beginning and 135.8MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 06:27:53,462 INFO L158 Benchmark]: Boogie Preprocessor took 28.43ms. Allocated memory is still 210.8MB. Free memory was 135.8MB in the beginning and 134.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 06:27:53,462 INFO L158 Benchmark]: RCFGBuilder took 270.09ms. Allocated memory is still 210.8MB. Free memory was 134.1MB in the beginning and 123.3MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-25 06:27:53,463 INFO L158 Benchmark]: TraceAbstraction took 55327.02ms. Allocated memory was 210.8MB in the beginning and 539.0MB in the end (delta: 328.2MB). Free memory was 122.9MB in the beginning and 405.4MB in the end (delta: -282.5MB). Peak memory consumption was 46.5MB. Max. memory is 8.0GB. [2023-12-25 06:27:53,463 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 210.8MB. Free memory is still 160.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 168.25ms. Allocated memory is still 210.8MB. Free memory was 147.7MB in the beginning and 137.2MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 22.18ms. Allocated memory is still 210.8MB. Free memory was 137.2MB in the beginning and 135.8MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.43ms. Allocated memory is still 210.8MB. Free memory was 135.8MB in the beginning and 134.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 270.09ms. Allocated memory is still 210.8MB. Free memory was 134.1MB in the beginning and 123.3MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 55327.02ms. Allocated memory was 210.8MB in the beginning and 539.0MB in the end (delta: 328.2MB). Free memory was 122.9MB in the beginning and 405.4MB in the end (delta: -282.5MB). Peak memory consumption was 46.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 - CounterExampleResult [Line: 15]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L12] int input = 25; VAL [input=25] [L13] CALL, EXPR id(input) VAL [\old(x)=25] [L7] COND FALSE !(x==0) VAL [\old(x)=25, x=25] [L8] CALL, EXPR id(x-1) VAL [\old(x)=24] [L7] COND FALSE !(x==0) VAL [\old(x)=24, x=24] [L8] CALL, EXPR id(x-1) VAL [\old(x)=23] [L7] COND FALSE !(x==0) VAL [\old(x)=23, x=23] [L8] CALL, EXPR id(x-1) VAL [\old(x)=22] [L7] COND FALSE !(x==0) VAL [\old(x)=22, x=22] [L8] CALL, EXPR id(x-1) VAL [\old(x)=21] [L7] COND FALSE !(x==0) VAL [\old(x)=21, x=21] [L8] CALL, EXPR id(x-1) VAL [\old(x)=20] [L7] COND FALSE !(x==0) VAL [\old(x)=20, x=20] [L8] CALL, EXPR id(x-1) VAL [\old(x)=19] [L7] COND FALSE !(x==0) VAL [\old(x)=19, x=19] [L8] CALL, EXPR id(x-1) VAL [\old(x)=18] [L7] COND FALSE !(x==0) VAL [\old(x)=18, x=18] [L8] CALL, EXPR id(x-1) VAL [\old(x)=17] [L7] COND FALSE !(x==0) VAL [\old(x)=17, x=17] [L8] CALL, EXPR id(x-1) VAL [\old(x)=16] [L7] COND FALSE !(x==0) VAL [\old(x)=16, x=16] [L8] CALL, EXPR id(x-1) VAL [\old(x)=15] [L7] COND FALSE !(x==0) VAL [\old(x)=15, x=15] [L8] CALL, EXPR id(x-1) VAL [\old(x)=14] [L7] COND FALSE !(x==0) VAL [\old(x)=14, x=14] [L8] CALL, EXPR id(x-1) VAL [\old(x)=13] [L7] COND FALSE !(x==0) VAL [\old(x)=13, x=13] [L8] CALL, EXPR id(x-1) VAL [\old(x)=12] [L7] COND FALSE !(x==0) VAL [\old(x)=12, x=12] [L8] CALL, EXPR id(x-1) VAL [\old(x)=11] [L7] COND FALSE !(x==0) VAL [\old(x)=11, x=11] [L8] CALL, EXPR id(x-1) VAL [\old(x)=10] [L7] COND FALSE !(x==0) VAL [\old(x)=10, x=10] [L8] CALL, EXPR id(x-1) VAL [\old(x)=9] [L7] COND FALSE !(x==0) VAL [\old(x)=9, x=9] [L8] CALL, EXPR id(x-1) VAL [\old(x)=8] [L7] COND FALSE !(x==0) VAL [\old(x)=8, x=8] [L8] CALL, EXPR id(x-1) VAL [\old(x)=7] [L7] COND FALSE !(x==0) VAL [\old(x)=7, x=7] [L8] CALL, EXPR id(x-1) VAL [\old(x)=6] [L7] COND FALSE !(x==0) VAL [\old(x)=6, x=6] [L8] CALL, EXPR id(x-1) VAL [\old(x)=5] [L7] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L8] CALL, EXPR id(x-1) VAL [\old(x)=4] [L7] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L8] CALL, EXPR id(x-1) VAL [\old(x)=3] [L7] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L8] CALL, EXPR id(x-1) VAL [\old(x)=2] [L7] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L8] CALL, EXPR id(x-1) VAL [\old(x)=1] [L7] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L8] CALL, EXPR id(x-1) VAL [\old(x)=0] [L7] COND TRUE x==0 [L7] return 0; VAL [\old(x)=0, \result=0, x=0] [L8] RET, EXPR id(x-1) VAL [\old(x)=1, x=1] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=2, x=2] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=3, x=3] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=4, x=4] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=5, x=5] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=6, x=6] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=7, x=7] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=8, x=8] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=9, x=9] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=10, x=10] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=11, x=11] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=12, x=12] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=13, x=13] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=14, x=14] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=15, x=15] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=16, x=16] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=17, x=17] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=18, x=18] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=19, x=19] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=20, x=20] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=21, x=21] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=22, x=22] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=23, x=23] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=24, x=24] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=25, x=25] [L8] return id(x-1) + 1; [L13] RET, EXPR id(input) VAL [input=25] [L13] int result = id(input); [L14] COND TRUE result == 25 VAL [input=25, result=25] [L15] reach_error() VAL [input=25, result=25] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 14 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 55.2s, OverallIterations: 20, TraceHistogramMax: 26, PathProgramHistogramMax: 19, EmptinessCheckTime: 0.1s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4831 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4540 mSDsluCounter, 11659 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11035 mSDsCounter, 1974 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7779 IncrementalHoareTripleChecker+Invalid, 9753 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1974 mSolverCounterUnsat, 624 mSDtfsCounter, 7779 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3477 GetRequests, 2620 SyntacticMatches, 0 SemanticMatches, 857 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4910 ImplicationChecksByTransitivity, 10.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86occurred in iteration=19, InterpolantAutomatonStates: 358, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 41.4s InterpolantComputationTime, 1788 NumberOfCodeBlocks, 1788 NumberOfCodeBlocksAsserted, 155 NumberOfCheckSat, 3212 ConstructedInterpolants, 0 QuantifiedInterpolants, 10814 SizeOfPredicates, 255 NumberOfNonLiveVariables, 2400 ConjunctsInSsa, 562 ConjunctsInUnsatCore, 37 InterpolantComputations, 1 PerfectInterpolantSequences, 8961/26532 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-12-25 06:27:53,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...