/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/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 16:26:04,560 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 16:26:04,631 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-16 16:26:04,634 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 16:26:04,635 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 16:26:04,655 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 16:26:04,656 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 16:26:04,656 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 16:26:04,657 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 16:26:04,659 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 16:26:04,659 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 16:26:04,660 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 16:26:04,660 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 16:26:04,661 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 16:26:04,661 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 16:26:04,662 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 16:26:04,662 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 16:26:04,662 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 16:26:04,662 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 16:26:04,662 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 16:26:04,662 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 16:26:04,663 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 16:26:04,663 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 16:26:04,663 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 16:26:04,663 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 16:26:04,663 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 16:26:04,663 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 16:26:04,663 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 16:26:04,664 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 16:26:04,664 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 16:26:04,664 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 16:26:04,665 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 16:26:04,665 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 16:26:04,665 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 16:26:04,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 16:26:04,665 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 16:26:04,665 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 16:26:04,665 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 16:26:04,665 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 16:26:04,665 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 16:26:04,665 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 16:26:04,666 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 16:26:04,666 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 16:26:04,666 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 16:26:04,666 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 16:26:04,666 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 16:26:04,666 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-16 16:26:04,839 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 16:26:04,857 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 16:26:04,859 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 16:26:04,860 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 16:26:04,860 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 16:26:04,862 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i [2023-12-16 16:26:05,791 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 16:26:05,958 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 16:26:05,958 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i [2023-12-16 16:26:05,965 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a952d229a/b3ffa540c3a74408881f5940403254fb/FLAGf99a89845 [2023-12-16 16:26:05,978 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a952d229a/b3ffa540c3a74408881f5940403254fb [2023-12-16 16:26:05,980 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 16:26:05,982 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 16:26:05,984 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 16:26:05,984 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 16:26:05,987 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 16:26:05,987 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:26:05" (1/1) ... [2023-12-16 16:26:05,988 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78eadb3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:26:05, skipping insertion in model container [2023-12-16 16:26:05,988 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:26:05" (1/1) ... [2023-12-16 16:26:06,007 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 16:26:06,121 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i[882,895] [2023-12-16 16:26:06,181 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:26:06,191 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 16:26:06,203 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i[882,895] [2023-12-16 16:26:06,224 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:26:06,237 INFO L206 MainTranslator]: Completed translation [2023-12-16 16:26:06,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:26:06 WrapperNode [2023-12-16 16:26:06,237 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 16:26:06,238 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 16:26:06,238 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 16:26:06,238 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 16:26:06,242 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:26:06" (1/1) ... [2023-12-16 16:26:06,260 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:26:06" (1/1) ... [2023-12-16 16:26:06,274 INFO L138 Inliner]: procedures = 42, calls = 28, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2023-12-16 16:26:06,275 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 16:26:06,275 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 16:26:06,275 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 16:26:06,275 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 16:26:06,283 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:26:06" (1/1) ... [2023-12-16 16:26:06,284 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:26:06" (1/1) ... [2023-12-16 16:26:06,286 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:26:06" (1/1) ... [2023-12-16 16:26:06,295 INFO L175 MemorySlicer]: Split 13 memory accesses to 3 slices as follows [2, 10, 1]. 77 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 2, 1]. [2023-12-16 16:26:06,295 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:26:06" (1/1) ... [2023-12-16 16:26:06,295 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:26:06" (1/1) ... [2023-12-16 16:26:06,301 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:26:06" (1/1) ... [2023-12-16 16:26:06,323 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:26:06" (1/1) ... [2023-12-16 16:26:06,325 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:26:06" (1/1) ... [2023-12-16 16:26:06,326 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:26:06" (1/1) ... [2023-12-16 16:26:06,328 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 16:26:06,328 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 16:26:06,328 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 16:26:06,328 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 16:26:06,329 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:26:06" (1/1) ... [2023-12-16 16:26:06,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 16:26:06,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 16:26:06,360 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-16 16:26:06,384 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-16 16:26:06,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 16:26:06,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-12-16 16:26:06,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-12-16 16:26:06,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-12-16 16:26:06,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 16:26:06,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-16 16:26:06,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-16 16:26:06,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-16 16:26:06,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 16:26:06,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 16:26:06,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2023-12-16 16:26:06,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2023-12-16 16:26:06,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2023-12-16 16:26:06,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-16 16:26:06,466 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 16:26:06,467 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 16:26:06,688 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 16:26:06,715 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 16:26:06,715 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-16 16:26:06,716 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:26:06 BoogieIcfgContainer [2023-12-16 16:26:06,716 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 16:26:06,717 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 16:26:06,717 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 16:26:06,720 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 16:26:06,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:26:05" (1/3) ... [2023-12-16 16:26:06,720 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@da31543 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:26:06, skipping insertion in model container [2023-12-16 16:26:06,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:26:06" (2/3) ... [2023-12-16 16:26:06,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@da31543 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:26:06, skipping insertion in model container [2023-12-16 16:26:06,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:26:06" (3/3) ... [2023-12-16 16:26:06,721 INFO L112 eAbstractionObserver]: Analyzing ICFG verisec_OpenSER_cases1_stripFullBoth_arr.i [2023-12-16 16:26:06,737 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 16:26:06,737 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 16:26:06,767 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 16:26:06,772 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;@3dde59c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 16:26:06,772 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 16:26:06,776 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 29 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:26:06,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-16 16:26:06,780 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:26:06,780 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:26:06,780 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:26:06,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:26:06,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1212065736, now seen corresponding path program 1 times [2023-12-16 16:26:06,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:26:06,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1949335726] [2023-12-16 16:26:06,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:26:06,792 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-16 16:26:06,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:26:06,794 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-16 16:26:06,797 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-16 16:26:06,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:26:06,878 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 16:26:06,881 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:26:06,898 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-16 16:26:06,898 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:26:06,899 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:26:06,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1949335726] [2023-12-16 16:26:06,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1949335726] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:26:06,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:26:06,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 16:26:06,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222076224] [2023-12-16 16:26:06,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:26:06,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 16:26:06,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:26:06,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 16:26:06,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 16:26:06,930 INFO L87 Difference]: Start difference. First operand has 30 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 29 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:26:06,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:26:06,954 INFO L93 Difference]: Finished difference Result 58 states and 90 transitions. [2023-12-16 16:26:06,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 16:26:06,956 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-12-16 16:26:06,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:26:06,960 INFO L225 Difference]: With dead ends: 58 [2023-12-16 16:26:06,960 INFO L226 Difference]: Without dead ends: 27 [2023-12-16 16:26:06,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 16:26:06,964 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:26:06,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:26:06,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-16 16:26:06,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-12-16 16:26:06,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 26 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:26:06,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2023-12-16 16:26:06,985 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 17 [2023-12-16 16:26:06,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:26:06,986 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2023-12-16 16:26:06,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:26:06,986 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2023-12-16 16:26:06,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-16 16:26:06,987 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:26:06,987 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:26:06,992 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-16 16:26:07,190 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-16 16:26:07,190 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:26:07,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:26:07,191 INFO L85 PathProgramCache]: Analyzing trace with hash 2071997665, now seen corresponding path program 1 times [2023-12-16 16:26:07,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:26:07,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1174057935] [2023-12-16 16:26:07,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:26:07,192 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-16 16:26:07,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:26:07,193 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-16 16:26:07,195 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-16 16:26:07,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:26:07,243 INFO L262 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 16:26:07,245 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:26:07,266 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-16 16:26:07,266 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:26:07,266 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:26:07,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1174057935] [2023-12-16 16:26:07,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1174057935] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:26:07,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:26:07,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 16:26:07,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880871286] [2023-12-16 16:26:07,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:26:07,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 16:26:07,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:26:07,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 16:26:07,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 16:26:07,280 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:26:07,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:26:07,312 INFO L93 Difference]: Finished difference Result 53 states and 73 transitions. [2023-12-16 16:26:07,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 16:26:07,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-12-16 16:26:07,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:26:07,314 INFO L225 Difference]: With dead ends: 53 [2023-12-16 16:26:07,314 INFO L226 Difference]: Without dead ends: 28 [2023-12-16 16:26:07,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 16:26:07,315 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:26:07,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:26:07,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-16 16:26:07,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-12-16 16:26:07,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:26:07,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2023-12-16 16:26:07,327 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 21 [2023-12-16 16:26:07,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:26:07,328 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2023-12-16 16:26:07,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:26:07,328 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2023-12-16 16:26:07,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-16 16:26:07,329 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:26:07,329 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:26:07,333 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-16 16:26:07,530 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-16 16:26:07,531 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:26:07,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:26:07,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1222889611, now seen corresponding path program 1 times [2023-12-16 16:26:07,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:26:07,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [293411016] [2023-12-16 16:26:07,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:26:07,532 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-16 16:26:07,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:26:07,533 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-16 16:26:07,535 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-16 16:26:07,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:26:07,583 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 16:26:07,584 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:26:07,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:26:07,613 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:26:07,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:26:07,643 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:26:07,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [293411016] [2023-12-16 16:26:07,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [293411016] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:26:07,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:26:07,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2023-12-16 16:26:07,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768910681] [2023-12-16 16:26:07,643 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:26:07,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 16:26:07,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:26:07,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 16:26:07,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 16:26:07,644 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:26:07,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:26:07,705 INFO L93 Difference]: Finished difference Result 56 states and 78 transitions. [2023-12-16 16:26:07,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 16:26:07,706 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-12-16 16:26:07,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:26:07,707 INFO L225 Difference]: With dead ends: 56 [2023-12-16 16:26:07,707 INFO L226 Difference]: Without dead ends: 31 [2023-12-16 16:26:07,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-12-16 16:26:07,708 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:26:07,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:26:07,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-12-16 16:26:07,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-12-16 16:26:07,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:26:07,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2023-12-16 16:26:07,711 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 22 [2023-12-16 16:26:07,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:26:07,711 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2023-12-16 16:26:07,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:26:07,712 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2023-12-16 16:26:07,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-16 16:26:07,715 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:26:07,715 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:26:07,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-16 16:26:07,917 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-16 16:26:07,917 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:26:07,918 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:26:07,918 INFO L85 PathProgramCache]: Analyzing trace with hash -2085211679, now seen corresponding path program 2 times [2023-12-16 16:26:07,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:26:07,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [71767924] [2023-12-16 16:26:07,918 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 16:26:07,918 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-16 16:26:07,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:26:07,919 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-16 16:26:07,937 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-16 16:26:07,970 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-16 16:26:07,971 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:26:07,972 INFO L262 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 16:26:07,974 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:26:07,982 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-16 16:26:07,983 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:26:07,988 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:26:07,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [71767924] [2023-12-16 16:26:07,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [71767924] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:26:07,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:26:07,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 16:26:07,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697285226] [2023-12-16 16:26:07,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:26:07,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 16:26:07,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:26:07,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 16:26:07,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 16:26:07,994 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:26:08,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:26:08,018 INFO L93 Difference]: Finished difference Result 55 states and 75 transitions. [2023-12-16 16:26:08,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 16:26:08,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-12-16 16:26:08,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:26:08,019 INFO L225 Difference]: With dead ends: 55 [2023-12-16 16:26:08,020 INFO L226 Difference]: Without dead ends: 32 [2023-12-16 16:26:08,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 16:26:08,020 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:26:08,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:26:08,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-16 16:26:08,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-12-16 16:26:08,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 31 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:26:08,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2023-12-16 16:26:08,024 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 25 [2023-12-16 16:26:08,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:26:08,024 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2023-12-16 16:26:08,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:26:08,024 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2023-12-16 16:26:08,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-16 16:26:08,024 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:26:08,024 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:26:08,032 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-16 16:26:08,229 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-16 16:26:08,229 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:26:08,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:26:08,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1198638367, now seen corresponding path program 1 times [2023-12-16 16:26:08,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:26:08,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2072459428] [2023-12-16 16:26:08,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:26:08,230 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-16 16:26:08,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:26:08,231 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-16 16:26:08,235 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-16 16:26:08,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:26:08,285 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 16:26:08,287 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:26:08,317 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:26:08,318 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:26:08,384 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:26:08,385 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:26:08,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2072459428] [2023-12-16 16:26:08,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2072459428] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:26:08,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:26:08,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-12-16 16:26:08,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998262038] [2023-12-16 16:26:08,385 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:26:08,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 16:26:08,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:26:08,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 16:26:08,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2023-12-16 16:26:08,386 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:26:08,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:26:08,472 INFO L93 Difference]: Finished difference Result 61 states and 83 transitions. [2023-12-16 16:26:08,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 16:26:08,473 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-12-16 16:26:08,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:26:08,473 INFO L225 Difference]: With dead ends: 61 [2023-12-16 16:26:08,473 INFO L226 Difference]: Without dead ends: 35 [2023-12-16 16:26:08,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2023-12-16 16:26:08,474 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 16:26:08,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 212 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 16:26:08,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-12-16 16:26:08,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-12-16 16:26:08,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:26:08,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2023-12-16 16:26:08,477 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 25 [2023-12-16 16:26:08,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:26:08,478 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2023-12-16 16:26:08,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:26:08,478 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2023-12-16 16:26:08,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-16 16:26:08,478 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:26:08,478 INFO L195 NwaCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:26:08,489 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-16 16:26:08,681 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-16 16:26:08,682 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:26:08,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:26:08,682 INFO L85 PathProgramCache]: Analyzing trace with hash -38692045, now seen corresponding path program 2 times [2023-12-16 16:26:08,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:26:08,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [598835942] [2023-12-16 16:26:08,683 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 16:26:08,683 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-16 16:26:08,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:26:08,684 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-16 16:26:08,684 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-16 16:26:08,730 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-16 16:26:08,731 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:26:08,731 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 16:26:08,733 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:26:08,767 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-16 16:26:08,767 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:26:08,767 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:26:08,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [598835942] [2023-12-16 16:26:08,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [598835942] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:26:08,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:26:08,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 16:26:08,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516740057] [2023-12-16 16:26:08,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:26:08,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 16:26:08,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:26:08,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 16:26:08,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 16:26:08,768 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:26:08,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:26:08,864 INFO L93 Difference]: Finished difference Result 113 states and 152 transitions. [2023-12-16 16:26:08,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 16:26:08,865 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-12-16 16:26:08,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:26:08,865 INFO L225 Difference]: With dead ends: 113 [2023-12-16 16:26:08,865 INFO L226 Difference]: Without dead ends: 89 [2023-12-16 16:26:08,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-12-16 16:26:08,866 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 84 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 16:26:08,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 114 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 16:26:08,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-16 16:26:08,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 52. [2023-12-16 16:26:08,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 51 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:26:08,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 69 transitions. [2023-12-16 16:26:08,871 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 69 transitions. Word has length 28 [2023-12-16 16:26:08,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:26:08,871 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 69 transitions. [2023-12-16 16:26:08,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:26:08,871 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 69 transitions. [2023-12-16 16:26:08,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-16 16:26:08,872 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:26:08,872 INFO L195 NwaCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:26:08,878 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-16 16:26:09,073 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-16 16:26:09,074 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:26:09,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:26:09,074 INFO L85 PathProgramCache]: Analyzing trace with hash -36785421, now seen corresponding path program 1 times [2023-12-16 16:26:09,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:26:09,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [770446387] [2023-12-16 16:26:09,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:26:09,075 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-16 16:26:09,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:26:09,076 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-16 16:26:09,077 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-16 16:26:09,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:26:09,130 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-16 16:26:09,132 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:26:09,211 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-16 16:26:09,211 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:26:09,211 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:26:09,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [770446387] [2023-12-16 16:26:09,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [770446387] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:26:09,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:26:09,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 16:26:09,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795418544] [2023-12-16 16:26:09,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:26:09,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 16:26:09,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:26:09,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 16:26:09,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 16:26:09,213 INFO L87 Difference]: Start difference. First operand 52 states and 69 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:26:09,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:26:09,339 INFO L93 Difference]: Finished difference Result 141 states and 189 transitions. [2023-12-16 16:26:09,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 16:26:09,339 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-12-16 16:26:09,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:26:09,341 INFO L225 Difference]: With dead ends: 141 [2023-12-16 16:26:09,341 INFO L226 Difference]: Without dead ends: 112 [2023-12-16 16:26:09,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-16 16:26:09,342 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 64 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 16:26:09,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 155 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 16:26:09,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-12-16 16:26:09,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 69. [2023-12-16 16:26:09,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.3823529411764706) internal successors, (94), 68 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:26:09,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 94 transitions. [2023-12-16 16:26:09,347 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 94 transitions. Word has length 28 [2023-12-16 16:26:09,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:26:09,348 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 94 transitions. [2023-12-16 16:26:09,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:26:09,348 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 94 transitions. [2023-12-16 16:26:09,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-16 16:26:09,348 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:26:09,348 INFO L195 NwaCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:26:09,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-16 16:26:09,551 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-16 16:26:09,551 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:26:09,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:26:09,552 INFO L85 PathProgramCache]: Analyzing trace with hash 664279157, now seen corresponding path program 1 times [2023-12-16 16:26:09,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:26:09,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2081449943] [2023-12-16 16:26:09,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:26:09,552 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-16 16:26:09,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:26:09,553 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-16 16:26:09,557 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-16 16:26:09,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:26:09,606 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 16:26:09,607 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:26:09,681 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-16 16:26:09,682 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:26:09,682 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:26:09,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2081449943] [2023-12-16 16:26:09,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2081449943] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:26:09,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:26:09,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 16:26:09,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79721871] [2023-12-16 16:26:09,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:26:09,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 16:26:09,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:26:09,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 16:26:09,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 16:26:09,683 INFO L87 Difference]: Start difference. First operand 69 states and 94 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:26:09,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:26:09,774 INFO L93 Difference]: Finished difference Result 132 states and 178 transitions. [2023-12-16 16:26:09,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 16:26:09,775 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-12-16 16:26:09,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:26:09,775 INFO L225 Difference]: With dead ends: 132 [2023-12-16 16:26:09,775 INFO L226 Difference]: Without dead ends: 103 [2023-12-16 16:26:09,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 16:26:09,776 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 61 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 16:26:09,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 116 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 16:26:09,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-12-16 16:26:09,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 69. [2023-12-16 16:26:09,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.3823529411764706) internal successors, (94), 68 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:26:09,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 94 transitions. [2023-12-16 16:26:09,781 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 94 transitions. Word has length 28 [2023-12-16 16:26:09,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:26:09,781 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 94 transitions. [2023-12-16 16:26:09,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:26:09,781 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 94 transitions. [2023-12-16 16:26:09,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-16 16:26:09,782 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:26:09,782 INFO L195 NwaCegarLoop]: trace histogram [7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:26:09,786 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-16 16:26:09,984 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-16 16:26:09,984 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:26:09,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:26:09,985 INFO L85 PathProgramCache]: Analyzing trace with hash -827715476, now seen corresponding path program 1 times [2023-12-16 16:26:09,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:26:09,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1287673950] [2023-12-16 16:26:09,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:26:09,985 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-16 16:26:09,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:26:09,986 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-16 16:26:09,990 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-16 16:26:10,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:26:10,044 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-16 16:26:10,045 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:26:10,131 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-16 16:26:10,132 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:26:10,301 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-16 16:26:10,302 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:26:10,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1287673950] [2023-12-16 16:26:10,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1287673950] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:26:10,302 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:26:10,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-12-16 16:26:10,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867946868] [2023-12-16 16:26:10,302 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:26:10,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 16:26:10,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:26:10,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 16:26:10,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2023-12-16 16:26:10,303 INFO L87 Difference]: Start difference. First operand 69 states and 94 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:26:12,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:26:12,105 INFO L93 Difference]: Finished difference Result 442 states and 607 transitions. [2023-12-16 16:26:12,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-16 16:26:12,106 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-12-16 16:26:12,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:26:12,107 INFO L225 Difference]: With dead ends: 442 [2023-12-16 16:26:12,107 INFO L226 Difference]: Without dead ends: 399 [2023-12-16 16:26:12,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=186, Invalid=414, Unknown=0, NotChecked=0, Total=600 [2023-12-16 16:26:12,108 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 666 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 666 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-16 16:26:12,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [666 Valid, 385 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-16 16:26:12,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2023-12-16 16:26:12,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 206. [2023-12-16 16:26:12,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 1.4146341463414633) internal successors, (290), 205 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:26:12,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 290 transitions. [2023-12-16 16:26:12,122 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 290 transitions. Word has length 31 [2023-12-16 16:26:12,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:26:12,122 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 290 transitions. [2023-12-16 16:26:12,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:26:12,122 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 290 transitions. [2023-12-16 16:26:12,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-16 16:26:12,123 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:26:12,123 INFO L195 NwaCegarLoop]: trace histogram [7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:26:12,126 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-16 16:26:12,325 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-16 16:26:12,326 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:26:12,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:26:12,326 INFO L85 PathProgramCache]: Analyzing trace with hash 187848817, now seen corresponding path program 1 times [2023-12-16 16:26:12,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:26:12,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1352645428] [2023-12-16 16:26:12,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:26:12,327 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:26:12,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:26:12,327 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-16 16:26:12,332 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-16 16:26:12,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:26:12,385 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 16:26:12,386 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:26:12,423 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-16 16:26:12,423 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:26:12,423 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:26:12,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1352645428] [2023-12-16 16:26:12,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1352645428] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:26:12,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:26:12,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 16:26:12,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722578333] [2023-12-16 16:26:12,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:26:12,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 16:26:12,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:26:12,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 16:26:12,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 16:26:12,424 INFO L87 Difference]: Start difference. First operand 206 states and 290 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:26:12,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:26:12,504 INFO L93 Difference]: Finished difference Result 301 states and 419 transitions. [2023-12-16 16:26:12,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 16:26:12,505 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-12-16 16:26:12,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:26:12,505 INFO L225 Difference]: With dead ends: 301 [2023-12-16 16:26:12,506 INFO L226 Difference]: Without dead ends: 138 [2023-12-16 16:26:12,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-12-16 16:26:12,506 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 57 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 16:26:12,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 139 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 16:26:12,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-12-16 16:26:12,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 113. [2023-12-16 16:26:12,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 112 states have (on average 1.3571428571428572) internal successors, (152), 112 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:26:12,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 152 transitions. [2023-12-16 16:26:12,512 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 152 transitions. Word has length 31 [2023-12-16 16:26:12,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:26:12,512 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 152 transitions. [2023-12-16 16:26:12,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:26:12,513 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 152 transitions. [2023-12-16 16:26:12,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-16 16:26:12,513 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:26:12,513 INFO L195 NwaCegarLoop]: trace histogram [7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:26:12,521 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-16 16:26:12,716 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-16 16:26:12,716 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:26:12,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:26:12,716 INFO L85 PathProgramCache]: Analyzing trace with hash -671941690, now seen corresponding path program 1 times [2023-12-16 16:26:12,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:26:12,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1045432764] [2023-12-16 16:26:12,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:26:12,717 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-16 16:26:12,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:26:12,718 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-16 16:26:12,718 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-16 16:26:12,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:26:12,775 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 16:26:12,776 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:26:12,818 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-16 16:26:12,818 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:26:12,896 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-16 16:26:12,896 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:26:12,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1045432764] [2023-12-16 16:26:12,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1045432764] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:26:12,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:26:12,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2023-12-16 16:26:12,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710101200] [2023-12-16 16:26:12,897 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:26:12,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-16 16:26:12,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:26:12,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-16 16:26:12,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-12-16 16:26:12,897 INFO L87 Difference]: Start difference. First operand 113 states and 152 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:26:13,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:26:13,113 INFO L93 Difference]: Finished difference Result 248 states and 328 transitions. [2023-12-16 16:26:13,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-16 16:26:13,114 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-12-16 16:26:13,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:26:13,114 INFO L225 Difference]: With dead ends: 248 [2023-12-16 16:26:13,115 INFO L226 Difference]: Without dead ends: 218 [2023-12-16 16:26:13,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2023-12-16 16:26:13,115 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 225 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 16:26:13,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 403 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 16:26:13,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2023-12-16 16:26:13,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 155. [2023-12-16 16:26:13,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 1.3636363636363635) internal successors, (210), 154 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:26:13,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 210 transitions. [2023-12-16 16:26:13,122 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 210 transitions. Word has length 32 [2023-12-16 16:26:13,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:26:13,122 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 210 transitions. [2023-12-16 16:26:13,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:26:13,122 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 210 transitions. [2023-12-16 16:26:13,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-16 16:26:13,123 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:26:13,123 INFO L195 NwaCegarLoop]: trace histogram [7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:26:13,128 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-16 16:26:13,325 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-16 16:26:13,326 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:26:13,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:26:13,326 INFO L85 PathProgramCache]: Analyzing trace with hash 31029512, now seen corresponding path program 1 times [2023-12-16 16:26:13,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:26:13,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1006841886] [2023-12-16 16:26:13,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:26:13,326 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-16 16:26:13,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:26:13,327 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-16 16:26:13,352 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-16 16:26:13,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:26:13,390 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 16:26:13,391 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:26:13,474 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-16 16:26:13,474 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:26:13,610 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-16 16:26:13,610 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:26:13,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1006841886] [2023-12-16 16:26:13,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1006841886] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:26:13,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:26:13,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-12-16 16:26:13,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336493612] [2023-12-16 16:26:13,610 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:26:13,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 16:26:13,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:26:13,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 16:26:13,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-12-16 16:26:13,611 INFO L87 Difference]: Start difference. First operand 155 states and 210 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:26:15,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:26:15,675 INFO L93 Difference]: Finished difference Result 449 states and 610 transitions. [2023-12-16 16:26:15,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-16 16:26:15,675 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-12-16 16:26:15,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:26:15,677 INFO L225 Difference]: With dead ends: 449 [2023-12-16 16:26:15,677 INFO L226 Difference]: Without dead ends: 447 [2023-12-16 16:26:15,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=189, Invalid=803, Unknown=0, NotChecked=0, Total=992 [2023-12-16 16:26:15,678 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 319 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-16 16:26:15,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 593 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-16 16:26:15,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2023-12-16 16:26:15,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 206. [2023-12-16 16:26:15,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 1.3804878048780487) internal successors, (283), 205 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:26:15,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 283 transitions. [2023-12-16 16:26:15,687 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 283 transitions. Word has length 32 [2023-12-16 16:26:15,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:26:15,687 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 283 transitions. [2023-12-16 16:26:15,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:26:15,687 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 283 transitions. [2023-12-16 16:26:15,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-16 16:26:15,688 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:26:15,688 INFO L195 NwaCegarLoop]: trace histogram [7, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:26:15,693 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-16 16:26:15,891 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-16 16:26:15,891 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:26:15,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:26:15,891 INFO L85 PathProgramCache]: Analyzing trace with hash -90449191, now seen corresponding path program 2 times [2023-12-16 16:26:15,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:26:15,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2056076824] [2023-12-16 16:26:15,892 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 16:26:15,892 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-16 16:26:15,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:26:15,893 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-16 16:26:15,896 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-16 16:26:15,943 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-16 16:26:15,943 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:26:15,944 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 16:26:15,944 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:26:15,965 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-16 16:26:15,966 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:26:15,966 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:26:15,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2056076824] [2023-12-16 16:26:15,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2056076824] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:26:15,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:26:15,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 16:26:15,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429567230] [2023-12-16 16:26:15,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:26:15,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 16:26:15,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:26:15,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 16:26:15,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 16:26:15,967 INFO L87 Difference]: Start difference. First operand 206 states and 283 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:26:16,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:26:16,051 INFO L93 Difference]: Finished difference Result 303 states and 410 transitions. [2023-12-16 16:26:16,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 16:26:16,051 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-12-16 16:26:16,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:26:16,053 INFO L225 Difference]: With dead ends: 303 [2023-12-16 16:26:16,053 INFO L226 Difference]: Without dead ends: 247 [2023-12-16 16:26:16,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 16:26:16,054 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 27 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 16:26:16,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 84 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 16:26:16,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2023-12-16 16:26:16,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 203. [2023-12-16 16:26:16,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 202 states have (on average 1.381188118811881) internal successors, (279), 202 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:26:16,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 279 transitions. [2023-12-16 16:26:16,062 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 279 transitions. Word has length 36 [2023-12-16 16:26:16,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:26:16,062 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 279 transitions. [2023-12-16 16:26:16,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:26:16,062 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 279 transitions. [2023-12-16 16:26:16,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-16 16:26:16,063 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:26:16,063 INFO L195 NwaCegarLoop]: trace histogram [7, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:26:16,065 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-16 16:26:16,265 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-16 16:26:16,265 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:26:16,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:26:16,265 INFO L85 PathProgramCache]: Analyzing trace with hash -88542567, now seen corresponding path program 1 times [2023-12-16 16:26:16,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:26:16,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [419342285] [2023-12-16 16:26:16,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:26:16,266 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-16 16:26:16,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:26:16,267 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-16 16:26:16,268 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-16 16:26:16,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:26:16,335 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-16 16:26:16,339 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:26:16,384 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-16 16:26:16,384 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:26:16,465 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-16 16:26:16,465 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:26:16,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [419342285] [2023-12-16 16:26:16,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [419342285] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:26:16,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:26:16,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2023-12-16 16:26:16,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764299099] [2023-12-16 16:26:16,465 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:26:16,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-16 16:26:16,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:26:16,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-16 16:26:16,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-12-16 16:26:16,466 INFO L87 Difference]: Start difference. First operand 203 states and 279 transitions. Second operand has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:26:17,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:26:17,211 INFO L93 Difference]: Finished difference Result 788 states and 1065 transitions. [2023-12-16 16:26:17,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-12-16 16:26:17,211 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-12-16 16:26:17,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:26:17,213 INFO L225 Difference]: With dead ends: 788 [2023-12-16 16:26:17,213 INFO L226 Difference]: Without dead ends: 732 [2023-12-16 16:26:17,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=302, Invalid=958, Unknown=0, NotChecked=0, Total=1260 [2023-12-16 16:26:17,223 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 786 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 16:26:17,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 784 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 16:26:17,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2023-12-16 16:26:17,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 461. [2023-12-16 16:26:17,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 460 states have (on average 1.3630434782608696) internal successors, (627), 460 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:26:17,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 627 transitions. [2023-12-16 16:26:17,237 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 627 transitions. Word has length 36 [2023-12-16 16:26:17,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:26:17,237 INFO L495 AbstractCegarLoop]: Abstraction has 461 states and 627 transitions. [2023-12-16 16:26:17,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:26:17,237 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 627 transitions. [2023-12-16 16:26:17,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-16 16:26:17,238 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:26:17,238 INFO L195 NwaCegarLoop]: trace histogram [7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:26:17,243 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-16 16:26:17,441 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-16 16:26:17,441 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:26:17,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:26:17,442 INFO L85 PathProgramCache]: Analyzing trace with hash -992009927, now seen corresponding path program 1 times [2023-12-16 16:26:17,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:26:17,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1396917216] [2023-12-16 16:26:17,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:26:17,442 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-16 16:26:17,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:26:17,443 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-16 16:26:17,444 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-16 16:26:17,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:26:17,504 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 16:26:17,505 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:26:17,543 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-12-16 16:26:17,543 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:26:17,606 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-12-16 16:26:17,606 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:26:17,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1396917216] [2023-12-16 16:26:17,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1396917216] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:26:17,606 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:26:17,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2023-12-16 16:26:17,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206570058] [2023-12-16 16:26:17,606 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:26:17,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-16 16:26:17,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:26:17,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-16 16:26:17,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-12-16 16:26:17,607 INFO L87 Difference]: Start difference. First operand 461 states and 627 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:26:17,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:26:17,803 INFO L93 Difference]: Finished difference Result 880 states and 1192 transitions. [2023-12-16 16:26:17,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-16 16:26:17,805 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-12-16 16:26:17,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:26:17,806 INFO L225 Difference]: With dead ends: 880 [2023-12-16 16:26:17,806 INFO L226 Difference]: Without dead ends: 547 [2023-12-16 16:26:17,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2023-12-16 16:26:17,807 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 115 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 16:26:17,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 400 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 16:26:17,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2023-12-16 16:26:17,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 422. [2023-12-16 16:26:17,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 421 states have (on average 1.33729216152019) internal successors, (563), 421 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:26:17,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 563 transitions. [2023-12-16 16:26:17,824 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 563 transitions. Word has length 37 [2023-12-16 16:26:17,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:26:17,824 INFO L495 AbstractCegarLoop]: Abstraction has 422 states and 563 transitions. [2023-12-16 16:26:17,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:26:17,824 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 563 transitions. [2023-12-16 16:26:17,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-16 16:26:17,825 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:26:17,825 INFO L195 NwaCegarLoop]: trace histogram [7, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:26:17,828 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-16 16:26:18,027 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-16 16:26:18,027 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:26:18,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:26:18,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1796461186, now seen corresponding path program 1 times [2023-12-16 16:26:18,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:26:18,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [452884143] [2023-12-16 16:26:18,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:26:18,028 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-16 16:26:18,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:26:18,029 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-16 16:26:18,030 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-16 16:26:18,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:26:18,094 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 16:26:18,094 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:26:18,101 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-16 16:26:18,101 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:26:18,101 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:26:18,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [452884143] [2023-12-16 16:26:18,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [452884143] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:26:18,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:26:18,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 16:26:18,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468842819] [2023-12-16 16:26:18,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:26:18,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 16:26:18,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:26:18,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 16:26:18,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 16:26:18,102 INFO L87 Difference]: Start difference. First operand 422 states and 563 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:26:18,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:26:18,154 INFO L93 Difference]: Finished difference Result 692 states and 931 transitions. [2023-12-16 16:26:18,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 16:26:18,155 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2023-12-16 16:26:18,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:26:18,156 INFO L225 Difference]: With dead ends: 692 [2023-12-16 16:26:18,156 INFO L226 Difference]: Without dead ends: 444 [2023-12-16 16:26:18,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 16:26:18,157 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 3 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:26:18,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 78 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:26:18,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2023-12-16 16:26:18,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 432. [2023-12-16 16:26:18,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 431 states have (on average 1.3294663573085848) internal successors, (573), 431 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:26:18,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 573 transitions. [2023-12-16 16:26:18,172 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 573 transitions. Word has length 38 [2023-12-16 16:26:18,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:26:18,172 INFO L495 AbstractCegarLoop]: Abstraction has 432 states and 573 transitions. [2023-12-16 16:26:18,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:26:18,172 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 573 transitions. [2023-12-16 16:26:18,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-16 16:26:18,172 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:26:18,172 INFO L195 NwaCegarLoop]: trace histogram [7, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:26:18,177 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-16 16:26:18,375 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-16 16:26:18,375 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:26:18,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:26:18,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1116402816, now seen corresponding path program 1 times [2023-12-16 16:26:18,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:26:18,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [396450751] [2023-12-16 16:26:18,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:26:18,376 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-16 16:26:18,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:26:18,377 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-16 16:26:18,417 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-16 16:26:18,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:26:18,458 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-16 16:26:18,459 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:26:18,576 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-16 16:26:18,576 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:26:18,789 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-16 16:26:18,789 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:26:18,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [396450751] [2023-12-16 16:26:18,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [396450751] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:26:18,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:26:18,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2023-12-16 16:26:18,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791631610] [2023-12-16 16:26:18,789 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:26:18,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-16 16:26:18,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:26:18,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-16 16:26:18,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2023-12-16 16:26:18,790 INFO L87 Difference]: Start difference. First operand 432 states and 573 transitions. Second operand has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:26:22,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:26:22,134 INFO L93 Difference]: Finished difference Result 1421 states and 1883 transitions. [2023-12-16 16:26:22,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-12-16 16:26:22,136 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2023-12-16 16:26:22,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:26:22,138 INFO L225 Difference]: With dead ends: 1421 [2023-12-16 16:26:22,138 INFO L226 Difference]: Without dead ends: 1104 [2023-12-16 16:26:22,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=326, Invalid=1156, Unknown=0, NotChecked=0, Total=1482 [2023-12-16 16:26:22,139 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 988 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 988 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-16 16:26:22,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [988 Valid, 665 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-16 16:26:22,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states. [2023-12-16 16:26:22,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 652. [2023-12-16 16:26:22,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 651 states have (on average 1.3302611367127497) internal successors, (866), 651 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:26:22,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 866 transitions. [2023-12-16 16:26:22,163 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 866 transitions. Word has length 38 [2023-12-16 16:26:22,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:26:22,163 INFO L495 AbstractCegarLoop]: Abstraction has 652 states and 866 transitions. [2023-12-16 16:26:22,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:26:22,164 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 866 transitions. [2023-12-16 16:26:22,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-16 16:26:22,164 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:26:22,164 INFO L195 NwaCegarLoop]: trace histogram [7, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:26:22,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-12-16 16:26:22,366 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-16 16:26:22,367 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:26:22,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:26:22,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1116343234, now seen corresponding path program 1 times [2023-12-16 16:26:22,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:26:22,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1029476627] [2023-12-16 16:26:22,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:26:22,368 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-16 16:26:22,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:26:22,369 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-16 16:26:22,369 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-16 16:26:22,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:26:22,432 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-16 16:26:22,433 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:26:22,563 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-16 16:26:22,563 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:26:22,778 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-16 16:26:22,779 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:26:22,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1029476627] [2023-12-16 16:26:22,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1029476627] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:26:22,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:26:22,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2023-12-16 16:26:22,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475215831] [2023-12-16 16:26:22,779 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:26:22,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-16 16:26:22,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:26:22,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-16 16:26:22,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2023-12-16 16:26:22,780 INFO L87 Difference]: Start difference. First operand 652 states and 866 transitions. Second operand has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:26:26,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:26:26,757 INFO L93 Difference]: Finished difference Result 2323 states and 3085 transitions. [2023-12-16 16:26:26,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-12-16 16:26:26,757 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2023-12-16 16:26:26,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:26:26,762 INFO L225 Difference]: With dead ends: 2323 [2023-12-16 16:26:26,763 INFO L226 Difference]: Without dead ends: 2321 [2023-12-16 16:26:26,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=436, Invalid=2216, Unknown=0, NotChecked=0, Total=2652 [2023-12-16 16:26:26,764 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 643 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 643 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-12-16 16:26:26,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [643 Valid, 878 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-12-16 16:26:26,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2321 states. [2023-12-16 16:26:26,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2321 to 726. [2023-12-16 16:26:26,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 725 states have (on average 1.3448275862068966) internal successors, (975), 725 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:26:26,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 975 transitions. [2023-12-16 16:26:26,796 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 975 transitions. Word has length 38 [2023-12-16 16:26:26,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:26:26,796 INFO L495 AbstractCegarLoop]: Abstraction has 726 states and 975 transitions. [2023-12-16 16:26:26,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:26:26,796 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 975 transitions. [2023-12-16 16:26:26,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-16 16:26:26,797 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:26:26,797 INFO L195 NwaCegarLoop]: trace histogram [7, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:26:26,804 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 (19)] Forceful destruction successful, exit code 0 [2023-12-16 16:26:26,999 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-16 16:26:26,999 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:26:27,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:26:27,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1703208830, now seen corresponding path program 1 times [2023-12-16 16:26:27,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:26:27,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [949787616] [2023-12-16 16:26:27,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:26:27,000 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-16 16:26:27,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:26:27,001 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-16 16:26:27,007 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-16 16:26:27,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:26:27,073 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-16 16:26:27,074 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:26:27,169 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-16 16:26:27,170 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:26:27,392 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-16 16:26:27,392 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:26:27,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [949787616] [2023-12-16 16:26:27,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [949787616] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:26:27,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:26:27,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2023-12-16 16:26:27,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974063116] [2023-12-16 16:26:27,393 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:26:27,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-16 16:26:27,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:26:27,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-16 16:26:27,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2023-12-16 16:26:27,394 INFO L87 Difference]: Start difference. First operand 726 states and 975 transitions. Second operand has 16 states, 16 states have (on average 3.75) internal successors, (60), 16 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:26:33,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:26:33,746 INFO L93 Difference]: Finished difference Result 2786 states and 3696 transitions. [2023-12-16 16:26:33,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2023-12-16 16:26:33,747 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.75) internal successors, (60), 16 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2023-12-16 16:26:33,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:26:33,752 INFO L225 Difference]: With dead ends: 2786 [2023-12-16 16:26:33,753 INFO L226 Difference]: Without dead ends: 2784 [2023-12-16 16:26:33,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1256 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=655, Invalid=3635, Unknown=0, NotChecked=0, Total=4290 [2023-12-16 16:26:33,754 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 815 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 1103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2023-12-16 16:26:33,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 929 Invalid, 1103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 986 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2023-12-16 16:26:33,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2784 states. [2023-12-16 16:26:33,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2784 to 879. [2023-12-16 16:26:33,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 878 states have (on average 1.3519362186788155) internal successors, (1187), 878 states have internal predecessors, (1187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:26:33,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1187 transitions. [2023-12-16 16:26:33,799 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1187 transitions. Word has length 38 [2023-12-16 16:26:33,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:26:33,799 INFO L495 AbstractCegarLoop]: Abstraction has 879 states and 1187 transitions. [2023-12-16 16:26:33,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.75) internal successors, (60), 16 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:26:33,799 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1187 transitions. [2023-12-16 16:26:33,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-16 16:26:33,799 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:26:33,799 INFO L195 NwaCegarLoop]: trace histogram [7, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:26:33,804 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-16 16:26:34,002 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-16 16:26:34,002 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:26:34,002 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:26:34,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1703149248, now seen corresponding path program 1 times [2023-12-16 16:26:34,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:26:34,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [607897012] [2023-12-16 16:26:34,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:26:34,003 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-16 16:26:34,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:26:34,003 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-16 16:26:34,007 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-16 16:26:34,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 16:26:34,109 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 16:26:34,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 16:26:34,210 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-16 16:26:34,210 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 16:26:34,211 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 16:26:34,221 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-16 16:26:34,412 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-16 16:26:34,415 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:26:34,417 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 16:26:34,433 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-12-16 16:26:34,436 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~switch5 could not be translated [2023-12-16 16:26:34,436 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~switch5 could not be translated [2023-12-16 16:26:34,436 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~switch5 could not be translated [2023-12-16 16:26:34,436 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~switch5 could not be translated [2023-12-16 16:26:34,439 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~switch5 could not be translated [2023-12-16 16:26:34,439 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~switch5 could not be translated [2023-12-16 16:26:34,439 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~switch5 could not be translated [2023-12-16 16:26:34,439 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~switch5 could not be translated [2023-12-16 16:26:34,440 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~switch5 could not be translated [2023-12-16 16:26:34,440 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~switch5 could not be translated [2023-12-16 16:26:34,440 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~switch5 could not be translated [2023-12-16 16:26:34,440 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~switch5 could not be translated [2023-12-16 16:26:34,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:26:34 BoogieIcfgContainer [2023-12-16 16:26:34,448 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 16:26:34,449 INFO L158 Benchmark]: Toolchain (without parser) took 28467.09ms. Allocated memory was 194.0MB in the beginning and 299.9MB in the end (delta: 105.9MB). Free memory was 158.2MB in the beginning and 184.9MB in the end (delta: -26.6MB). Peak memory consumption was 80.2MB. Max. memory is 8.0GB. [2023-12-16 16:26:34,449 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 194.0MB. Free memory is still 151.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 16:26:34,449 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.89ms. Allocated memory is still 194.0MB. Free memory was 158.2MB in the beginning and 145.2MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-16 16:26:34,449 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.82ms. Allocated memory is still 194.0MB. Free memory was 145.2MB in the beginning and 143.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 16:26:34,449 INFO L158 Benchmark]: Boogie Preprocessor took 52.51ms. Allocated memory is still 194.0MB. Free memory was 143.1MB in the beginning and 140.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 16:26:34,449 INFO L158 Benchmark]: RCFGBuilder took 387.75ms. Allocated memory is still 194.0MB. Free memory was 140.8MB in the beginning and 122.6MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-16 16:26:34,450 INFO L158 Benchmark]: TraceAbstraction took 27730.95ms. Allocated memory was 194.0MB in the beginning and 299.9MB in the end (delta: 105.9MB). Free memory was 121.9MB in the beginning and 184.9MB in the end (delta: -62.9MB). Peak memory consumption was 44.6MB. Max. memory is 8.0GB. [2023-12-16 16:26:34,450 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 194.0MB. Free memory is still 151.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 253.89ms. Allocated memory is still 194.0MB. Free memory was 158.2MB in the beginning and 145.2MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.82ms. Allocated memory is still 194.0MB. Free memory was 145.2MB in the beginning and 143.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 52.51ms. Allocated memory is still 194.0MB. Free memory was 143.1MB in the beginning and 140.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 387.75ms. Allocated memory is still 194.0MB. Free memory was 140.8MB in the beginning and 122.6MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 27730.95ms. Allocated memory was 194.0MB in the beginning and 299.9MB in the end (delta: 105.9MB). Free memory was 121.9MB in the beginning and 184.9MB in the end (delta: -62.9MB). Peak memory consumption was 44.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~switch5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~switch5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~switch5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~switch5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~switch5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~switch5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~switch5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~switch5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~switch5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~switch5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~switch5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~switch5 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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 - UnprovableResult [Line: 16]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of strncpy at line 42. Possible FailurePath: [L86] char A [2 + 2 + 4 +1]; [L87] int i = 0; VAL [A={7:0}, i=0] [L87] COND TRUE i<2 + 2 + 4 -1 [L88] A[i] = __VERIFIER_nondet_char() [L87] i++ VAL [A={7:0}, i=1] [L87] COND TRUE i<2 + 2 + 4 -1 [L88] A[i] = __VERIFIER_nondet_char() [L87] i++ VAL [A={7:0}, i=2] [L87] COND TRUE i<2 + 2 + 4 -1 [L88] A[i] = __VERIFIER_nondet_char() [L87] i++ VAL [A={7:0}, i=3] [L87] COND TRUE i<2 + 2 + 4 -1 [L88] A[i] = __VERIFIER_nondet_char() [L87] i++ VAL [A={7:0}, i=4] [L87] COND TRUE i<2 + 2 + 4 -1 [L88] A[i] = __VERIFIER_nondet_char() [L87] i++ VAL [A={7:0}, i=5] [L87] COND TRUE i<2 + 2 + 4 -1 [L88] A[i] = __VERIFIER_nondet_char() [L87] i++ VAL [A={7:0}, i=6] [L87] COND TRUE i<2 + 2 + 4 -1 [L88] A[i] = __VERIFIER_nondet_char() [L87] i++ VAL [A={7:0}, i=7] [L87] COND FALSE !(i<2 + 2 + 4 -1) VAL [A={7:0}, i=7] [L90] A[2 + 2 + 4] = 0 [L91] CALL parse_expression_list (A) [L60] int start=0, i=-1, j=-1; [L61] char str2[2]; VAL [i=-1, j=-1, start=0, str2={3:0}, str={7:0}, str={7:0}] [L62] COND FALSE !(!str) VAL [i=-1, j=-1, start=0, str2={3:0}, str={7:0}, str={7:0}] [L64] i++ [L65] str[i] [L66] case 0: VAL [i=0, j=-1, start=0, str2={3:0}, str={7:0}, str={7:0}] [L66] case 0: [L81] EXPR str[i] [L81] COND TRUE str[i] != 0 [L64] i++ [L65] str[i] [L66] case 0: VAL [i=1, j=-1, start=0, str2={3:0}, str={7:0}, str={7:0}] [L66] case 0: [L81] EXPR str[i] [L81] COND TRUE str[i] != 0 [L64] i++ [L65] str[i] [L66] case 0: VAL [i=2, j=-1, start=0, str2={3:0}, str={7:0}, str={7:0}] [L66] case 0: [L67] EXPR str[start] [L67] (str[start] == ' ') || (str[start] == '\t') VAL [i=2, j=-1, start=0, str2={3:0}, str={7:0}, str={7:0}] [L67] (str[start] == ' ') || (str[start] == '\t') [L67] EXPR str[start] [L67] (str[start] == ' ') || (str[start] == '\t') VAL [i=2, j=-1, start=0, str2={3:0}, str={7:0}, str={7:0}] [L67] COND FALSE !((str[start] == ' ') || (str[start] == '\t')) [L68] str[start] [L66] case 0: [L69] j = i-1 VAL [i=2, j=1, start=0, str2={3:0}, str={7:0}, str={7:0}] [L70] (0 < j) && ((str[j] == ' ') || (str[j] == '\t')) VAL [i=2, j=1, start=0, str2={3:0}, str={7:0}, str={7:0}] [L70] (0 < j) && ((str[j] == ' ') || (str[j] == '\t')) [L70] EXPR str[j] [L70] EXPR (str[j] == ' ') || (str[j] == '\t') VAL [i=2, j=1, start=0, str2={3:0}, str={7:0}, str={7:0}] [L70] EXPR (str[j] == ' ') || (str[j] == '\t') [L70] EXPR str[j] [L70] EXPR (str[j] == ' ') || (str[j] == '\t') VAL [i=2, j=1, start=0, str2={3:0}, str={7:0}, str={7:0}] [L70] (0 < j) && ((str[j] == ' ') || (str[j] == '\t')) VAL [i=2, j=1, start=0, str2={3:0}, str={7:0}, str={7:0}] [L70] COND FALSE !((0 < j) && ((str[j] == ' ') || (str[j] == '\t'))) [L71] (0 < j) && (str[j] == '"') VAL [i=2, j=1, start=0, str2={3:0}, str={7:0}, str={7:0}] [L66] case 0: [L71] EXPR str[j] [L71] (0 < j) && (str[j] == '"') VAL [i=2, j=1, start=0, str2={3:0}, str={7:0}, str={7:0}] [L66] case 0: [L66] case 0: [L73] CALL r_strncpy(str2, str+start, j-start+1) [L42] return strncpy(dest,src,n); [L73] RET r_strncpy(str2, str+start, j-start+1) [L74] CALL __VERIFIER_assert(j - start + 1 < 2) [L15] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L16] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 27.7s, OverallIterations: 20, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 19.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4853 SdHoareTripleChecker+Valid, 12.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4853 mSDsluCounter, 6182 SdHoareTripleChecker+Invalid, 12.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5248 mSDsCounter, 392 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4720 IncrementalHoareTripleChecker+Invalid, 5112 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 392 mSolverCounterUnsat, 934 mSDtfsCounter, 4720 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1076 GetRequests, 754 SyntacticMatches, 1 SemanticMatches, 321 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2833 ImplicationChecksByTransitivity, 7.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=879occurred in iteration=19, InterpolantAutomatonStates: 305, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 5040 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 619 NumberOfCodeBlocks, 593 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 881 ConstructedInterpolants, 0 QuantifiedInterpolants, 2956 SizeOfPredicates, 36 NumberOfNonLiveVariables, 1831 ConjunctsInSsa, 112 ConjunctsInUnsatCore, 29 InterpolantComputations, 9 PerfectInterpolantSequences, 651/755 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-12-16 16:26:34,469 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...