/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/array-cav19/array_init_pair_sum_const.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 19:52:12,966 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 19:52:13,027 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-21 19:52:13,032 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 19:52:13,032 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 19:52:13,058 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 19:52:13,058 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 19:52:13,058 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 19:52:13,059 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 19:52:13,062 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 19:52:13,062 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 19:52:13,062 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 19:52:13,063 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 19:52:13,064 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 19:52:13,064 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 19:52:13,064 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 19:52:13,064 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 19:52:13,064 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 19:52:13,065 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 19:52:13,065 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 19:52:13,065 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 19:52:13,065 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 19:52:13,065 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 19:52:13,065 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-21 19:52:13,066 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-21 19:52:13,066 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 19:52:13,066 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-21 19:52:13,066 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 19:52:13,066 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 19:52:13,066 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 19:52:13,067 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 19:52:13,067 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 19:52:13,067 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 19:52:13,067 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 19:52:13,067 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 19:52:13,067 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 19:52:13,068 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 19:52:13,068 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 19:52:13,068 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-21 19:52:13,068 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-21 19:52:13,068 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 19:52:13,068 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 19:52:13,068 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 19:52:13,068 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 19:52:13,069 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 19:52:13,069 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-21 19:52:13,069 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-21 19:52:13,248 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 19:52:13,264 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 19:52:13,265 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 19:52:13,266 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 19:52:13,266 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 19:52:13,267 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-cav19/array_init_pair_sum_const.c [2023-12-21 19:52:14,300 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 19:52:14,437 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 19:52:14,438 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-cav19/array_init_pair_sum_const.c [2023-12-21 19:52:14,442 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/291112d36/ace448a9ec904e10b7b9a186ab2fbbab/FLAGdc833e4db [2023-12-21 19:52:14,455 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/291112d36/ace448a9ec904e10b7b9a186ab2fbbab [2023-12-21 19:52:14,457 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 19:52:14,458 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 19:52:14,460 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 19:52:14,460 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 19:52:14,463 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 19:52:14,464 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 07:52:14" (1/1) ... [2023-12-21 19:52:14,465 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dc5d725 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:52:14, skipping insertion in model container [2023-12-21 19:52:14,465 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 07:52:14" (1/1) ... [2023-12-21 19:52:14,482 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 19:52:14,613 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-cav19/array_init_pair_sum_const.c[416,429] [2023-12-21 19:52:14,623 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 19:52:14,631 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 19:52:14,639 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-cav19/array_init_pair_sum_const.c[416,429] [2023-12-21 19:52:14,646 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 19:52:14,656 INFO L206 MainTranslator]: Completed translation [2023-12-21 19:52:14,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:52:14 WrapperNode [2023-12-21 19:52:14,657 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 19:52:14,658 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 19:52:14,658 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 19:52:14,658 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 19:52:14,662 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:52:14" (1/1) ... [2023-12-21 19:52:14,668 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:52:14" (1/1) ... [2023-12-21 19:52:14,679 INFO L138 Inliner]: procedures = 16, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 66 [2023-12-21 19:52:14,680 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 19:52:14,680 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 19:52:14,680 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 19:52:14,681 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 19:52:14,687 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:52:14" (1/1) ... [2023-12-21 19:52:14,687 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:52:14" (1/1) ... [2023-12-21 19:52:14,696 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:52:14" (1/1) ... [2023-12-21 19:52:14,704 INFO L175 MemorySlicer]: Split 8 memory accesses to 4 slices as follows [2, 2, 2, 2]. 25 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2023-12-21 19:52:14,705 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:52:14" (1/1) ... [2023-12-21 19:52:14,705 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:52:14" (1/1) ... [2023-12-21 19:52:14,712 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:52:14" (1/1) ... [2023-12-21 19:52:14,714 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:52:14" (1/1) ... [2023-12-21 19:52:14,715 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:52:14" (1/1) ... [2023-12-21 19:52:14,716 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:52:14" (1/1) ... [2023-12-21 19:52:14,717 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 19:52:14,718 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 19:52:14,718 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 19:52:14,718 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 19:52:14,719 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:52:14" (1/1) ... [2023-12-21 19:52:14,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 19:52:14,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 19:52:14,741 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-21 19:52:14,760 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-21 19:52:14,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 19:52:14,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-21 19:52:14,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-21 19:52:14,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-21 19:52:14,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-12-21 19:52:14,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-21 19:52:14,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-21 19:52:14,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-21 19:52:14,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-21 19:52:14,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-12-21 19:52:14,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 19:52:14,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 19:52:14,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-21 19:52:14,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-21 19:52:14,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-21 19:52:14,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-21 19:52:14,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-12-21 19:52:14,840 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 19:52:14,841 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 19:52:14,986 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 19:52:15,013 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 19:52:15,013 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-21 19:52:15,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 07:52:15 BoogieIcfgContainer [2023-12-21 19:52:15,014 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 19:52:15,015 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 19:52:15,015 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 19:52:15,018 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 19:52:15,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 07:52:14" (1/3) ... [2023-12-21 19:52:15,018 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28589783 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 07:52:15, skipping insertion in model container [2023-12-21 19:52:15,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:52:14" (2/3) ... [2023-12-21 19:52:15,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28589783 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 07:52:15, skipping insertion in model container [2023-12-21 19:52:15,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 07:52:15" (3/3) ... [2023-12-21 19:52:15,019 INFO L112 eAbstractionObserver]: Analyzing ICFG array_init_pair_sum_const.c [2023-12-21 19:52:15,032 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 19:52:15,032 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 19:52:15,061 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 19:52:15,066 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;@6bd5974a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 19:52:15,066 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 19:52:15,069 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 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-21 19:52:15,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-21 19:52:15,072 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:52:15,073 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 19:52:15,073 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:52:15,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:52:15,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1223517790, now seen corresponding path program 1 times [2023-12-21 19:52:15,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:52:15,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1972352036] [2023-12-21 19:52:15,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 19:52:15,085 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-21 19:52:15,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:52:15,088 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-21 19:52:15,093 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-21 19:52:15,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 19:52:15,149 INFO L262 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-21 19:52:15,154 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:52:15,190 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-21 19:52:15,191 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 19:52:15,191 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 19:52:15,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1972352036] [2023-12-21 19:52:15,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1972352036] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 19:52:15,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 19:52:15,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 19:52:15,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308192617] [2023-12-21 19:52:15,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 19:52:15,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 19:52:15,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 19:52:15,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 19:52:15,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 19:52:15,235 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 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 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-21 19:52:15,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 19:52:15,286 INFO L93 Difference]: Finished difference Result 23 states and 35 transitions. [2023-12-21 19:52:15,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 19:52:15,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2023-12-21 19:52:15,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 19:52:15,302 INFO L225 Difference]: With dead ends: 23 [2023-12-21 19:52:15,302 INFO L226 Difference]: Without dead ends: 11 [2023-12-21 19:52:15,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-21 19:52:15,312 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 19:52:15,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 19:52:15,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2023-12-21 19:52:15,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2023-12-21 19:52:15,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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-21 19:52:15,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2023-12-21 19:52:15,359 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 8 [2023-12-21 19:52:15,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 19:52:15,359 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2023-12-21 19:52:15,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-21 19:52:15,359 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2023-12-21 19:52:15,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-21 19:52:15,361 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:52:15,361 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 19:52:15,367 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-21 19:52:15,562 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-21 19:52:15,563 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:52:15,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:52:15,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1535486091, now seen corresponding path program 1 times [2023-12-21 19:52:15,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:52:15,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2125532787] [2023-12-21 19:52:15,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 19:52:15,564 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-21 19:52:15,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:52:15,566 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-21 19:52:15,567 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-21 19:52:15,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 19:52:15,611 INFO L262 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 19:52:15,612 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:52:15,646 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-21 19:52:15,647 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 19:52:15,677 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-21 19:52:15,677 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 19:52:15,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2125532787] [2023-12-21 19:52:15,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2125532787] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 19:52:15,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 19:52:15,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2023-12-21 19:52:15,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645401865] [2023-12-21 19:52:15,682 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 19:52:15,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 19:52:15,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 19:52:15,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 19:52:15,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-21 19:52:15,684 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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-21 19:52:15,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 19:52:15,755 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2023-12-21 19:52:15,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 19:52:15,755 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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 9 [2023-12-21 19:52:15,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 19:52:15,756 INFO L225 Difference]: With dead ends: 22 [2023-12-21 19:52:15,756 INFO L226 Difference]: Without dead ends: 14 [2023-12-21 19:52:15,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 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-21 19:52:15,757 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 3 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 19:52:15,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 11 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 19:52:15,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2023-12-21 19:52:15,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2023-12-21 19:52:15,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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-21 19:52:15,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2023-12-21 19:52:15,760 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 9 [2023-12-21 19:52:15,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 19:52:15,760 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2023-12-21 19:52:15,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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-21 19:52:15,761 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2023-12-21 19:52:15,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-21 19:52:15,761 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:52:15,761 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 19:52:15,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-21 19:52:15,966 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-21 19:52:15,967 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:52:15,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:52:15,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1026323486, now seen corresponding path program 2 times [2023-12-21 19:52:15,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:52:15,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1458978723] [2023-12-21 19:52:15,968 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 19:52:15,968 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-21 19:52:15,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:52:15,969 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-21 19:52:15,973 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-21 19:52:16,023 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-21 19:52:16,023 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 19:52:16,025 INFO L262 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-21 19:52:16,026 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:52:16,063 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-21 19:52:16,064 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 19:52:16,064 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 19:52:16,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1458978723] [2023-12-21 19:52:16,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1458978723] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 19:52:16,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 19:52:16,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 19:52:16,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409972208] [2023-12-21 19:52:16,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 19:52:16,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 19:52:16,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 19:52:16,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 19:52:16,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-21 19:52:16,065 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-21 19:52:16,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 19:52:16,112 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2023-12-21 19:52:16,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 19:52:16,113 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 12 [2023-12-21 19:52:16,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 19:52:16,113 INFO L225 Difference]: With dead ends: 21 [2023-12-21 19:52:16,113 INFO L226 Difference]: Without dead ends: 15 [2023-12-21 19:52:16,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-21 19:52:16,114 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 9 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 19:52:16,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 8 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 19:52:16,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-12-21 19:52:16,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2023-12-21 19:52:16,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 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-21 19:52:16,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2023-12-21 19:52:16,118 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 12 [2023-12-21 19:52:16,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 19:52:16,118 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2023-12-21 19:52:16,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-21 19:52:16,118 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2023-12-21 19:52:16,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-21 19:52:16,118 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:52:16,118 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 19:52:16,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-21 19:52:16,322 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-21 19:52:16,322 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:52:16,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:52:16,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1377544509, now seen corresponding path program 1 times [2023-12-21 19:52:16,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:52:16,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [36380894] [2023-12-21 19:52:16,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 19:52:16,324 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-21 19:52:16,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:52:16,324 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-21 19:52:16,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 (5)] Waiting until timeout for monitored process [2023-12-21 19:52:16,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 19:52:16,383 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-21 19:52:16,385 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:52:16,459 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 19:52:16,459 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 19:52:16,593 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 19:52:16,593 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 19:52:16,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [36380894] [2023-12-21 19:52:16,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [36380894] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 19:52:16,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 19:52:16,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-12-21 19:52:16,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543997447] [2023-12-21 19:52:16,594 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 19:52:16,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-21 19:52:16,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 19:52:16,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-21 19:52:16,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-12-21 19:52:16,595 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 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-21 19:52:16,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 19:52:16,928 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2023-12-21 19:52:16,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-21 19:52:16,929 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 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 13 [2023-12-21 19:52:16,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 19:52:16,929 INFO L225 Difference]: With dead ends: 30 [2023-12-21 19:52:16,930 INFO L226 Difference]: Without dead ends: 21 [2023-12-21 19:52:16,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2023-12-21 19:52:16,931 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 3 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 19:52:16,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 32 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 19:52:16,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-12-21 19:52:16,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-12-21 19:52:16,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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-21 19:52:16,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2023-12-21 19:52:16,936 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 13 [2023-12-21 19:52:16,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 19:52:16,936 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2023-12-21 19:52:16,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 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-21 19:52:16,936 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2023-12-21 19:52:16,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-21 19:52:16,937 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:52:16,937 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 19:52:16,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-21 19:52:17,140 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-21 19:52:17,140 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:52:17,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:52:17,141 INFO L85 PathProgramCache]: Analyzing trace with hash 18020899, now seen corresponding path program 2 times [2023-12-21 19:52:17,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:52:17,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1005241165] [2023-12-21 19:52:17,141 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 19:52:17,141 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-21 19:52:17,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:52:17,142 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-21 19:52:17,144 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-21 19:52:17,219 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 19:52:17,220 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 19:52:17,223 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-21 19:52:17,224 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:52:17,352 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 19:52:17,353 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 19:52:17,867 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 19:52:17,867 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 19:52:17,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1005241165] [2023-12-21 19:52:17,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1005241165] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 19:52:17,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 19:52:17,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2023-12-21 19:52:17,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825889951] [2023-12-21 19:52:17,868 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 19:52:17,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-21 19:52:17,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 19:52:17,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-21 19:52:17,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2023-12-21 19:52:17,870 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 23 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-21 19:52:19,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 19:52:19,653 INFO L93 Difference]: Finished difference Result 42 states and 57 transitions. [2023-12-21 19:52:19,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-21 19:52:19,656 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 23 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 19 [2023-12-21 19:52:19,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 19:52:19,656 INFO L225 Difference]: With dead ends: 42 [2023-12-21 19:52:19,656 INFO L226 Difference]: Without dead ends: 33 [2023-12-21 19:52:19,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2023-12-21 19:52:19,657 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 3 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 19:52:19,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 38 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 19:52:19,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-12-21 19:52:19,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-12-21 19:52:19,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 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-21 19:52:19,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2023-12-21 19:52:19,663 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 19 [2023-12-21 19:52:19,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 19:52:19,664 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2023-12-21 19:52:19,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 23 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-21 19:52:19,664 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2023-12-21 19:52:19,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-21 19:52:19,664 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:52:19,665 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 19:52:19,670 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-21 19:52:19,870 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-21 19:52:19,871 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:52:19,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:52:19,871 INFO L85 PathProgramCache]: Analyzing trace with hash 71706851, now seen corresponding path program 3 times [2023-12-21 19:52:19,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:52:19,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [867453362] [2023-12-21 19:52:19,871 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 19:52:19,872 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-21 19:52:19,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:52:19,872 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-21 19:52:19,873 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-21 19:52:19,955 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-21 19:52:19,955 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 19:52:19,956 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 19:52:19,958 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:52:20,006 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2023-12-21 19:52:20,006 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 19:52:20,053 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2023-12-21 19:52:20,053 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 19:52:20,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [867453362] [2023-12-21 19:52:20,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [867453362] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 19:52:20,053 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 19:52:20,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-12-21 19:52:20,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182479379] [2023-12-21 19:52:20,054 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 19:52:20,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 19:52:20,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 19:52:20,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 19:52:20,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-21 19:52:20,055 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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-21 19:52:20,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 19:52:20,148 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2023-12-21 19:52:20,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 19:52:20,148 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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-21 19:52:20,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 19:52:20,149 INFO L225 Difference]: With dead ends: 53 [2023-12-21 19:52:20,149 INFO L226 Difference]: Without dead ends: 47 [2023-12-21 19:52:20,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2023-12-21 19:52:20,150 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 46 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 19:52:20,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 14 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 19:52:20,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-12-21 19:52:20,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 36. [2023-12-21 19:52:20,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 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-21 19:52:20,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2023-12-21 19:52:20,156 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 31 [2023-12-21 19:52:20,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 19:52:20,157 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2023-12-21 19:52:20,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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-21 19:52:20,157 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2023-12-21 19:52:20,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-21 19:52:20,157 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:52:20,157 INFO L195 NwaCegarLoop]: trace histogram [22, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 19:52:20,164 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-21 19:52:20,362 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-21 19:52:20,362 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:52:20,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:52:20,363 INFO L85 PathProgramCache]: Analyzing trace with hash -18485442, now seen corresponding path program 4 times [2023-12-21 19:52:20,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:52:20,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [509281696] [2023-12-21 19:52:20,363 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-21 19:52:20,363 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-21 19:52:20,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:52:20,364 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-21 19:52:20,365 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-21 19:52:20,487 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-21 19:52:20,487 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 19:52:20,495 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-21 19:52:20,497 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:52:20,810 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-21 19:52:20,810 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 19:52:22,759 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-21 19:52:22,760 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 19:52:22,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [509281696] [2023-12-21 19:52:22,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [509281696] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 19:52:22,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 19:52:22,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 47 [2023-12-21 19:52:22,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288542178] [2023-12-21 19:52:22,760 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 19:52:22,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-12-21 19:52:22,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 19:52:22,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-12-21 19:52:22,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2023-12-21 19:52:22,762 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 48 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 47 states have internal predecessors, (55), 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-21 19:52:34,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 19:52:34,297 INFO L93 Difference]: Finished difference Result 72 states and 99 transitions. [2023-12-21 19:52:34,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-12-21 19:52:34,298 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 47 states have internal predecessors, (55), 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 34 [2023-12-21 19:52:34,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 19:52:34,299 INFO L225 Difference]: With dead ends: 72 [2023-12-21 19:52:34,300 INFO L226 Difference]: Without dead ends: 60 [2023-12-21 19:52:34,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2023-12-21 19:52:34,302 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 3 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-21 19:52:34,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 74 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-21 19:52:34,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-12-21 19:52:34,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2023-12-21 19:52:34,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 59 states have internal predecessors, (62), 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-21 19:52:34,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2023-12-21 19:52:34,312 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 34 [2023-12-21 19:52:34,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 19:52:34,312 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2023-12-21 19:52:34,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 47 states have internal predecessors, (55), 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-21 19:52:34,312 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2023-12-21 19:52:34,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-21 19:52:34,313 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:52:34,313 INFO L195 NwaCegarLoop]: trace histogram [46, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 19:52:34,322 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 (8)] Ended with exit code 0 [2023-12-21 19:52:34,517 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-21 19:52:34,518 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:52:34,518 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:52:34,518 INFO L85 PathProgramCache]: Analyzing trace with hash -207814210, now seen corresponding path program 5 times [2023-12-21 19:52:34,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:52:34,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1527964353] [2023-12-21 19:52:34,519 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-21 19:52:34,519 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-21 19:52:34,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:52:34,520 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-21 19:52:34,521 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-21 19:52:35,716 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2023-12-21 19:52:35,717 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 19:52:35,738 INFO L262 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-21 19:52:35,740 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:52:35,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1091 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2023-12-21 19:52:35,839 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 19:52:36,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1091 backedges. 46 proven. 10 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2023-12-21 19:52:36,078 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 19:52:36,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1527964353] [2023-12-21 19:52:36,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1527964353] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 19:52:36,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 19:52:36,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2023-12-21 19:52:36,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532826341] [2023-12-21 19:52:36,079 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 19:52:36,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-21 19:52:36,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 19:52:36,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-21 19:52:36,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2023-12-21 19:52:36,080 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 19:52:36,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 19:52:36,383 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions. [2023-12-21 19:52:36,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-21 19:52:36,384 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2023-12-21 19:52:36,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 19:52:36,385 INFO L225 Difference]: With dead ends: 113 [2023-12-21 19:52:36,385 INFO L226 Difference]: Without dead ends: 107 [2023-12-21 19:52:36,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=235, Unknown=0, NotChecked=0, Total=380 [2023-12-21 19:52:36,386 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 202 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 19:52:36,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 74 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 19:52:36,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-12-21 19:52:36,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 66. [2023-12-21 19:52:36,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.0461538461538462) internal successors, (68), 65 states have internal predecessors, (68), 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-21 19:52:36,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2023-12-21 19:52:36,414 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 58 [2023-12-21 19:52:36,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 19:52:36,414 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2023-12-21 19:52:36,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 19:52:36,414 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2023-12-21 19:52:36,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-21 19:52:36,417 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:52:36,417 INFO L195 NwaCegarLoop]: trace histogram [46, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 19:52:36,431 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-21 19:52:36,629 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-21 19:52:36,629 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:52:36,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:52:36,630 INFO L85 PathProgramCache]: Analyzing trace with hash 2145079198, now seen corresponding path program 6 times [2023-12-21 19:52:36,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:52:36,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2005892939] [2023-12-21 19:52:36,630 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-21 19:52:36,630 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-21 19:52:36,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:52:36,632 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-21 19:52:36,642 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-21 19:52:37,007 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2023-12-21 19:52:37,008 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 19:52:37,019 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-21 19:52:37,023 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:52:37,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1136 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2023-12-21 19:52:37,206 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 19:52:37,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1136 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2023-12-21 19:52:37,681 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 19:52:37,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2005892939] [2023-12-21 19:52:37,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2005892939] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 19:52:37,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 19:52:37,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2023-12-21 19:52:37,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676926508] [2023-12-21 19:52:37,681 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 19:52:37,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-21 19:52:37,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 19:52:37,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-21 19:52:37,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2023-12-21 19:52:37,682 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 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-21 19:52:39,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 19:52:39,141 INFO L93 Difference]: Finished difference Result 185 states and 199 transitions. [2023-12-21 19:52:39,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-21 19:52:39,141 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 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 64 [2023-12-21 19:52:39,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 19:52:39,142 INFO L225 Difference]: With dead ends: 185 [2023-12-21 19:52:39,142 INFO L226 Difference]: Without dead ends: 179 [2023-12-21 19:52:39,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=479, Invalid=853, Unknown=0, NotChecked=0, Total=1332 [2023-12-21 19:52:39,143 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 773 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 289 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 773 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 289 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-21 19:52:39,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [773 Valid, 362 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [289 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-21 19:52:39,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2023-12-21 19:52:39,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 78. [2023-12-21 19:52:39,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.0389610389610389) internal successors, (80), 77 states have internal predecessors, (80), 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-21 19:52:39,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2023-12-21 19:52:39,155 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 64 [2023-12-21 19:52:39,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 19:52:39,155 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2023-12-21 19:52:39,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 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-21 19:52:39,155 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2023-12-21 19:52:39,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-12-21 19:52:39,156 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:52:39,156 INFO L195 NwaCegarLoop]: trace histogram [46, 22, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 19:52:39,162 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-21 19:52:39,362 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-21 19:52:39,362 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:52:39,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:52:39,362 INFO L85 PathProgramCache]: Analyzing trace with hash 699937630, now seen corresponding path program 7 times [2023-12-21 19:52:39,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:52:39,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1492800997] [2023-12-21 19:52:39,363 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-21 19:52:39,363 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-21 19:52:39,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:52:39,364 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-21 19:52:39,370 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-21 19:52:39,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 19:52:39,680 INFO L262 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 49 conjunts are in the unsatisfiable core [2023-12-21 19:52:39,683 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:52:40,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1334 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2023-12-21 19:52:40,767 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 19:52:47,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1334 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2023-12-21 19:52:47,941 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 19:52:47,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1492800997] [2023-12-21 19:52:47,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1492800997] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 19:52:47,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 19:52:47,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 95 [2023-12-21 19:52:47,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797028257] [2023-12-21 19:52:47,942 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 19:52:47,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2023-12-21 19:52:47,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 19:52:47,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2023-12-21 19:52:47,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2398, Invalid=6722, Unknown=0, NotChecked=0, Total=9120 [2023-12-21 19:52:47,945 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand has 96 states, 96 states have (on average 1.0729166666666667) internal successors, (103), 95 states have internal predecessors, (103), 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-21 19:54:21,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 19:54:21,582 INFO L93 Difference]: Finished difference Result 156 states and 207 transitions. [2023-12-21 19:54:21,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2023-12-21 19:54:21,582 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 96 states have (on average 1.0729166666666667) internal successors, (103), 95 states have internal predecessors, (103), 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 76 [2023-12-21 19:54:21,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 19:54:21,583 INFO L225 Difference]: With dead ends: 156 [2023-12-21 19:54:21,583 INFO L226 Difference]: Without dead ends: 126 [2023-12-21 19:54:21,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 98.1s TimeCoverageRelationStatistics Valid=6814, Invalid=13208, Unknown=0, NotChecked=0, Total=20022 [2023-12-21 19:54:21,587 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 3 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 2641 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 2643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-12-21 19:54:21,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 149 Invalid, 2643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2641 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2023-12-21 19:54:21,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-12-21 19:54:21,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2023-12-21 19:54:21,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 1.024) internal successors, (128), 125 states have internal predecessors, (128), 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-21 19:54:21,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 128 transitions. [2023-12-21 19:54:21,612 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 128 transitions. Word has length 76 [2023-12-21 19:54:21,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 19:54:21,612 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 128 transitions. [2023-12-21 19:54:21,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 96 states have (on average 1.0729166666666667) internal successors, (103), 95 states have internal predecessors, (103), 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-21 19:54:21,612 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 128 transitions. [2023-12-21 19:54:21,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-21 19:54:21,613 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:54:21,613 INFO L195 NwaCegarLoop]: trace histogram [94, 22, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 19:54:21,624 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-21 19:54:21,823 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-21 19:54:21,823 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:54:21,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:54:21,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1788385374, now seen corresponding path program 8 times [2023-12-21 19:54:21,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:54:21,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [683892575] [2023-12-21 19:54:21,824 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 19:54:21,824 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-21 19:54:21,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:54:21,826 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-21 19:54:21,828 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-21 19:54:22,361 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 19:54:22,361 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 19:54:22,404 INFO L262 TraceCheckSpWp]: Trace formula consists of 906 conjuncts, 97 conjunts are in the unsatisfiable core [2023-12-21 19:54:22,408 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:54:26,621 INFO L134 CoverageAnalysis]: Checked inductivity of 4718 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2023-12-21 19:54:26,621 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 19:54:54,912 INFO L134 CoverageAnalysis]: Checked inductivity of 4718 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2023-12-21 19:54:54,913 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 19:54:54,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [683892575] [2023-12-21 19:54:54,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [683892575] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 19:54:54,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 19:54:54,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96] total 191 [2023-12-21 19:54:54,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375261938] [2023-12-21 19:54:54,913 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 19:54:54,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 192 states [2023-12-21 19:54:54,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 19:54:54,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2023-12-21 19:54:54,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9406, Invalid=27266, Unknown=0, NotChecked=0, Total=36672 [2023-12-21 19:54:54,920 INFO L87 Difference]: Start difference. First operand 126 states and 128 transitions. Second operand has 192 states, 192 states have (on average 1.0364583333333333) internal successors, (199), 191 states have internal predecessors, (199), 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-21 19:55:27,456 WARN L293 SmtUtils]: Spent 17.42s on a formula simplification that was a NOOP. DAG size: 286 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 19:55:48,628 WARN L293 SmtUtils]: Spent 16.44s on a formula simplification that was a NOOP. DAG size: 283 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 19:56:10,945 WARN L293 SmtUtils]: Spent 17.53s on a formula simplification that was a NOOP. DAG size: 280 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 19:56:32,647 WARN L293 SmtUtils]: Spent 16.79s on a formula simplification that was a NOOP. DAG size: 277 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 19:56:53,336 WARN L293 SmtUtils]: Spent 16.40s on a formula simplification that was a NOOP. DAG size: 274 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 19:57:13,426 WARN L293 SmtUtils]: Spent 15.25s on a formula simplification that was a NOOP. DAG size: 271 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 19:57:33,064 WARN L293 SmtUtils]: Spent 14.83s on a formula simplification that was a NOOP. DAG size: 268 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 19:57:52,724 WARN L293 SmtUtils]: Spent 14.83s on a formula simplification that was a NOOP. DAG size: 265 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 19:58:10,668 WARN L293 SmtUtils]: Spent 13.19s on a formula simplification that was a NOOP. DAG size: 262 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 19:58:27,905 WARN L293 SmtUtils]: Spent 12.95s on a formula simplification that was a NOOP. DAG size: 259 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 19:58:45,384 WARN L293 SmtUtils]: Spent 13.03s on a formula simplification that was a NOOP. DAG size: 256 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 19:59:02,364 WARN L293 SmtUtils]: Spent 12.82s on a formula simplification that was a NOOP. DAG size: 253 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 19:59:19,259 WARN L293 SmtUtils]: Spent 12.64s on a formula simplification that was a NOOP. DAG size: 250 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 19:59:35,201 WARN L293 SmtUtils]: Spent 11.63s on a formula simplification that was a NOOP. DAG size: 247 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 19:59:51,114 WARN L293 SmtUtils]: Spent 11.54s on a formula simplification that was a NOOP. DAG size: 244 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:00:08,529 WARN L293 SmtUtils]: Spent 12.84s on a formula simplification that was a NOOP. DAG size: 241 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:00:25,803 WARN L293 SmtUtils]: Spent 12.42s on a formula simplification that was a NOOP. DAG size: 238 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:00:41,978 WARN L293 SmtUtils]: Spent 11.35s on a formula simplification that was a NOOP. DAG size: 235 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:00:59,406 WARN L293 SmtUtils]: Spent 12.53s on a formula simplification that was a NOOP. DAG size: 232 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:01:16,323 WARN L293 SmtUtils]: Spent 11.82s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:01:33,069 WARN L293 SmtUtils]: Spent 11.88s on a formula simplification that was a NOOP. DAG size: 226 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:01:49,378 WARN L293 SmtUtils]: Spent 11.36s on a formula simplification that was a NOOP. DAG size: 223 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:02:03,983 WARN L293 SmtUtils]: Spent 10.21s on a formula simplification that was a NOOP. DAG size: 220 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:02:19,409 WARN L293 SmtUtils]: Spent 9.98s on a formula simplification that was a NOOP. DAG size: 217 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:02:32,346 WARN L293 SmtUtils]: Spent 8.84s on a formula simplification that was a NOOP. DAG size: 214 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:02:44,695 WARN L293 SmtUtils]: Spent 8.30s on a formula simplification that was a NOOP. DAG size: 211 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:02:56,053 WARN L293 SmtUtils]: Spent 7.53s on a formula simplification that was a NOOP. DAG size: 208 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:03:08,242 WARN L293 SmtUtils]: Spent 8.39s on a formula simplification that was a NOOP. DAG size: 205 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:03:20,789 WARN L293 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 202 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:03:32,890 WARN L293 SmtUtils]: Spent 7.71s on a formula simplification that was a NOOP. DAG size: 199 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:03:44,170 WARN L293 SmtUtils]: Spent 6.95s on a formula simplification that was a NOOP. DAG size: 196 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:03:56,237 WARN L293 SmtUtils]: Spent 7.94s on a formula simplification that was a NOOP. DAG size: 193 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:04:07,864 WARN L293 SmtUtils]: Spent 7.52s on a formula simplification that was a NOOP. DAG size: 190 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:04:18,956 WARN L293 SmtUtils]: Spent 7.11s on a formula simplification that was a NOOP. DAG size: 187 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:04:30,114 WARN L293 SmtUtils]: Spent 7.10s on a formula simplification that was a NOOP. DAG size: 184 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:04:40,466 WARN L293 SmtUtils]: Spent 6.82s on a formula simplification that was a NOOP. DAG size: 181 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:04:50,406 WARN L293 SmtUtils]: Spent 6.14s on a formula simplification that was a NOOP. DAG size: 178 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:04:59,963 WARN L293 SmtUtils]: Spent 5.98s on a formula simplification that was a NOOP. DAG size: 175 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:05:10,391 WARN L293 SmtUtils]: Spent 6.38s on a formula simplification that was a NOOP. DAG size: 172 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:05:20,290 WARN L293 SmtUtils]: Spent 5.85s on a formula simplification that was a NOOP. DAG size: 169 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:05:30,572 WARN L293 SmtUtils]: Spent 5.95s on a formula simplification that was a NOOP. DAG size: 166 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:05:39,182 WARN L293 SmtUtils]: Spent 5.26s on a formula simplification that was a NOOP. DAG size: 163 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:05:47,665 WARN L293 SmtUtils]: Spent 5.26s on a formula simplification that was a NOOP. DAG size: 160 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:05:55,952 WARN L293 SmtUtils]: Spent 5.17s on a formula simplification that was a NOOP. DAG size: 157 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:06:12,161 WARN L293 SmtUtils]: Spent 5.16s on a formula simplification that was a NOOP. DAG size: 151 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:06:20,779 WARN L293 SmtUtils]: Spent 5.05s on a formula simplification that was a NOOP. DAG size: 148 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2023-12-21 20:06:53,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2023-12-21 20:06:53,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1326 ImplicationChecksByTransitivity, 735.7s TimeCoverageRelationStatistics Valid=19198, Invalid=39608, Unknown=0, NotChecked=0, Total=58806 [2023-12-21 20:06:53,921 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9172 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 9173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2023-12-21 20:06:53,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 9173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9172 Invalid, 0 Unknown, 0 Unchecked, 12.4s Time] [2023-12-21 20:06:53,922 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 20:06:53,930 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-21 20:06:53,939 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-21 20:06:53,945 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-21 20:06:54,123 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-21 20:06:54,123 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (126states) and FLOYD_HOARE automaton (currently 148 states, 192 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 243 known predicates. [2023-12-21 20:06:54,127 INFO L445 BasicCegarLoop]: Path program histogram: [8, 2, 1] [2023-12-21 20:06:54,128 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 20:06:54,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 08:06:54 BoogieIcfgContainer [2023-12-21 20:06:54,130 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 20:06:54,130 INFO L158 Benchmark]: Toolchain (without parser) took 879672.64ms. Allocated memory was 305.1MB in the beginning and 367.0MB in the end (delta: 61.9MB). Free memory was 251.3MB in the beginning and 237.1MB in the end (delta: 14.2MB). Peak memory consumption was 76.7MB. Max. memory is 8.0GB. [2023-12-21 20:06:54,131 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 212.9MB. Free memory was 162.0MB in the beginning and 161.9MB in the end (delta: 125.9kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 20:06:54,131 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.01ms. Allocated memory is still 305.1MB. Free memory was 251.0MB in the beginning and 239.7MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-21 20:06:54,131 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.18ms. Allocated memory is still 305.1MB. Free memory was 239.7MB in the beginning and 238.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 20:06:54,131 INFO L158 Benchmark]: Boogie Preprocessor took 37.02ms. Allocated memory is still 305.1MB. Free memory was 238.0MB in the beginning and 235.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 20:06:54,131 INFO L158 Benchmark]: RCFGBuilder took 295.86ms. Allocated memory is still 305.1MB. Free memory was 235.9MB in the beginning and 220.9MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-21 20:06:54,131 INFO L158 Benchmark]: TraceAbstraction took 879115.02ms. Allocated memory was 305.1MB in the beginning and 367.0MB in the end (delta: 61.9MB). Free memory was 220.2MB in the beginning and 237.1MB in the end (delta: -16.9MB). Peak memory consumption was 45.3MB. Max. memory is 8.0GB. [2023-12-21 20:06:54,132 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 212.9MB. Free memory was 162.0MB in the beginning and 161.9MB in the end (delta: 125.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 197.01ms. Allocated memory is still 305.1MB. Free memory was 251.0MB in the beginning and 239.7MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 22.18ms. Allocated memory is still 305.1MB. Free memory was 239.7MB in the beginning and 238.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.02ms. Allocated memory is still 305.1MB. Free memory was 238.0MB in the beginning and 235.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 295.86ms. Allocated memory is still 305.1MB. Free memory was 235.9MB in the beginning and 220.9MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 879115.02ms. Allocated memory was 305.1MB in the beginning and 367.0MB in the end (delta: 61.9MB). Free memory was 220.2MB in the beginning and 237.1MB in the end (delta: -16.9MB). Peak memory consumption was 45.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 8]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 8). Cancelled while NwaCegarLoop was constructing difference of abstraction (126states) and FLOYD_HOARE automaton (currently 148 states, 192 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 243 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 12 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 879.1s, OverallIterations: 11, TraceHistogramMax: 94, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 828.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1045 SdHoareTripleChecker+Valid, 18.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1045 mSDsluCounter, 774 SdHoareTripleChecker+Invalid, 15.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 669 mSDsCounter, 376 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13661 IncrementalHoareTripleChecker+Invalid, 14037 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 376 mSolverCounterUnsat, 105 mSDtfsCounter, 13661 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1009 GetRequests, 444 SyntacticMatches, 0 SemanticMatches, 564 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2900 ImplicationChecksByTransitivity, 850.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=126occurred in iteration=10, InterpolantAutomatonStates: 238, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 153 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 45.2s InterpolantComputationTime, 448 NumberOfCodeBlocks, 398 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 856 ConstructedInterpolants, 0 QuantifiedInterpolants, 3361 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2769 ConjunctsInSsa, 227 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 5830/17738 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown