/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/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-62.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 15:59:29,326 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 15:59:29,390 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-16 15:59:29,393 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 15:59:29,394 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 15:59:29,413 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 15:59:29,414 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 15:59:29,414 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 15:59:29,414 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 15:59:29,417 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 15:59:29,417 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 15:59:29,418 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 15:59:29,418 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 15:59:29,419 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 15:59:29,419 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 15:59:29,420 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 15:59:29,420 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 15:59:29,420 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 15:59:29,420 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 15:59:29,420 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 15:59:29,420 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 15:59:29,421 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 15:59:29,421 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 15:59:29,421 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 15:59:29,421 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 15:59:29,421 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 15:59:29,421 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 15:59:29,421 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 15:59:29,421 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 15:59:29,422 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 15:59:29,422 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 15:59:29,422 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 15:59:29,422 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 15:59:29,423 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 15:59:29,423 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 15:59:29,423 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 15:59:29,423 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 15:59:29,423 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 15:59:29,423 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 15:59:29,423 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 15:59:29,423 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 15:59:29,423 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 15:59:29,424 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 15:59:29,424 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 15:59:29,424 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 15:59:29,424 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 15:59:29,424 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-16 15:59:29,614 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 15:59:29,631 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 15:59:29,632 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 15:59:29,633 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 15:59:29,633 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 15:59:29,635 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-62.i [2023-12-16 15:59:30,571 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 15:59:30,733 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 15:59:30,733 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-62.i [2023-12-16 15:59:30,739 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/816a76e73/089ecb0f681d4ec5b5a565e718628b8a/FLAGaa3ae41a5 [2023-12-16 15:59:31,145 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/816a76e73/089ecb0f681d4ec5b5a565e718628b8a [2023-12-16 15:59:31,147 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 15:59:31,147 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 15:59:31,148 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 15:59:31,148 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 15:59:31,153 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 15:59:31,153 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:59:31" (1/1) ... [2023-12-16 15:59:31,154 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bd1039d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:59:31, skipping insertion in model container [2023-12-16 15:59:31,154 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:59:31" (1/1) ... [2023-12-16 15:59:31,176 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 15:59:31,289 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-62.i[916,929] [2023-12-16 15:59:31,323 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 15:59:31,340 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 15:59:31,348 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-62.i[916,929] [2023-12-16 15:59:31,368 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 15:59:31,382 INFO L206 MainTranslator]: Completed translation [2023-12-16 15:59:31,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:59:31 WrapperNode [2023-12-16 15:59:31,383 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 15:59:31,384 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 15:59:31,384 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 15:59:31,384 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 15:59:31,389 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:59:31" (1/1) ... [2023-12-16 15:59:31,398 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:59:31" (1/1) ... [2023-12-16 15:59:31,420 INFO L138 Inliner]: procedures = 33, calls = 107, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 320 [2023-12-16 15:59:31,421 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 15:59:31,421 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 15:59:31,421 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 15:59:31,421 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 15:59:31,429 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:59:31" (1/1) ... [2023-12-16 15:59:31,429 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:59:31" (1/1) ... [2023-12-16 15:59:31,433 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:59:31" (1/1) ... [2023-12-16 15:59:31,445 INFO L175 MemorySlicer]: Split 87 memory accesses to 2 slices as follows [2, 85]. 98 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 10]. The 14 writes are split as follows [0, 14]. [2023-12-16 15:59:31,446 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:59:31" (1/1) ... [2023-12-16 15:59:31,446 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:59:31" (1/1) ... [2023-12-16 15:59:31,458 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:59:31" (1/1) ... [2023-12-16 15:59:31,462 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:59:31" (1/1) ... [2023-12-16 15:59:31,464 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:59:31" (1/1) ... [2023-12-16 15:59:31,465 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:59:31" (1/1) ... [2023-12-16 15:59:31,468 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 15:59:31,469 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 15:59:31,469 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 15:59:31,469 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 15:59:31,469 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:59:31" (1/1) ... [2023-12-16 15:59:31,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 15:59:31,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 15:59:31,514 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 15:59:31,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 15:59:31,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 15:59:31,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-12-16 15:59:31,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-12-16 15:59:31,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2023-12-16 15:59:31,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2023-12-16 15:59:31,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 15:59:31,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-16 15:59:31,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2023-12-16 15:59:31,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2023-12-16 15:59:31,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-16 15:59:31,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-16 15:59:31,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2023-12-16 15:59:31,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2023-12-16 15:59:31,544 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 15:59:31,544 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 15:59:31,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 15:59:31,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 15:59:31,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2023-12-16 15:59:31,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2023-12-16 15:59:31,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2023-12-16 15:59:31,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2023-12-16 15:59:31,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-16 15:59:31,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-16 15:59:31,625 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 15:59:31,626 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 15:59:31,905 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 15:59:31,953 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 15:59:31,953 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 15:59:31,953 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:59:31 BoogieIcfgContainer [2023-12-16 15:59:31,953 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 15:59:31,955 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 15:59:31,955 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 15:59:31,957 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 15:59:31,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 03:59:31" (1/3) ... [2023-12-16 15:59:31,958 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17d4dd00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:59:31, skipping insertion in model container [2023-12-16 15:59:31,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:59:31" (2/3) ... [2023-12-16 15:59:31,958 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17d4dd00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:59:31, skipping insertion in model container [2023-12-16 15:59:31,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:59:31" (3/3) ... [2023-12-16 15:59:31,959 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-62.i [2023-12-16 15:59:31,985 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 15:59:31,986 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 15:59:32,014 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 15:59:32,019 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;@3cc2dfbe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 15:59:32,019 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 15:59:32,022 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 56 states have internal predecessors, (81), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-16 15:59:32,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-12-16 15:59:32,029 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:59:32,029 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:59:32,030 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:59:32,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:59:32,033 INFO L85 PathProgramCache]: Analyzing trace with hash 679761065, now seen corresponding path program 1 times [2023-12-16 15:59:32,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:59:32,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [373286355] [2023-12-16 15:59:32,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:59:32,041 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:59:32,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:59:32,043 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 15:59:32,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-16 15:59:32,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:59:32,188 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 15:59:32,195 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:59:32,216 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2023-12-16 15:59:32,217 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:59:32,217 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:59:32,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [373286355] [2023-12-16 15:59:32,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [373286355] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:59:32,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:59:32,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 15:59:32,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872140417] [2023-12-16 15:59:32,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:59:32,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 15:59:32,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:59:32,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 15:59:32,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 15:59:32,242 INFO L87 Difference]: Start difference. First operand has 66 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 56 states have internal predecessors, (81), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-16 15:59:32,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:59:32,266 INFO L93 Difference]: Finished difference Result 129 states and 200 transitions. [2023-12-16 15:59:32,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 15:59:32,268 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 68 [2023-12-16 15:59:32,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:59:32,275 INFO L225 Difference]: With dead ends: 129 [2023-12-16 15:59:32,275 INFO L226 Difference]: Without dead ends: 64 [2023-12-16 15:59:32,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 15:59:32,281 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 15:59:32,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 15:59:32,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-12-16 15:59:32,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2023-12-16 15:59:32,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 54 states have internal predecessors, (76), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-16 15:59:32,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 92 transitions. [2023-12-16 15:59:32,310 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 92 transitions. Word has length 68 [2023-12-16 15:59:32,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:59:32,311 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 92 transitions. [2023-12-16 15:59:32,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-16 15:59:32,311 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 92 transitions. [2023-12-16 15:59:32,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-12-16 15:59:32,313 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:59:32,313 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:59:32,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-16 15:59:32,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:59:32,517 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:59:32,518 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:59:32,518 INFO L85 PathProgramCache]: Analyzing trace with hash 619301017, now seen corresponding path program 1 times [2023-12-16 15:59:32,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:59:32,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1763329022] [2023-12-16 15:59:32,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:59:32,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-16 15:59:32,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:59:32,520 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 15:59:32,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-16 15:59:32,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:59:32,624 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 15:59:32,630 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:59:32,686 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-16 15:59:32,686 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:59:32,687 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:59:32,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1763329022] [2023-12-16 15:59:32,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1763329022] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:59:32,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:59:32,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 15:59:32,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975564685] [2023-12-16 15:59:32,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:59:32,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 15:59:32,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:59:32,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 15:59:32,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 15:59:32,693 INFO L87 Difference]: Start difference. First operand 64 states and 92 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:59:32,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:59:32,829 INFO L93 Difference]: Finished difference Result 151 states and 217 transitions. [2023-12-16 15:59:32,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 15:59:32,829 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 68 [2023-12-16 15:59:32,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:59:32,834 INFO L225 Difference]: With dead ends: 151 [2023-12-16 15:59:32,835 INFO L226 Difference]: Without dead ends: 88 [2023-12-16 15:59:32,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-12-16 15:59:32,837 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 53 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 15:59:32,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 399 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 15:59:32,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-12-16 15:59:32,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 70. [2023-12-16 15:59:32,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 60 states have (on average 1.3666666666666667) internal successors, (82), 60 states have internal predecessors, (82), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-16 15:59:32,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 98 transitions. [2023-12-16 15:59:32,848 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 98 transitions. Word has length 68 [2023-12-16 15:59:32,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:59:32,849 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 98 transitions. [2023-12-16 15:59:32,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:59:32,849 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 98 transitions. [2023-12-16 15:59:32,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-12-16 15:59:32,850 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:59:32,851 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:59:32,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-16 15:59:33,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:59:33,052 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:59:33,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:59:33,053 INFO L85 PathProgramCache]: Analyzing trace with hash 676559319, now seen corresponding path program 1 times [2023-12-16 15:59:33,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:59:33,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1503507357] [2023-12-16 15:59:33,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:59:33,054 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:59:33,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:59:33,054 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 15:59:33,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-16 15:59:33,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:59:33,138 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 15:59:33,140 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:59:33,164 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-16 15:59:33,165 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:59:33,165 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:59:33,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1503507357] [2023-12-16 15:59:33,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1503507357] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:59:33,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:59:33,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 15:59:33,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712781090] [2023-12-16 15:59:33,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:59:33,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 15:59:33,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:59:33,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 15:59:33,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-16 15:59:33,166 INFO L87 Difference]: Start difference. First operand 70 states and 98 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:59:33,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:59:33,283 INFO L93 Difference]: Finished difference Result 158 states and 218 transitions. [2023-12-16 15:59:33,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-16 15:59:33,283 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 68 [2023-12-16 15:59:33,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:59:33,284 INFO L225 Difference]: With dead ends: 158 [2023-12-16 15:59:33,284 INFO L226 Difference]: Without dead ends: 89 [2023-12-16 15:59:33,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2023-12-16 15:59:33,285 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 43 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 15:59:33,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 472 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 15:59:33,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-16 15:59:33,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 72. [2023-12-16 15:59:33,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 62 states have (on average 1.3548387096774193) internal successors, (84), 62 states have internal predecessors, (84), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-16 15:59:33,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 100 transitions. [2023-12-16 15:59:33,291 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 100 transitions. Word has length 68 [2023-12-16 15:59:33,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:59:33,291 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 100 transitions. [2023-12-16 15:59:33,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:59:33,291 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 100 transitions. [2023-12-16 15:59:33,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-12-16 15:59:33,292 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:59:33,292 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:59:33,298 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-16 15:59:33,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:59:33,497 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:59:33,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:59:33,498 INFO L85 PathProgramCache]: Analyzing trace with hash 676618901, now seen corresponding path program 1 times [2023-12-16 15:59:33,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:59:33,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [584241944] [2023-12-16 15:59:33,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:59:33,498 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:59:33,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:59:33,499 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 15:59:33,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-16 15:59:33,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:59:33,590 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-16 15:59:33,593 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:59:33,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 29 [2023-12-16 15:59:33,656 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:59:33,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 45 [2023-12-16 15:59:33,722 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:59:33,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 55 treesize of output 66 [2023-12-16 15:59:33,830 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:59:33,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 76 treesize of output 34 [2023-12-16 15:59:33,852 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-16 15:59:33,852 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:59:33,853 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:59:33,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [584241944] [2023-12-16 15:59:33,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [584241944] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:59:33,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:59:33,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 15:59:33,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111170693] [2023-12-16 15:59:33,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:59:33,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 15:59:33,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:59:33,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 15:59:33,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-16 15:59:33,854 INFO L87 Difference]: Start difference. First operand 72 states and 100 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:59:34,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:59:34,548 INFO L93 Difference]: Finished difference Result 234 states and 325 transitions. [2023-12-16 15:59:34,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 15:59:34,549 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 68 [2023-12-16 15:59:34,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:59:34,550 INFO L225 Difference]: With dead ends: 234 [2023-12-16 15:59:34,550 INFO L226 Difference]: Without dead ends: 163 [2023-12-16 15:59:34,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-12-16 15:59:34,551 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 275 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-16 15:59:34,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 204 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-16 15:59:34,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2023-12-16 15:59:34,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 133. [2023-12-16 15:59:34,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 113 states have (on average 1.3274336283185841) internal successors, (150), 114 states have internal predecessors, (150), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-16 15:59:34,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 182 transitions. [2023-12-16 15:59:34,564 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 182 transitions. Word has length 68 [2023-12-16 15:59:34,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:59:34,565 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 182 transitions. [2023-12-16 15:59:34,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:59:34,565 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 182 transitions. [2023-12-16 15:59:34,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-16 15:59:34,566 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:59:34,566 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:59:34,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-16 15:59:34,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:59:34,770 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:59:34,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:59:34,770 INFO L85 PathProgramCache]: Analyzing trace with hash -707403974, now seen corresponding path program 1 times [2023-12-16 15:59:34,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:59:34,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [233875956] [2023-12-16 15:59:34,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:59:34,771 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:59:34,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:59:34,772 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 15:59:34,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-16 15:59:34,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:59:34,860 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-16 15:59:34,862 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:59:34,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-12-16 15:59:34,878 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:59:34,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2023-12-16 15:59:34,922 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:59:34,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 28 [2023-12-16 15:59:34,947 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-16 15:59:34,947 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:59:34,947 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:59:34,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [233875956] [2023-12-16 15:59:34,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [233875956] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:59:34,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:59:34,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 15:59:34,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813735172] [2023-12-16 15:59:34,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:59:34,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 15:59:34,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:59:34,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 15:59:34,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-16 15:59:34,949 INFO L87 Difference]: Start difference. First operand 133 states and 182 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:59:35,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:59:35,369 INFO L93 Difference]: Finished difference Result 301 states and 413 transitions. [2023-12-16 15:59:35,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 15:59:35,369 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 70 [2023-12-16 15:59:35,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:59:35,370 INFO L225 Difference]: With dead ends: 301 [2023-12-16 15:59:35,370 INFO L226 Difference]: Without dead ends: 169 [2023-12-16 15:59:35,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-12-16 15:59:35,371 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 276 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 15:59:35,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 450 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 15:59:35,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2023-12-16 15:59:35,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 136. [2023-12-16 15:59:35,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 116 states have (on average 1.3189655172413792) internal successors, (153), 117 states have internal predecessors, (153), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-16 15:59:35,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 185 transitions. [2023-12-16 15:59:35,382 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 185 transitions. Word has length 70 [2023-12-16 15:59:35,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:59:35,382 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 185 transitions. [2023-12-16 15:59:35,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:59:35,382 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 185 transitions. [2023-12-16 15:59:35,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-16 15:59:35,383 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:59:35,383 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:59:35,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-16 15:59:35,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:59:35,587 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:59:35,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:59:35,587 INFO L85 PathProgramCache]: Analyzing trace with hash -746674476, now seen corresponding path program 1 times [2023-12-16 15:59:35,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:59:35,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1233022903] [2023-12-16 15:59:35,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:59:35,588 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:59:35,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:59:35,589 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 15:59:35,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-16 15:59:35,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:59:35,692 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-16 15:59:35,708 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:59:35,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-16 15:59:35,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-12-16 15:59:35,773 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:59:35,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 41 [2023-12-16 15:59:35,892 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:59:35,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 65 treesize of output 61 [2023-12-16 15:59:35,913 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:59:35,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 65 treesize of output 25 [2023-12-16 15:59:35,958 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 43 proven. 3 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-12-16 15:59:35,958 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 15:59:36,240 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-12-16 15:59:36,240 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:59:36,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1233022903] [2023-12-16 15:59:36,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1233022903] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 15:59:36,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 15:59:36,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2023-12-16 15:59:36,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726247026] [2023-12-16 15:59:36,241 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 15:59:36,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-16 15:59:36,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:59:36,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-16 15:59:36,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2023-12-16 15:59:36,243 INFO L87 Difference]: Start difference. First operand 136 states and 185 transitions. Second operand has 17 states, 15 states have (on average 3.6) internal successors, (54), 17 states have internal predecessors, (54), 5 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (10), 3 states have call predecessors, (10), 5 states have call successors, (10) [2023-12-16 15:59:37,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:59:37,446 INFO L93 Difference]: Finished difference Result 355 states and 472 transitions. [2023-12-16 15:59:37,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-16 15:59:37,448 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.6) internal successors, (54), 17 states have internal predecessors, (54), 5 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (10), 3 states have call predecessors, (10), 5 states have call successors, (10) Word has length 72 [2023-12-16 15:59:37,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:59:37,450 INFO L225 Difference]: With dead ends: 355 [2023-12-16 15:59:37,450 INFO L226 Difference]: Without dead ends: 220 [2023-12-16 15:59:37,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=253, Invalid=677, Unknown=0, NotChecked=0, Total=930 [2023-12-16 15:59:37,451 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 184 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-16 15:59:37,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 305 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-16 15:59:37,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2023-12-16 15:59:37,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 208. [2023-12-16 15:59:37,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 176 states have (on average 1.2840909090909092) internal successors, (226), 179 states have internal predecessors, (226), 24 states have call successors, (24), 7 states have call predecessors, (24), 7 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-16 15:59:37,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 274 transitions. [2023-12-16 15:59:37,463 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 274 transitions. Word has length 72 [2023-12-16 15:59:37,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:59:37,463 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 274 transitions. [2023-12-16 15:59:37,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.6) internal successors, (54), 17 states have internal predecessors, (54), 5 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (10), 3 states have call predecessors, (10), 5 states have call successors, (10) [2023-12-16 15:59:37,463 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 274 transitions. [2023-12-16 15:59:37,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-12-16 15:59:37,464 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:59:37,464 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:59:37,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-16 15:59:37,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:59:37,668 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:59:37,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:59:37,668 INFO L85 PathProgramCache]: Analyzing trace with hash -958774125, now seen corresponding path program 1 times [2023-12-16 15:59:37,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:59:37,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [630366588] [2023-12-16 15:59:37,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:59:37,669 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:59:37,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:59:37,670 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 15:59:37,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-16 15:59:37,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:59:37,758 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 15:59:37,760 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:59:37,784 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-16 15:59:37,785 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:59:37,785 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:59:37,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [630366588] [2023-12-16 15:59:37,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [630366588] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:59:37,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:59:37,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 15:59:37,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291182853] [2023-12-16 15:59:37,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:59:37,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 15:59:37,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:59:37,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 15:59:37,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 15:59:37,786 INFO L87 Difference]: Start difference. First operand 208 states and 274 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:59:37,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:59:37,986 INFO L93 Difference]: Finished difference Result 592 states and 785 transitions. [2023-12-16 15:59:37,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 15:59:37,987 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 73 [2023-12-16 15:59:37,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:59:37,988 INFO L225 Difference]: With dead ends: 592 [2023-12-16 15:59:37,989 INFO L226 Difference]: Without dead ends: 397 [2023-12-16 15:59:37,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 15:59:37,990 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 110 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 15:59:37,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 282 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 15:59:37,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2023-12-16 15:59:37,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 217. [2023-12-16 15:59:38,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 185 states have (on average 1.2702702702702702) internal successors, (235), 188 states have internal predecessors, (235), 24 states have call successors, (24), 7 states have call predecessors, (24), 7 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-16 15:59:38,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 283 transitions. [2023-12-16 15:59:38,001 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 283 transitions. Word has length 73 [2023-12-16 15:59:38,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:59:38,001 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 283 transitions. [2023-12-16 15:59:38,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:59:38,001 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 283 transitions. [2023-12-16 15:59:38,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-12-16 15:59:38,002 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:59:38,002 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:59:38,007 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-16 15:59:38,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:59:38,205 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:59:38,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:59:38,205 INFO L85 PathProgramCache]: Analyzing trace with hash 928206547, now seen corresponding path program 1 times [2023-12-16 15:59:38,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:59:38,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [56059850] [2023-12-16 15:59:38,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:59:38,206 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:59:38,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:59:38,207 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 15:59:38,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-16 15:59:38,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:59:38,295 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-16 15:59:38,313 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:59:38,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-16 15:59:38,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2023-12-16 15:59:38,441 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:59:38,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2023-12-16 15:59:38,509 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:59:38,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2023-12-16 15:59:38,586 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:59:38,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2023-12-16 15:59:38,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 56 [2023-12-16 15:59:38,658 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:59:38,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 72 treesize of output 77 [2023-12-16 15:59:38,754 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:59:38,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 87 treesize of output 98 [2023-12-16 15:59:38,841 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:59:38,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 93 treesize of output 35 [2023-12-16 15:59:38,865 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 33 proven. 18 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2023-12-16 15:59:38,865 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 15:59:38,950 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-16 15:59:38,950 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:59:38,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [56059850] [2023-12-16 15:59:38,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [56059850] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 15:59:38,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 15:59:38,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2023-12-16 15:59:38,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512093037] [2023-12-16 15:59:38,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:59:38,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 15:59:38,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:59:38,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 15:59:38,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2023-12-16 15:59:38,951 INFO L87 Difference]: Start difference. First operand 217 states and 283 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:59:39,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:59:39,147 INFO L93 Difference]: Finished difference Result 420 states and 545 transitions. [2023-12-16 15:59:39,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 15:59:39,148 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 73 [2023-12-16 15:59:39,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:59:39,149 INFO L225 Difference]: With dead ends: 420 [2023-12-16 15:59:39,149 INFO L226 Difference]: Without dead ends: 216 [2023-12-16 15:59:39,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2023-12-16 15:59:39,150 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 46 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 15:59:39,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 231 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 15:59:39,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2023-12-16 15:59:39,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 214. [2023-12-16 15:59:39,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 182 states have (on average 1.2692307692307692) internal successors, (231), 185 states have internal predecessors, (231), 24 states have call successors, (24), 7 states have call predecessors, (24), 7 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-16 15:59:39,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 279 transitions. [2023-12-16 15:59:39,159 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 279 transitions. Word has length 73 [2023-12-16 15:59:39,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:59:39,159 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 279 transitions. [2023-12-16 15:59:39,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:59:39,159 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 279 transitions. [2023-12-16 15:59:39,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-16 15:59:39,160 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:59:39,160 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:59:39,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-16 15:59:39,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:59:39,364 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:59:39,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:59:39,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1156301473, now seen corresponding path program 1 times [2023-12-16 15:59:39,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:59:39,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [503815324] [2023-12-16 15:59:39,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:59:39,365 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:59:39,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:59:39,365 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 15:59:39,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-16 15:59:39,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:59:39,456 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-16 15:59:39,458 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:59:39,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-12-16 15:59:39,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2023-12-16 15:59:39,645 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:59:39,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 42 [2023-12-16 15:59:39,788 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:59:39,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 40 [2023-12-16 15:59:39,924 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:59:39,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 40 [2023-12-16 15:59:39,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 68 [2023-12-16 15:59:40,112 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:59:40,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 85 treesize of output 78 [2023-12-16 15:59:40,138 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:59:40,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 85 treesize of output 96 [2023-12-16 15:59:40,234 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:59:40,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 81 treesize of output 29 [2023-12-16 15:59:40,252 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 65 proven. 18 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-12-16 15:59:40,252 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 15:59:40,319 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-16 15:59:40,319 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:59:40,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [503815324] [2023-12-16 15:59:40,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [503815324] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 15:59:40,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 15:59:40,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 15 [2023-12-16 15:59:40,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809422352] [2023-12-16 15:59:40,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:59:40,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 15:59:40,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:59:40,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 15:59:40,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2023-12-16 15:59:40,321 INFO L87 Difference]: Start difference. First operand 214 states and 279 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:59:40,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:59:40,458 INFO L93 Difference]: Finished difference Result 409 states and 528 transitions. [2023-12-16 15:59:40,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 15:59:40,459 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 74 [2023-12-16 15:59:40,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:59:40,460 INFO L225 Difference]: With dead ends: 409 [2023-12-16 15:59:40,460 INFO L226 Difference]: Without dead ends: 208 [2023-12-16 15:59:40,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2023-12-16 15:59:40,461 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 90 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 15:59:40,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 246 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 15:59:40,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2023-12-16 15:59:40,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 206. [2023-12-16 15:59:40,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 174 states have (on average 1.2471264367816093) internal successors, (217), 177 states have internal predecessors, (217), 24 states have call successors, (24), 7 states have call predecessors, (24), 7 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-16 15:59:40,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 265 transitions. [2023-12-16 15:59:40,469 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 265 transitions. Word has length 74 [2023-12-16 15:59:40,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:59:40,469 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 265 transitions. [2023-12-16 15:59:40,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:59:40,469 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 265 transitions. [2023-12-16 15:59:40,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-16 15:59:40,470 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:59:40,470 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:59:40,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-16 15:59:40,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:59:40,679 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:59:40,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:59:40,680 INFO L85 PathProgramCache]: Analyzing trace with hash 35438682, now seen corresponding path program 1 times [2023-12-16 15:59:40,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:59:40,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [831960896] [2023-12-16 15:59:40,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:59:40,680 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:59:40,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:59:40,681 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 15:59:40,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-16 15:59:40,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:59:40,759 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 15:59:40,760 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:59:40,770 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-16 15:59:40,770 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:59:40,770 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:59:40,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [831960896] [2023-12-16 15:59:40,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [831960896] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:59:40,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:59:40,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 15:59:40,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244166057] [2023-12-16 15:59:40,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:59:40,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 15:59:40,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:59:40,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 15:59:40,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 15:59:40,771 INFO L87 Difference]: Start difference. First operand 206 states and 265 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:59:40,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:59:40,808 INFO L93 Difference]: Finished difference Result 447 states and 577 transitions. [2023-12-16 15:59:40,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 15:59:40,809 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 74 [2023-12-16 15:59:40,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:59:40,810 INFO L225 Difference]: With dead ends: 447 [2023-12-16 15:59:40,810 INFO L226 Difference]: Without dead ends: 254 [2023-12-16 15:59:40,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-16 15:59:40,811 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 60 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 15:59:40,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 315 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 15:59:40,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2023-12-16 15:59:40,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 215. [2023-12-16 15:59:40,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 183 states have (on average 1.2349726775956285) internal successors, (226), 186 states have internal predecessors, (226), 24 states have call successors, (24), 7 states have call predecessors, (24), 7 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-16 15:59:40,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 274 transitions. [2023-12-16 15:59:40,819 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 274 transitions. Word has length 74 [2023-12-16 15:59:40,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:59:40,820 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 274 transitions. [2023-12-16 15:59:40,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:59:40,820 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 274 transitions. [2023-12-16 15:59:40,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-16 15:59:40,820 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:59:40,821 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:59:40,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-12-16 15:59:41,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:59:41,024 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:59:41,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:59:41,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1164004309, now seen corresponding path program 1 times [2023-12-16 15:59:41,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:59:41,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [521439882] [2023-12-16 15:59:41,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:59:41,025 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:59:41,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:59:41,026 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 15:59:41,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-16 15:59:41,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:59:41,116 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-16 15:59:41,119 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:59:41,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-16 15:59:41,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2023-12-16 15:59:41,250 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:59:41,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2023-12-16 15:59:41,370 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:59:41,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 41 [2023-12-16 15:59:41,485 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:59:41,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 41 [2023-12-16 15:59:41,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 69 [2023-12-16 15:59:41,575 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:59:41,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 82 treesize of output 90 [2023-12-16 15:59:41,662 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:59:41,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 97 treesize of output 111 [2023-12-16 15:59:41,829 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:59:41,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 112 treesize of output 114 [2023-12-16 15:59:41,899 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:59:41,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 103 treesize of output 39 [2023-12-16 15:59:41,926 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 65 proven. 18 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-12-16 15:59:41,926 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 15:59:42,032 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-16 15:59:42,032 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:59:42,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [521439882] [2023-12-16 15:59:42,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [521439882] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 15:59:42,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 15:59:42,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2023-12-16 15:59:42,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560363499] [2023-12-16 15:59:42,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:59:42,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 15:59:42,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:59:42,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 15:59:42,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2023-12-16 15:59:42,034 INFO L87 Difference]: Start difference. First operand 215 states and 274 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:59:42,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:59:42,162 INFO L93 Difference]: Finished difference Result 412 states and 521 transitions. [2023-12-16 15:59:42,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 15:59:42,167 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 74 [2023-12-16 15:59:42,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:59:42,171 INFO L225 Difference]: With dead ends: 412 [2023-12-16 15:59:42,171 INFO L226 Difference]: Without dead ends: 210 [2023-12-16 15:59:42,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2023-12-16 15:59:42,172 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 107 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 15:59:42,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 196 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 15:59:42,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2023-12-16 15:59:42,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 208. [2023-12-16 15:59:42,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 176 states have (on average 1.2272727272727273) internal successors, (216), 179 states have internal predecessors, (216), 24 states have call successors, (24), 7 states have call predecessors, (24), 7 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-16 15:59:42,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 264 transitions. [2023-12-16 15:59:42,180 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 264 transitions. Word has length 74 [2023-12-16 15:59:42,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:59:42,180 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 264 transitions. [2023-12-16 15:59:42,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:59:42,181 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 264 transitions. [2023-12-16 15:59:42,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-16 15:59:42,182 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:59:42,182 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:59:42,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-12-16 15:59:42,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:59:42,386 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:59:42,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:59:42,386 INFO L85 PathProgramCache]: Analyzing trace with hash -748214023, now seen corresponding path program 1 times [2023-12-16 15:59:42,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:59:42,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [505597293] [2023-12-16 15:59:42,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:59:42,387 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:59:42,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:59:42,388 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 15:59:42,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-16 15:59:42,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:59:42,482 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-16 15:59:42,483 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:59:42,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-16 15:59:42,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2023-12-16 15:59:42,524 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:59:42,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 50 [2023-12-16 15:59:42,630 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:59:42,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 27 [2023-12-16 15:59:42,702 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-16 15:59:42,702 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:59:42,702 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:59:42,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [505597293] [2023-12-16 15:59:42,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [505597293] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:59:42,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:59:42,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-16 15:59:42,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731484095] [2023-12-16 15:59:42,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:59:42,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-16 15:59:42,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:59:42,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-16 15:59:42,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-12-16 15:59:42,703 INFO L87 Difference]: Start difference. First operand 208 states and 264 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:59:43,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:59:43,421 INFO L93 Difference]: Finished difference Result 436 states and 551 transitions. [2023-12-16 15:59:43,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-16 15:59:43,422 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 75 [2023-12-16 15:59:43,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:59:43,423 INFO L225 Difference]: With dead ends: 436 [2023-12-16 15:59:43,423 INFO L226 Difference]: Without dead ends: 241 [2023-12-16 15:59:43,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2023-12-16 15:59:43,423 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 250 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 15:59:43,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 640 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 15:59:43,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2023-12-16 15:59:43,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 212. [2023-12-16 15:59:43,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 180 states have (on average 1.2222222222222223) internal successors, (220), 183 states have internal predecessors, (220), 24 states have call successors, (24), 7 states have call predecessors, (24), 7 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-16 15:59:43,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 268 transitions. [2023-12-16 15:59:43,435 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 268 transitions. Word has length 75 [2023-12-16 15:59:43,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:59:43,435 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 268 transitions. [2023-12-16 15:59:43,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:59:43,436 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 268 transitions. [2023-12-16 15:59:43,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-16 15:59:43,436 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:59:43,436 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:59:43,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-12-16 15:59:43,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:59:43,640 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:59:43,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:59:43,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1759331273, now seen corresponding path program 1 times [2023-12-16 15:59:43,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:59:43,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1410655715] [2023-12-16 15:59:43,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:59:43,641 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:59:43,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:59:43,643 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 15:59:43,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-16 15:59:43,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:59:43,731 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-16 15:59:43,733 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:59:43,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-16 15:59:43,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-12-16 15:59:43,757 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:59:43,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 33 [2023-12-16 15:59:43,801 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:59:43,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 13 [2023-12-16 15:59:43,813 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-16 15:59:43,813 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:59:43,813 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:59:43,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1410655715] [2023-12-16 15:59:43,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1410655715] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:59:43,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:59:43,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 15:59:43,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454889846] [2023-12-16 15:59:43,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:59:43,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 15:59:43,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:59:43,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 15:59:43,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 15:59:43,815 INFO L87 Difference]: Start difference. First operand 212 states and 268 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:59:44,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:59:44,263 INFO L93 Difference]: Finished difference Result 444 states and 557 transitions. [2023-12-16 15:59:44,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 15:59:44,263 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 75 [2023-12-16 15:59:44,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:59:44,264 INFO L225 Difference]: With dead ends: 444 [2023-12-16 15:59:44,264 INFO L226 Difference]: Without dead ends: 245 [2023-12-16 15:59:44,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-16 15:59:44,265 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 114 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 15:59:44,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 369 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 15:59:44,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2023-12-16 15:59:44,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 210. [2023-12-16 15:59:44,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 177 states have (on average 1.2146892655367232) internal successors, (215), 180 states have internal predecessors, (215), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-16 15:59:44,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 263 transitions. [2023-12-16 15:59:44,273 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 263 transitions. Word has length 75 [2023-12-16 15:59:44,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:59:44,273 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 263 transitions. [2023-12-16 15:59:44,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:59:44,274 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 263 transitions. [2023-12-16 15:59:44,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-16 15:59:44,274 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:59:44,274 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:59:44,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-12-16 15:59:44,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:59:44,475 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:59:44,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:59:44,475 INFO L85 PathProgramCache]: Analyzing trace with hash -529359305, now seen corresponding path program 1 times [2023-12-16 15:59:44,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:59:44,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1024818293] [2023-12-16 15:59:44,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:59:44,475 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:59:44,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:59:44,476 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 15:59:44,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-12-16 15:59:44,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:59:44,569 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-16 15:59:44,571 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:59:44,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-16 15:59:44,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2023-12-16 15:59:44,598 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:59:44,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2023-12-16 15:59:44,635 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:59:44,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 14 [2023-12-16 15:59:44,651 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-16 15:59:44,651 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:59:44,651 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:59:44,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1024818293] [2023-12-16 15:59:44,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1024818293] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:59:44,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:59:44,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 15:59:44,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498982806] [2023-12-16 15:59:44,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:59:44,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 15:59:44,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:59:44,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 15:59:44,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 15:59:44,652 INFO L87 Difference]: Start difference. First operand 210 states and 263 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:59:45,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:59:45,190 INFO L93 Difference]: Finished difference Result 410 states and 509 transitions. [2023-12-16 15:59:45,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 15:59:45,191 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 75 [2023-12-16 15:59:45,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:59:45,192 INFO L225 Difference]: With dead ends: 410 [2023-12-16 15:59:45,192 INFO L226 Difference]: Without dead ends: 217 [2023-12-16 15:59:45,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-16 15:59:45,192 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 82 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 15:59:45,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 336 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 15:59:45,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2023-12-16 15:59:45,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 178. [2023-12-16 15:59:45,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 147 states have (on average 1.183673469387755) internal successors, (174), 149 states have internal predecessors, (174), 22 states have call successors, (22), 8 states have call predecessors, (22), 8 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-16 15:59:45,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 218 transitions. [2023-12-16 15:59:45,200 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 218 transitions. Word has length 75 [2023-12-16 15:59:45,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:59:45,200 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 218 transitions. [2023-12-16 15:59:45,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:59:45,200 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 218 transitions. [2023-12-16 15:59:45,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-16 15:59:45,200 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:59:45,201 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:59:45,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-12-16 15:59:45,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:59:45,404 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:59:45,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:59:45,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1540476555, now seen corresponding path program 1 times [2023-12-16 15:59:45,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:59:45,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1504346623] [2023-12-16 15:59:45,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:59:45,405 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:59:45,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:59:45,406 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 15:59:45,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-12-16 15:59:45,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:59:45,501 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-16 15:59:45,503 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:59:45,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-16 15:59:45,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2023-12-16 15:59:45,546 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:59:45,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 50 [2023-12-16 15:59:45,642 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:59:45,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 26 [2023-12-16 15:59:45,706 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-16 15:59:45,706 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:59:45,706 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:59:45,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1504346623] [2023-12-16 15:59:45,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1504346623] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:59:45,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:59:45,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-16 15:59:45,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378656423] [2023-12-16 15:59:45,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:59:45,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-16 15:59:45,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:59:45,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-16 15:59:45,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-12-16 15:59:45,707 INFO L87 Difference]: Start difference. First operand 178 states and 218 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:59:46,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:59:46,326 INFO L93 Difference]: Finished difference Result 376 states and 461 transitions. [2023-12-16 15:59:46,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-16 15:59:46,327 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 75 [2023-12-16 15:59:46,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:59:46,328 INFO L225 Difference]: With dead ends: 376 [2023-12-16 15:59:46,328 INFO L226 Difference]: Without dead ends: 215 [2023-12-16 15:59:46,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2023-12-16 15:59:46,329 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 182 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 15:59:46,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 685 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 15:59:46,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2023-12-16 15:59:46,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 172. [2023-12-16 15:59:46,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 141 states have (on average 1.1843971631205674) internal successors, (167), 143 states have internal predecessors, (167), 22 states have call successors, (22), 8 states have call predecessors, (22), 8 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-16 15:59:46,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 211 transitions. [2023-12-16 15:59:46,338 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 211 transitions. Word has length 75 [2023-12-16 15:59:46,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:59:46,338 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 211 transitions. [2023-12-16 15:59:46,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:59:46,339 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 211 transitions. [2023-12-16 15:59:46,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-12-16 15:59:46,340 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:59:46,340 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:59:46,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-12-16 15:59:46,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:59:46,544 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:59:46,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:59:46,544 INFO L85 PathProgramCache]: Analyzing trace with hash 4851948, now seen corresponding path program 1 times [2023-12-16 15:59:46,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:59:46,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [585070633] [2023-12-16 15:59:46,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:59:46,545 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:59:46,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:59:46,546 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 15:59:46,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-12-16 15:59:46,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:59:46,638 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 15:59:46,640 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:59:46,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-12-16 15:59:46,718 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-16 15:59:46,718 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:59:46,718 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:59:46,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [585070633] [2023-12-16 15:59:46,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [585070633] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:59:46,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:59:46,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 15:59:46,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998972235] [2023-12-16 15:59:46,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:59:46,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 15:59:46,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:59:46,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 15:59:46,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 15:59:46,719 INFO L87 Difference]: Start difference. First operand 172 states and 211 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:59:47,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:59:47,851 INFO L93 Difference]: Finished difference Result 361 states and 444 transitions. [2023-12-16 15:59:47,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 15:59:47,851 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 76 [2023-12-16 15:59:47,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:59:47,852 INFO L225 Difference]: With dead ends: 361 [2023-12-16 15:59:47,852 INFO L226 Difference]: Without dead ends: 206 [2023-12-16 15:59:47,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-16 15:59:47,853 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 142 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-16 15:59:47,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 220 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-16 15:59:47,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2023-12-16 15:59:47,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 172. [2023-12-16 15:59:47,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 141 states have (on average 1.177304964539007) internal successors, (166), 143 states have internal predecessors, (166), 22 states have call successors, (22), 8 states have call predecessors, (22), 8 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-16 15:59:47,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 210 transitions. [2023-12-16 15:59:47,860 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 210 transitions. Word has length 76 [2023-12-16 15:59:47,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:59:47,860 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 210 transitions. [2023-12-16 15:59:47,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:59:47,861 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 210 transitions. [2023-12-16 15:59:47,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-12-16 15:59:47,861 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:59:47,861 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:59:47,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-12-16 15:59:48,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:59:48,064 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:59:48,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:59:48,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1451267443, now seen corresponding path program 1 times [2023-12-16 15:59:48,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:59:48,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1319905455] [2023-12-16 15:59:48,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:59:48,065 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:59:48,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:59:48,066 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 15:59:48,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-12-16 15:59:48,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:59:48,179 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-16 15:59:48,190 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:59:48,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-16 15:59:48,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 29 [2023-12-16 15:59:48,207 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:59:48,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 45 [2023-12-16 15:59:48,233 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:59:48,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 55 treesize of output 66 [2023-12-16 15:59:48,295 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:59:48,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 70 treesize of output 69 [2023-12-16 15:59:48,507 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:59:48,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 96 treesize of output 38 [2023-12-16 15:59:48,523 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-16 15:59:48,523 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:59:48,523 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:59:48,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1319905455] [2023-12-16 15:59:48,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1319905455] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:59:48,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:59:48,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 15:59:48,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140214386] [2023-12-16 15:59:48,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:59:48,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 15:59:48,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:59:48,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 15:59:48,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-16 15:59:48,529 INFO L87 Difference]: Start difference. First operand 172 states and 210 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:59:49,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:59:49,146 INFO L93 Difference]: Finished difference Result 202 states and 246 transitions. [2023-12-16 15:59:49,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 15:59:49,147 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 76 [2023-12-16 15:59:49,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:59:49,147 INFO L225 Difference]: With dead ends: 202 [2023-12-16 15:59:49,147 INFO L226 Difference]: Without dead ends: 200 [2023-12-16 15:59:49,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-12-16 15:59:49,148 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 191 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 15:59:49,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 303 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 15:59:49,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2023-12-16 15:59:49,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 176. [2023-12-16 15:59:49,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 145 states have (on average 1.1724137931034482) internal successors, (170), 147 states have internal predecessors, (170), 22 states have call successors, (22), 8 states have call predecessors, (22), 8 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-16 15:59:49,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 214 transitions. [2023-12-16 15:59:49,155 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 214 transitions. Word has length 76 [2023-12-16 15:59:49,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:59:49,155 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 214 transitions. [2023-12-16 15:59:49,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:59:49,155 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 214 transitions. [2023-12-16 15:59:49,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-12-16 15:59:49,156 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:59:49,156 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:59:49,160 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 (18)] Ended with exit code 0 [2023-12-16 15:59:49,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:59:49,360 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:59:49,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:59:49,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1451327025, now seen corresponding path program 1 times [2023-12-16 15:59:49,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:59:49,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [610556609] [2023-12-16 15:59:49,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:59:49,360 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:59:49,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:59:49,361 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 15:59:49,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-12-16 15:59:49,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:59:49,459 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-16 15:59:49,461 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:59:49,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-16 15:59:49,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2023-12-16 15:59:49,479 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:59:49,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 22 [2023-12-16 15:59:49,520 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-16 15:59:49,520 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:59:49,521 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:59:49,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [610556609] [2023-12-16 15:59:49,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [610556609] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:59:49,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:59:49,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 15:59:49,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24924224] [2023-12-16 15:59:49,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:59:49,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 15:59:49,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:59:49,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 15:59:49,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 15:59:49,522 INFO L87 Difference]: Start difference. First operand 176 states and 214 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:59:49,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:59:49,681 INFO L93 Difference]: Finished difference Result 323 states and 394 transitions. [2023-12-16 15:59:49,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 15:59:49,681 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 76 [2023-12-16 15:59:49,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:59:49,682 INFO L225 Difference]: With dead ends: 323 [2023-12-16 15:59:49,682 INFO L226 Difference]: Without dead ends: 176 [2023-12-16 15:59:49,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-16 15:59:49,683 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 53 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 15:59:49,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 247 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 15:59:49,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2023-12-16 15:59:49,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2023-12-16 15:59:49,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 145 states have (on average 1.1586206896551725) internal successors, (168), 147 states have internal predecessors, (168), 22 states have call successors, (22), 8 states have call predecessors, (22), 8 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-16 15:59:49,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 212 transitions. [2023-12-16 15:59:49,690 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 212 transitions. Word has length 76 [2023-12-16 15:59:49,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:59:49,690 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 212 transitions. [2023-12-16 15:59:49,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:59:49,690 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 212 transitions. [2023-12-16 15:59:49,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-12-16 15:59:49,691 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:59:49,691 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:59:49,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-12-16 15:59:49,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:59:49,894 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:59:49,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:59:49,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1508585327, now seen corresponding path program 1 times [2023-12-16 15:59:49,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:59:49,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [805676589] [2023-12-16 15:59:49,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:59:49,895 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:59:49,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:59:49,895 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 15:59:49,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-12-16 15:59:49,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:59:49,994 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-16 15:59:49,997 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:59:50,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-16 15:59:50,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-12-16 15:59:50,048 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:59:50,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 41 [2023-12-16 15:59:50,075 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:59:50,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 57 [2023-12-16 15:59:50,115 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:59:50,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 64 treesize of output 69 [2023-12-16 15:59:50,212 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:59:50,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 79 treesize of output 72 [2023-12-16 15:59:50,302 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:59:50,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 69 treesize of output 23 [2023-12-16 15:59:50,315 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 43 proven. 3 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-12-16 15:59:50,315 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 15:59:50,415 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:59:50,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [805676589] [2023-12-16 15:59:50,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [805676589] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 15:59:50,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [264941900] [2023-12-16 15:59:50,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:59:50,416 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-16 15:59:50,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-16 15:59:50,417 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-16 15:59:50,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2023-12-16 15:59:50,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:59:50,568 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-16 15:59:50,571 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:59:50,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-16 15:59:50,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-16 15:59:50,637 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:59:50,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 30 [2023-12-16 15:59:50,683 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:59:50,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 50 [2023-12-16 15:59:50,750 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:59:50,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 69 treesize of output 72 [2023-12-16 15:59:50,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:59:50,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 80 treesize of output 82 [2023-12-16 15:59:50,965 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:59:50,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 91 treesize of output 85 [2023-12-16 15:59:51,686 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-16 15:59:51,686 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:59:51,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [264941900] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:59:51,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 15:59:51,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 18 [2023-12-16 15:59:51,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498522996] [2023-12-16 15:59:51,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:59:51,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 15:59:51,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:59:51,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 15:59:51,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2023-12-16 15:59:51,688 INFO L87 Difference]: Start difference. First operand 176 states and 212 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:59:54,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:59:54,739 INFO L93 Difference]: Finished difference Result 434 states and 521 transitions. [2023-12-16 15:59:54,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-16 15:59:54,741 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 76 [2023-12-16 15:59:54,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:59:54,742 INFO L225 Difference]: With dead ends: 434 [2023-12-16 15:59:54,742 INFO L226 Difference]: Without dead ends: 287 [2023-12-16 15:59:54,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 158 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=140, Invalid=672, Unknown=0, NotChecked=0, Total=812 [2023-12-16 15:59:54,743 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 313 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-12-16 15:59:54,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 229 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-12-16 15:59:54,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2023-12-16 15:59:54,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 239. [2023-12-16 15:59:54,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 208 states have (on average 1.1682692307692308) internal successors, (243), 210 states have internal predecessors, (243), 22 states have call successors, (22), 8 states have call predecessors, (22), 8 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-16 15:59:54,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 287 transitions. [2023-12-16 15:59:54,758 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 287 transitions. Word has length 76 [2023-12-16 15:59:54,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:59:54,758 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 287 transitions. [2023-12-16 15:59:54,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:59:54,758 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 287 transitions. [2023-12-16 15:59:54,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-16 15:59:54,759 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:59:54,759 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:59:54,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-12-16 15:59:54,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Ended with exit code 0 [2023-12-16 15:59:55,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-16 15:59:55,162 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:59:55,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:59:55,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1674557519, now seen corresponding path program 1 times [2023-12-16 15:59:55,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:59:55,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1569739507] [2023-12-16 15:59:55,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:59:55,163 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:59:55,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:59:55,164 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 15:59:55,197 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 (22)] Waiting until timeout for monitored process [2023-12-16 15:59:55,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:59:55,277 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-16 15:59:55,279 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:59:55,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-16 15:59:55,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2023-12-16 15:59:55,329 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:59:55,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 30 [2023-12-16 15:59:55,358 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-16 15:59:55,358 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:59:55,358 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:59:55,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1569739507] [2023-12-16 15:59:55,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1569739507] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:59:55,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:59:55,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 15:59:55,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089328565] [2023-12-16 15:59:55,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:59:55,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 15:59:55,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:59:55,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 15:59:55,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-16 15:59:55,359 INFO L87 Difference]: Start difference. First operand 239 states and 287 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:59:55,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:59:55,783 INFO L93 Difference]: Finished difference Result 659 states and 799 transitions. [2023-12-16 15:59:55,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-16 15:59:55,784 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 78 [2023-12-16 15:59:55,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:59:55,785 INFO L225 Difference]: With dead ends: 659 [2023-12-16 15:59:55,785 INFO L226 Difference]: Without dead ends: 449 [2023-12-16 15:59:55,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=160, Invalid=392, Unknown=0, NotChecked=0, Total=552 [2023-12-16 15:59:55,786 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 249 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 15:59:55,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 449 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 15:59:55,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2023-12-16 15:59:55,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 312. [2023-12-16 15:59:55,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 275 states have (on average 1.1636363636363636) internal successors, (320), 278 states have internal predecessors, (320), 26 states have call successors, (26), 10 states have call predecessors, (26), 10 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-16 15:59:55,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 372 transitions. [2023-12-16 15:59:55,799 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 372 transitions. Word has length 78 [2023-12-16 15:59:55,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:59:55,799 INFO L495 AbstractCegarLoop]: Abstraction has 312 states and 372 transitions. [2023-12-16 15:59:55,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:59:55,799 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 372 transitions. [2023-12-16 15:59:55,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-16 15:59:55,800 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:59:55,800 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:59:55,803 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 (22)] Forceful destruction successful, exit code 0 [2023-12-16 15:59:56,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:59:56,004 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:59:56,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:59:56,004 INFO L85 PathProgramCache]: Analyzing trace with hash 592555050, now seen corresponding path program 1 times [2023-12-16 15:59:56,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:59:56,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1892165161] [2023-12-16 15:59:56,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:59:56,004 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:59:56,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:59:56,005 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 15:59:56,006 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 (23)] Waiting until timeout for monitored process [2023-12-16 15:59:56,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:59:56,106 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-16 15:59:56,108 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:59:56,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-16 15:59:56,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-12-16 15:59:56,158 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:59:56,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 41 [2023-12-16 15:59:56,186 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:59:56,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 57 [2023-12-16 15:59:56,224 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:59:56,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 64 treesize of output 69 [2023-12-16 15:59:56,305 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:59:56,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 79 treesize of output 72 [2023-12-16 15:59:56,392 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:59:56,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 69 treesize of output 23 [2023-12-16 15:59:56,404 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 43 proven. 3 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-12-16 15:59:56,404 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 15:59:56,505 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:59:56,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1892165161] [2023-12-16 15:59:56,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1892165161] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 15:59:56,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2032496408] [2023-12-16 15:59:56,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:59:56,506 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-16 15:59:56,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-16 15:59:56,507 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-16 15:59:56,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2023-12-16 15:59:56,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:59:56,697 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-16 15:59:56,700 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:59:56,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-16 15:59:56,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-16 15:59:56,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-12-16 15:59:56,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-12-16 15:59:56,980 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:59:56,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 26 [2023-12-16 15:59:57,023 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:59:57,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 50 [2023-12-16 15:59:57,086 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:59:57,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 53 treesize of output 64 [2023-12-16 15:59:57,153 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:59:57,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 64 treesize of output 81 [2023-12-16 15:59:57,267 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:59:57,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 75 treesize of output 84 [2023-12-16 15:59:57,495 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:59:57,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 68 treesize of output 32 [2023-12-16 15:59:57,556 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-12-16 15:59:57,556 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:59:57,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2032496408] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:59:57,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 15:59:57,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 19 [2023-12-16 15:59:57,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117346096] [2023-12-16 15:59:57,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:59:57,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-16 15:59:57,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:59:57,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-16 15:59:57,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2023-12-16 15:59:57,557 INFO L87 Difference]: Start difference. First operand 312 states and 372 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 10 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-16 15:59:59,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:59:59,759 INFO L93 Difference]: Finished difference Result 1023 states and 1211 transitions. [2023-12-16 15:59:59,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-16 15:59:59,760 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 10 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 78 [2023-12-16 15:59:59,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:59:59,762 INFO L225 Difference]: With dead ends: 1023 [2023-12-16 15:59:59,762 INFO L226 Difference]: Without dead ends: 744 [2023-12-16 15:59:59,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=230, Invalid=1102, Unknown=0, NotChecked=0, Total=1332 [2023-12-16 15:59:59,763 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 388 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-16 15:59:59,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 363 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-16 15:59:59,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2023-12-16 15:59:59,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 626. [2023-12-16 15:59:59,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 567 states have (on average 1.164021164021164) internal successors, (660), 572 states have internal predecessors, (660), 42 states have call successors, (42), 16 states have call predecessors, (42), 16 states have return successors, (42), 37 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-16 15:59:59,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 744 transitions. [2023-12-16 15:59:59,787 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 744 transitions. Word has length 78 [2023-12-16 15:59:59,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:59:59,787 INFO L495 AbstractCegarLoop]: Abstraction has 626 states and 744 transitions. [2023-12-16 15:59:59,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 10 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-16 15:59:59,787 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 744 transitions. [2023-12-16 15:59:59,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-16 15:59:59,788 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:59:59,788 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:59:59,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Forceful destruction successful, exit code 0 [2023-12-16 15:59:59,994 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 (23)] Ended with exit code 0 [2023-12-16 16:00:00,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:00:00,191 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:00:00,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:00:00,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1455702801, now seen corresponding path program 1 times [2023-12-16 16:00:00,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:00:00,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [130865874] [2023-12-16 16:00:00,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:00:00,192 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:00:00,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:00:00,193 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:00:00,193 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 (25)] Waiting until timeout for monitored process [2023-12-16 16:00:00,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:00:00,288 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-16 16:00:00,289 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:00:00,376 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:00:00,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 19 [2023-12-16 16:00:00,397 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-16 16:00:00,397 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:00:00,397 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:00:00,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [130865874] [2023-12-16 16:00:00,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [130865874] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:00:00,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:00:00,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 16:00:00,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789126401] [2023-12-16 16:00:00,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:00:00,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 16:00:00,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:00:00,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 16:00:00,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-16 16:00:00,398 INFO L87 Difference]: Start difference. First operand 626 states and 744 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 16:00:00,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:00:00,706 INFO L93 Difference]: Finished difference Result 1252 states and 1485 transitions. [2023-12-16 16:00:00,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 16:00:00,708 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 78 [2023-12-16 16:00:00,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:00:00,710 INFO L225 Difference]: With dead ends: 1252 [2023-12-16 16:00:00,710 INFO L226 Difference]: Without dead ends: 659 [2023-12-16 16:00:00,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-12-16 16:00:00,711 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 91 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 16:00:00,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 361 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 16:00:00,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2023-12-16 16:00:00,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 475. [2023-12-16 16:00:00,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 433 states have (on average 1.161662817551963) internal successors, (503), 435 states have internal predecessors, (503), 28 states have call successors, (28), 13 states have call predecessors, (28), 13 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-16 16:00:00,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 559 transitions. [2023-12-16 16:00:00,729 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 559 transitions. Word has length 78 [2023-12-16 16:00:00,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:00:00,729 INFO L495 AbstractCegarLoop]: Abstraction has 475 states and 559 transitions. [2023-12-16 16:00:00,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 16:00:00,729 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 559 transitions. [2023-12-16 16:00:00,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-16 16:00:00,730 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:00:00,730 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:00:00,733 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 (25)] Ended with exit code 0 [2023-12-16 16:00:00,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:00:00,933 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:00:00,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:00:00,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1197866791, now seen corresponding path program 1 times [2023-12-16 16:00:00,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:00:00,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1579771119] [2023-12-16 16:00:00,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:00:00,934 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:00:00,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:00:00,935 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:00:00,939 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 (26)] Waiting until timeout for monitored process [2023-12-16 16:00:01,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:00:01,026 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-16 16:00:01,028 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:00:01,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-12-16 16:00:01,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-16 16:00:01,114 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-16 16:00:01,115 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:00:01,115 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:00:01,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1579771119] [2023-12-16 16:00:01,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1579771119] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:00:01,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:00:01,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 16:00:01,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063723177] [2023-12-16 16:00:01,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:00:01,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 16:00:01,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:00:01,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 16:00:01,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 16:00:01,116 INFO L87 Difference]: Start difference. First operand 475 states and 559 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 16:00:01,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:00:01,479 INFO L93 Difference]: Finished difference Result 905 states and 1064 transitions. [2023-12-16 16:00:01,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 16:00:01,479 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 78 [2023-12-16 16:00:01,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:00:01,481 INFO L225 Difference]: With dead ends: 905 [2023-12-16 16:00:01,481 INFO L226 Difference]: Without dead ends: 463 [2023-12-16 16:00:01,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-12-16 16:00:01,482 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 123 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 16:00:01,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 313 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 16:00:01,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2023-12-16 16:00:01,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 424. [2023-12-16 16:00:01,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 382 states have (on average 1.1544502617801047) internal successors, (441), 384 states have internal predecessors, (441), 28 states have call successors, (28), 13 states have call predecessors, (28), 13 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-16 16:00:01,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 497 transitions. [2023-12-16 16:00:01,499 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 497 transitions. Word has length 78 [2023-12-16 16:00:01,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:00:01,500 INFO L495 AbstractCegarLoop]: Abstraction has 424 states and 497 transitions. [2023-12-16 16:00:01,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 16:00:01,500 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 497 transitions. [2023-12-16 16:00:01,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-12-16 16:00:01,504 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:00:01,504 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:00:01,509 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 (26)] Forceful destruction successful, exit code 0 [2023-12-16 16:00:01,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:00:01,707 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:00:01,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:00:01,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1245343522, now seen corresponding path program 1 times [2023-12-16 16:00:01,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:00:01,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1906695311] [2023-12-16 16:00:01,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:00:01,708 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:00:01,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:00:01,709 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:00:01,712 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 (27)] Waiting until timeout for monitored process [2023-12-16 16:00:01,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:00:01,818 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-16 16:00:01,823 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:00:01,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-16 16:00:01,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-12-16 16:00:01,876 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:00:01,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 41 [2023-12-16 16:00:01,905 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:00:01,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 57 [2023-12-16 16:00:01,945 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:00:01,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 64 treesize of output 69 [2023-12-16 16:00:02,026 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:00:02,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 79 treesize of output 72 [2023-12-16 16:00:02,159 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:00:02,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 69 treesize of output 23 [2023-12-16 16:00:02,173 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 43 proven. 3 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-12-16 16:00:02,173 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:00:02,281 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:00:02,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1906695311] [2023-12-16 16:00:02,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1906695311] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 16:00:02,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2021267772] [2023-12-16 16:00:02,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:00:02,281 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-16 16:00:02,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-16 16:00:02,282 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-16 16:00:02,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2023-12-16 16:00:02,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:00:02,456 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-16 16:00:02,459 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:00:02,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-12-16 16:00:02,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-12-16 16:00:02,597 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:00:02,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 34 [2023-12-16 16:00:02,660 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:00:02,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 55 [2023-12-16 16:00:02,739 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:00:02,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 71 treesize of output 78 [2023-12-16 16:00:02,841 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:00:02,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 82 treesize of output 88 [2023-12-16 16:00:03,051 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:00:03,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 93 treesize of output 91 [2023-12-16 16:00:03,376 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:00:03,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 134 treesize of output 74 [2023-12-16 16:00:03,473 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-12-16 16:00:03,473 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:00:03,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2021267772] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:00:03,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 16:00:03,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 20 [2023-12-16 16:00:03,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382624280] [2023-12-16 16:00:03,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:00:03,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 16:00:03,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:00:03,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 16:00:03,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2023-12-16 16:00:03,475 INFO L87 Difference]: Start difference. First operand 424 states and 497 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 11 states have internal predecessors, (45), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-16 16:00:06,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:00:06,914 INFO L93 Difference]: Finished difference Result 963 states and 1126 transitions. [2023-12-16 16:00:06,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-16 16:00:06,916 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 11 states have internal predecessors, (45), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 79 [2023-12-16 16:00:06,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:00:06,917 INFO L225 Difference]: With dead ends: 963 [2023-12-16 16:00:06,918 INFO L226 Difference]: Without dead ends: 572 [2023-12-16 16:00:06,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 165 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=254, Invalid=1078, Unknown=0, NotChecked=0, Total=1332 [2023-12-16 16:00:06,919 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 318 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-12-16 16:00:06,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 286 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-12-16 16:00:06,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2023-12-16 16:00:06,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 429. [2023-12-16 16:00:06,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 387 states have (on average 1.1576227390180878) internal successors, (448), 389 states have internal predecessors, (448), 28 states have call successors, (28), 13 states have call predecessors, (28), 13 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-16 16:00:06,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 504 transitions. [2023-12-16 16:00:06,943 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 504 transitions. Word has length 79 [2023-12-16 16:00:06,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:00:06,943 INFO L495 AbstractCegarLoop]: Abstraction has 429 states and 504 transitions. [2023-12-16 16:00:06,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 11 states have internal predecessors, (45), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-16 16:00:06,943 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 504 transitions. [2023-12-16 16:00:06,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-12-16 16:00:06,944 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:00:06,944 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:00:06,948 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 (27)] Ended with exit code 0 [2023-12-16 16:00:07,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Forceful destruction successful, exit code 0 [2023-12-16 16:00:07,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-16 16:00:07,347 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:00:07,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:00:07,348 INFO L85 PathProgramCache]: Analyzing trace with hash 318973285, now seen corresponding path program 1 times [2023-12-16 16:00:07,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:00:07,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [894510669] [2023-12-16 16:00:07,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:00:07,348 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:00:07,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:00:07,349 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:00:07,353 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 (29)] Waiting until timeout for monitored process [2023-12-16 16:00:07,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:00:07,444 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 16:00:07,445 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:00:07,484 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-16 16:00:07,484 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:00:07,484 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:00:07,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [894510669] [2023-12-16 16:00:07,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [894510669] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:00:07,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:00:07,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 16:00:07,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829194304] [2023-12-16 16:00:07,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:00:07,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 16:00:07,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:00:07,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 16:00:07,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 16:00:07,485 INFO L87 Difference]: Start difference. First operand 429 states and 504 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 16:00:07,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:00:07,692 INFO L93 Difference]: Finished difference Result 913 states and 1072 transitions. [2023-12-16 16:00:07,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 16:00:07,692 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 81 [2023-12-16 16:00:07,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:00:07,694 INFO L225 Difference]: With dead ends: 913 [2023-12-16 16:00:07,694 INFO L226 Difference]: Without dead ends: 517 [2023-12-16 16:00:07,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 16:00:07,694 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 48 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 16:00:07,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 300 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 16:00:07,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2023-12-16 16:00:07,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 401. [2023-12-16 16:00:07,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 359 states have (on average 1.1364902506963788) internal successors, (408), 361 states have internal predecessors, (408), 28 states have call successors, (28), 13 states have call predecessors, (28), 13 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-16 16:00:07,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 464 transitions. [2023-12-16 16:00:07,730 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 464 transitions. Word has length 81 [2023-12-16 16:00:07,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:00:07,730 INFO L495 AbstractCegarLoop]: Abstraction has 401 states and 464 transitions. [2023-12-16 16:00:07,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 16:00:07,731 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 464 transitions. [2023-12-16 16:00:07,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-12-16 16:00:07,731 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:00:07,731 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:00:07,735 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 (29)] Forceful destruction successful, exit code 0 [2023-12-16 16:00:07,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:00:07,935 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:00:07,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:00:07,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1761652280, now seen corresponding path program 1 times [2023-12-16 16:00:07,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:00:07,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [361055312] [2023-12-16 16:00:07,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:00:07,936 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:00:07,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:00:07,940 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:00:07,941 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 (30)] Waiting until timeout for monitored process [2023-12-16 16:00:08,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:00:08,037 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 16:00:08,039 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:00:08,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-12-16 16:00:08,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-16 16:00:08,142 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-16 16:00:08,142 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:00:08,142 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:00:08,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [361055312] [2023-12-16 16:00:08,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [361055312] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:00:08,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:00:08,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 16:00:08,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295798674] [2023-12-16 16:00:08,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:00:08,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 16:00:08,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:00:08,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 16:00:08,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 16:00:08,143 INFO L87 Difference]: Start difference. First operand 401 states and 464 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 16:00:08,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:00:08,507 INFO L93 Difference]: Finished difference Result 797 states and 920 transitions. [2023-12-16 16:00:08,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 16:00:08,508 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 81 [2023-12-16 16:00:08,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:00:08,509 INFO L225 Difference]: With dead ends: 797 [2023-12-16 16:00:08,509 INFO L226 Difference]: Without dead ends: 429 [2023-12-16 16:00:08,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2023-12-16 16:00:08,510 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 85 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 16:00:08,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 273 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 16:00:08,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2023-12-16 16:00:08,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 407. [2023-12-16 16:00:08,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 365 states have (on average 1.1315068493150684) internal successors, (413), 367 states have internal predecessors, (413), 28 states have call successors, (28), 13 states have call predecessors, (28), 13 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-16 16:00:08,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 469 transitions. [2023-12-16 16:00:08,529 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 469 transitions. Word has length 81 [2023-12-16 16:00:08,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:00:08,529 INFO L495 AbstractCegarLoop]: Abstraction has 407 states and 469 transitions. [2023-12-16 16:00:08,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 16:00:08,529 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 469 transitions. [2023-12-16 16:00:08,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-12-16 16:00:08,530 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:00:08,530 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:00:08,536 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 (30)] Ended with exit code 0 [2023-12-16 16:00:08,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:00:08,734 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:00:08,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:00:08,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1430918075, now seen corresponding path program 1 times [2023-12-16 16:00:08,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:00:08,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [938006356] [2023-12-16 16:00:08,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:00:08,735 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:00:08,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:00:08,736 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:00:08,784 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 (31)] Waiting until timeout for monitored process [2023-12-16 16:00:08,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:00:08,933 INFO L262 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 16:00:08,935 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:00:08,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-16 16:00:08,971 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 497 trivial. 0 not checked. [2023-12-16 16:00:08,971 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:00:08,971 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:00:08,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [938006356] [2023-12-16 16:00:08,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [938006356] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:00:08,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:00:08,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 16:00:08,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840974136] [2023-12-16 16:00:08,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:00:08,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 16:00:08,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:00:08,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 16:00:08,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 16:00:08,973 INFO L87 Difference]: Start difference. First operand 407 states and 469 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 16:00:09,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:00:09,198 INFO L93 Difference]: Finished difference Result 555 states and 642 transitions. [2023-12-16 16:00:09,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 16:00:09,199 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 153 [2023-12-16 16:00:09,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:00:09,200 INFO L225 Difference]: With dead ends: 555 [2023-12-16 16:00:09,200 INFO L226 Difference]: Without dead ends: 345 [2023-12-16 16:00:09,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 16:00:09,201 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 8 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 16:00:09,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 174 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 16:00:09,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2023-12-16 16:00:09,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 345. [2023-12-16 16:00:09,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 303 states have (on average 1.1155115511551155) internal successors, (338), 305 states have internal predecessors, (338), 28 states have call successors, (28), 13 states have call predecessors, (28), 13 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-16 16:00:09,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 394 transitions. [2023-12-16 16:00:09,218 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 394 transitions. Word has length 153 [2023-12-16 16:00:09,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:00:09,218 INFO L495 AbstractCegarLoop]: Abstraction has 345 states and 394 transitions. [2023-12-16 16:00:09,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 16:00:09,218 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 394 transitions. [2023-12-16 16:00:09,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-16 16:00:09,219 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:00:09,219 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:00:09,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2023-12-16 16:00:09,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:00:09,424 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:00:09,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:00:09,424 INFO L85 PathProgramCache]: Analyzing trace with hash 2126636784, now seen corresponding path program 1 times [2023-12-16 16:00:09,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:00:09,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1528662254] [2023-12-16 16:00:09,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:00:09,425 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:00:09,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:00:09,426 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:00:09,426 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 (32)] Waiting until timeout for monitored process [2023-12-16 16:00:09,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:00:09,575 INFO L262 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 16:00:09,577 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:00:09,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-12-16 16:00:09,703 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2023-12-16 16:00:09,703 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:00:09,703 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:00:09,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1528662254] [2023-12-16 16:00:09,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1528662254] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:00:09,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:00:09,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 16:00:09,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741469856] [2023-12-16 16:00:09,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:00:09,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 16:00:09,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:00:09,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 16:00:09,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 16:00:09,704 INFO L87 Difference]: Start difference. First operand 345 states and 394 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 16:00:10,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:00:10,579 INFO L93 Difference]: Finished difference Result 559 states and 638 transitions. [2023-12-16 16:00:10,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 16:00:10,579 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 155 [2023-12-16 16:00:10,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:00:10,581 INFO L225 Difference]: With dead ends: 559 [2023-12-16 16:00:10,581 INFO L226 Difference]: Without dead ends: 411 [2023-12-16 16:00:10,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-16 16:00:10,581 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 100 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-16 16:00:10,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 203 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-16 16:00:10,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2023-12-16 16:00:10,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 352. [2023-12-16 16:00:10,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 310 states have (on average 1.1161290322580646) internal successors, (346), 312 states have internal predecessors, (346), 28 states have call successors, (28), 13 states have call predecessors, (28), 13 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-16 16:00:10,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 402 transitions. [2023-12-16 16:00:10,598 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 402 transitions. Word has length 155 [2023-12-16 16:00:10,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:00:10,598 INFO L495 AbstractCegarLoop]: Abstraction has 352 states and 402 transitions. [2023-12-16 16:00:10,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 16:00:10,598 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 402 transitions. [2023-12-16 16:00:10,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-16 16:00:10,599 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:00:10,599 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:00:10,603 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 (32)] Ended with exit code 0 [2023-12-16 16:00:10,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:00:10,803 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:00:10,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:00:10,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1467265934, now seen corresponding path program 1 times [2023-12-16 16:00:10,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:00:10,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [984048567] [2023-12-16 16:00:10,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:00:10,804 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:00:10,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:00:10,806 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:00:10,821 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 (33)] Waiting until timeout for monitored process [2023-12-16 16:00:10,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:00:10,953 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 16:00:10,955 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:00:10,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-16 16:00:10,974 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 514 trivial. 0 not checked. [2023-12-16 16:00:10,974 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:00:10,974 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:00:10,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [984048567] [2023-12-16 16:00:10,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [984048567] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:00:10,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:00:10,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 16:00:10,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564718594] [2023-12-16 16:00:10,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:00:10,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 16:00:10,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:00:10,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 16:00:10,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 16:00:10,975 INFO L87 Difference]: Start difference. First operand 352 states and 402 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 16:00:11,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:00:11,091 INFO L93 Difference]: Finished difference Result 502 states and 573 transitions. [2023-12-16 16:00:11,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 16:00:11,092 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 155 [2023-12-16 16:00:11,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:00:11,092 INFO L225 Difference]: With dead ends: 502 [2023-12-16 16:00:11,092 INFO L226 Difference]: Without dead ends: 0 [2023-12-16 16:00:11,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 16:00:11,093 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 16 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 16:00:11,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 168 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 16:00:11,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-16 16:00:11,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-16 16:00:11,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:00:11,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-16 16:00:11,094 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 155 [2023-12-16 16:00:11,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:00:11,094 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-16 16:00:11,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 16:00:11,094 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-16 16:00:11,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-16 16:00:11,096 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 16:00:11,100 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 (33)] Ended with exit code 0 [2023-12-16 16:00:11,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:00:11,300 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-16 16:00:13,978 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-16 16:00:13,979 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-16 16:00:13,979 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-16 16:00:13,979 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-16 16:00:13,979 INFO L895 garLoopResultBuilder]: At program point L93(line 93) the Hoare annotation is: (let ((.cse0 (select |#memory_int#1| |~#WrapperStruct00~0.base|))) (let ((.cse4 (select .cse0 (_ bv10 32)))) (let ((.cse1 (= |~#WrapperStruct00~0.offset| (_ bv0 32))) (.cse2 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet31#1_44| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet31#1_44|) (select .cse0 (_ bv5 32))))) (.cse3 (bvsge .cse4 (_ bv1073741822 32)))) (or (and (= (select .cse0 (_ bv0 32)) ((_ sign_extend 24) (_ bv14 8))) .cse1 .cse2 .cse3 (= (select .cse0 (_ bv18 32)) ((_ sign_extend 16) ((_ extract 15 0) (select .cse0 (_ bv6 32))))) (= .cse4 (select .cse0 (_ bv14 32)))) (let ((.cse5 ((_ sign_extend 24) (_ bv16 8)))) (and .cse1 .cse2 .cse3 (= ~last_1_WrapperStruct00_var_1_5~0 ((_ extract 7 0) .cse5)) (= .cse5 (select .cse0 (_ bv4 32))))))))) [2023-12-16 16:00:13,979 INFO L899 garLoopResultBuilder]: For program point L93-1(line 93) no Hoare annotation was computed. [2023-12-16 16:00:13,979 INFO L899 garLoopResultBuilder]: For program point L52(lines 52 83) no Hoare annotation was computed. [2023-12-16 16:00:13,979 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-16 16:00:13,979 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-16 16:00:13,979 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-16 16:00:13,979 INFO L899 garLoopResultBuilder]: For program point L77(lines 77 81) no Hoare annotation was computed. [2023-12-16 16:00:13,981 INFO L895 garLoopResultBuilder]: At program point L110-2(lines 110 116) the Hoare annotation is: (let ((.cse14 (select |#memory_int#1| |~#WrapperStruct00~0.base|))) (let ((.cse15 (select .cse14 (_ bv10 32))) (.cse3 ((_ sign_extend 24) ((_ extract 7 0) (select .cse14 (_ bv3 32))))) (.cse12 (select .cse14 (_ bv4 32))) (.cse16 (select .cse14 (_ bv5 32))) (.cse13 (select .cse14 (_ bv1 32)))) (let ((.cse0 (= .cse13 ((_ sign_extend 24) (_ bv4 8)))) (.cse10 (= .cse12 ((_ sign_extend 24) ((_ extract 7 0) .cse16)))) (.cse6 (not (= ((_ extract 7 0) (select .cse14 (_ bv2 32))) (_ bv0 8)))) (.cse1 (= (select .cse14 (_ bv0 32)) ((_ sign_extend 24) (_ bv14 8)))) (.cse2 (= |~#WrapperStruct00~0.offset| (_ bv0 32))) (.cse9 (bvslt .cse3 (_ bv0 32))) (.cse5 (bvsge .cse15 (_ bv1073741822 32))) (.cse4 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet31#1_44| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet31#1_44|) .cse16))) (.cse7 (= (select .cse14 (_ bv18 32)) ((_ sign_extend 16) ((_ extract 15 0) (select .cse14 (_ bv6 32)))))) (.cse8 (= .cse15 (select .cse14 (_ bv14 32))))) (or (and .cse0 .cse1 .cse2 (= .cse3 (_ bv14 32)) .cse4 .cse5 .cse6 .cse7 .cse8) (let ((.cse11 ((_ sign_extend 24) (_ bv16 8)))) (and .cse2 .cse9 .cse10 .cse4 .cse5 (= ~last_1_WrapperStruct00_var_1_5~0 ((_ extract 7 0) .cse11)) .cse6 (= .cse11 .cse12))) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse2 (or (and .cse5 (not .cse9)) (and .cse5 (= .cse13 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse3)))))) .cse4 (= ((_ extract 7 0) (select .cse14 (bvadd (_ bv2 32) |~#WrapperStruct00~0.offset|))) (_ bv0 8)) .cse7 .cse8))))) [2023-12-16 16:00:13,981 INFO L899 garLoopResultBuilder]: For program point L110-3(lines 110 116) no Hoare annotation was computed. [2023-12-16 16:00:13,981 INFO L895 garLoopResultBuilder]: At program point L86(line 86) the Hoare annotation is: (let ((.cse14 (select |#memory_int#1| |~#WrapperStruct00~0.base|))) (let ((.cse11 (select .cse14 (_ bv4 32))) (.cse13 (select .cse14 (_ bv5 32))) (.cse9 ((_ sign_extend 24) ((_ extract 7 0) (select .cse14 (_ bv3 32))))) (.cse12 (select .cse14 (_ bv10 32)))) (let ((.cse1 (= (select .cse14 (_ bv0 32)) ((_ sign_extend 24) (_ bv14 8)))) (.cse0 (select .cse14 (_ bv1 32))) (.cse6 (= (select .cse14 (_ bv18 32)) ((_ sign_extend 16) ((_ extract 15 0) (select .cse14 (_ bv6 32)))))) (.cse7 (= .cse12 (select .cse14 (_ bv14 32)))) (.cse2 (= |~#WrapperStruct00~0.offset| (_ bv0 32))) (.cse8 (bvslt .cse9 (_ bv0 32))) (.cse3 (= .cse11 ((_ sign_extend 24) ((_ extract 7 0) .cse13)))) (.cse4 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet31#1_44| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet31#1_44|) .cse13))) (.cse5 (bvsge .cse12 (_ bv1073741822 32)))) (or (and (= .cse0 ((_ sign_extend 24) (_ bv4 8))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse1 .cse2 (or (and .cse5 (not .cse8)) (and .cse5 (= .cse0 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse9)))))) .cse4 .cse6 .cse7) (let ((.cse10 ((_ sign_extend 24) (_ bv16 8)))) (and .cse2 .cse8 .cse3 .cse4 .cse5 (= ~last_1_WrapperStruct00_var_1_5~0 ((_ extract 7 0) .cse10)) (= .cse10 .cse11))))))) [2023-12-16 16:00:13,981 INFO L899 garLoopResultBuilder]: For program point L86-1(line 86) no Hoare annotation was computed. [2023-12-16 16:00:13,981 INFO L899 garLoopResultBuilder]: For program point L78(lines 78 80) no Hoare annotation was computed. [2023-12-16 16:00:13,981 INFO L899 garLoopResultBuilder]: For program point L70(lines 70 74) no Hoare annotation was computed. [2023-12-16 16:00:13,982 INFO L899 garLoopResultBuilder]: For program point L70-2(lines 70 74) no Hoare annotation was computed. [2023-12-16 16:00:13,982 INFO L895 garLoopResultBuilder]: At program point L95(line 95) the Hoare annotation is: (let ((.cse4 (select |#memory_int#1| |~#WrapperStruct00~0.base|))) (let ((.cse0 (= |~#WrapperStruct00~0.offset| (_ bv0 32))) (.cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet31#1_44| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet31#1_44|) (select .cse4 (_ bv5 32))))) (.cse3 (= (select .cse4 (_ bv10 32)) |ULTIMATE.start_updateVariables_#t~mem35#1|))) (or (let ((.cse2 ((_ sign_extend 24) (_ bv16 8)))) (and .cse0 .cse1 (= ~last_1_WrapperStruct00_var_1_5~0 ((_ extract 7 0) .cse2)) .cse3 (= .cse2 (select .cse4 (_ bv4 32))))) (and (= (select .cse4 (_ bv0 32)) ((_ sign_extend 24) (_ bv14 8))) .cse0 .cse1 (= (select .cse4 (_ bv18 32)) ((_ sign_extend 16) ((_ extract 15 0) (select .cse4 (_ bv6 32))))) .cse3)))) [2023-12-16 16:00:13,982 INFO L899 garLoopResultBuilder]: For program point L95-1(line 95) no Hoare annotation was computed. [2023-12-16 16:00:13,982 INFO L895 garLoopResultBuilder]: At program point L87(line 87) the Hoare annotation is: (let ((.cse14 (select |#memory_int#1| |~#WrapperStruct00~0.base|))) (let ((.cse11 (select .cse14 (_ bv4 32))) (.cse13 (select .cse14 (_ bv5 32))) (.cse9 ((_ sign_extend 24) ((_ extract 7 0) (select .cse14 (_ bv3 32))))) (.cse12 (select .cse14 (_ bv10 32)))) (let ((.cse1 (= (select .cse14 (_ bv0 32)) ((_ sign_extend 24) (_ bv14 8)))) (.cse0 (select .cse14 (_ bv1 32))) (.cse6 (= (select .cse14 (_ bv18 32)) ((_ sign_extend 16) ((_ extract 15 0) (select .cse14 (_ bv6 32)))))) (.cse7 (= .cse12 (select .cse14 (_ bv14 32)))) (.cse2 (= |~#WrapperStruct00~0.offset| (_ bv0 32))) (.cse8 (bvslt .cse9 (_ bv0 32))) (.cse3 (= .cse11 ((_ sign_extend 24) ((_ extract 7 0) .cse13)))) (.cse4 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet31#1_44| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet31#1_44|) .cse13))) (.cse5 (bvsge .cse12 (_ bv1073741822 32)))) (or (and (= .cse0 ((_ sign_extend 24) (_ bv4 8))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse1 .cse2 (or (and .cse5 (not .cse8)) (and .cse5 (= .cse0 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse9)))))) .cse4 .cse6 .cse7) (let ((.cse10 ((_ sign_extend 24) (_ bv16 8)))) (and .cse2 .cse8 .cse3 .cse4 .cse5 (= ~last_1_WrapperStruct00_var_1_5~0 ((_ extract 7 0) .cse10)) (= .cse10 .cse11))))))) [2023-12-16 16:00:13,982 INFO L899 garLoopResultBuilder]: For program point L87-1(line 87) no Hoare annotation was computed. [2023-12-16 16:00:13,982 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-16 16:00:13,982 INFO L899 garLoopResultBuilder]: For program point L104(line 104) no Hoare annotation was computed. [2023-12-16 16:00:13,982 INFO L899 garLoopResultBuilder]: For program point L104-1(line 104) no Hoare annotation was computed. [2023-12-16 16:00:13,982 INFO L899 garLoopResultBuilder]: For program point L104-3(line 104) no Hoare annotation was computed. [2023-12-16 16:00:13,982 INFO L899 garLoopResultBuilder]: For program point L104-5(line 104) no Hoare annotation was computed. [2023-12-16 16:00:13,982 INFO L899 garLoopResultBuilder]: For program point L104-6(line 104) no Hoare annotation was computed. [2023-12-16 16:00:13,982 INFO L895 garLoopResultBuilder]: At program point L96(line 96) the Hoare annotation is: (let ((.cse0 (select |#memory_int#1| |~#WrapperStruct00~0.base|))) (let ((.cse1 (= |~#WrapperStruct00~0.offset| (_ bv0 32))) (.cse2 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet31#1_44| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet31#1_44|) (select .cse0 (_ bv5 32))))) (.cse3 (bvsge (select .cse0 (_ bv10 32)) (_ bv1073741822 32)))) (or (and (= (select .cse0 (_ bv0 32)) ((_ sign_extend 24) (_ bv14 8))) .cse1 .cse2 .cse3 (= (select .cse0 (_ bv18 32)) ((_ sign_extend 16) ((_ extract 15 0) (select .cse0 (_ bv6 32)))))) (let ((.cse4 ((_ sign_extend 24) (_ bv16 8)))) (and .cse1 .cse2 .cse3 (= ~last_1_WrapperStruct00_var_1_5~0 ((_ extract 7 0) .cse4)) (= .cse4 (select .cse0 (_ bv4 32)))))))) [2023-12-16 16:00:13,982 INFO L899 garLoopResultBuilder]: For program point L104-8(line 104) no Hoare annotation was computed. [2023-12-16 16:00:13,982 INFO L899 garLoopResultBuilder]: For program point L96-1(line 96) no Hoare annotation was computed. [2023-12-16 16:00:13,982 INFO L899 garLoopResultBuilder]: For program point L104-9(line 104) no Hoare annotation was computed. [2023-12-16 16:00:13,983 INFO L899 garLoopResultBuilder]: For program point L104-10(line 104) no Hoare annotation was computed. [2023-12-16 16:00:13,983 INFO L899 garLoopResultBuilder]: For program point L104-11(line 104) no Hoare annotation was computed. [2023-12-16 16:00:13,983 INFO L899 garLoopResultBuilder]: For program point L104-12(line 104) no Hoare annotation was computed. [2023-12-16 16:00:13,983 INFO L899 garLoopResultBuilder]: For program point L104-14(line 104) no Hoare annotation was computed. [2023-12-16 16:00:13,983 INFO L899 garLoopResultBuilder]: For program point L104-16(line 104) no Hoare annotation was computed. [2023-12-16 16:00:13,983 INFO L899 garLoopResultBuilder]: For program point L55(lines 55 67) no Hoare annotation was computed. [2023-12-16 16:00:13,983 INFO L899 garLoopResultBuilder]: For program point L55-1(lines 55 67) no Hoare annotation was computed. [2023-12-16 16:00:13,983 INFO L899 garLoopResultBuilder]: For program point L104-18(line 104) no Hoare annotation was computed. [2023-12-16 16:00:13,983 INFO L899 garLoopResultBuilder]: For program point L104-20(line 104) no Hoare annotation was computed. [2023-12-16 16:00:13,983 INFO L899 garLoopResultBuilder]: For program point L104-21(line 104) no Hoare annotation was computed. [2023-12-16 16:00:13,983 INFO L899 garLoopResultBuilder]: For program point L104-22(line 104) no Hoare annotation was computed. [2023-12-16 16:00:13,983 INFO L899 garLoopResultBuilder]: For program point L104-23(line 104) no Hoare annotation was computed. [2023-12-16 16:00:13,983 INFO L899 garLoopResultBuilder]: For program point L104-25(line 104) no Hoare annotation was computed. [2023-12-16 16:00:13,983 INFO L899 garLoopResultBuilder]: For program point L104-27(line 104) no Hoare annotation was computed. [2023-12-16 16:00:13,983 INFO L899 garLoopResultBuilder]: For program point L104-28(line 104) no Hoare annotation was computed. [2023-12-16 16:00:13,983 INFO L899 garLoopResultBuilder]: For program point L104-30(line 104) no Hoare annotation was computed. [2023-12-16 16:00:13,983 INFO L899 garLoopResultBuilder]: For program point L104-32(line 104) no Hoare annotation was computed. [2023-12-16 16:00:13,983 INFO L899 garLoopResultBuilder]: For program point L104-33(line 104) no Hoare annotation was computed. [2023-12-16 16:00:13,983 INFO L899 garLoopResultBuilder]: For program point L104-35(line 104) no Hoare annotation was computed. [2023-12-16 16:00:13,983 INFO L899 garLoopResultBuilder]: For program point L104-36(line 104) no Hoare annotation was computed. [2023-12-16 16:00:13,983 INFO L899 garLoopResultBuilder]: For program point L104-38(line 104) no Hoare annotation was computed. [2023-12-16 16:00:13,983 INFO L895 garLoopResultBuilder]: At program point L89(line 89) the Hoare annotation is: (let ((.cse6 (select |#memory_int#1| |~#WrapperStruct00~0.base|))) (let ((.cse7 (select .cse6 (_ bv10 32))) (.cse2 (select .cse6 (_ bv5 32)))) (let ((.cse0 (= |~#WrapperStruct00~0.offset| (_ bv0 32))) (.cse3 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet31#1_44| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet31#1_44|) .cse2))) (.cse4 (bvsge .cse7 (_ bv1073741822 32)))) (or (let ((.cse5 ((_ sign_extend 24) (_ bv16 8))) (.cse1 (select .cse6 (_ bv4 32)))) (and .cse0 (= .cse1 ((_ sign_extend 24) ((_ extract 7 0) .cse2))) .cse3 .cse4 (= ~last_1_WrapperStruct00_var_1_5~0 ((_ extract 7 0) .cse5)) (= .cse5 .cse1))) (and (= (select .cse6 (_ bv0 32)) ((_ sign_extend 24) (_ bv14 8))) .cse0 .cse3 .cse4 (= (select .cse6 (_ bv18 32)) ((_ sign_extend 16) ((_ extract 15 0) (select .cse6 (_ bv6 32))))) (= .cse7 (select .cse6 (_ bv14 32)))))))) [2023-12-16 16:00:13,984 INFO L899 garLoopResultBuilder]: For program point L89-1(line 89) no Hoare annotation was computed. [2023-12-16 16:00:13,984 INFO L899 garLoopResultBuilder]: For program point L56(lines 56 64) no Hoare annotation was computed. [2023-12-16 16:00:13,984 INFO L899 garLoopResultBuilder]: For program point L73(line 73) no Hoare annotation was computed. [2023-12-16 16:00:13,984 INFO L899 garLoopResultBuilder]: For program point L73-2(line 73) no Hoare annotation was computed. [2023-12-16 16:00:13,984 INFO L895 garLoopResultBuilder]: At program point L90(line 90) the Hoare annotation is: (let ((.cse6 (select |#memory_int#1| |~#WrapperStruct00~0.base|))) (let ((.cse7 (select .cse6 (_ bv10 32))) (.cse2 (select .cse6 (_ bv5 32)))) (let ((.cse0 (= |~#WrapperStruct00~0.offset| (_ bv0 32))) (.cse3 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet31#1_44| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet31#1_44|) .cse2))) (.cse4 (bvsge .cse7 (_ bv1073741822 32)))) (or (let ((.cse5 ((_ sign_extend 24) (_ bv16 8))) (.cse1 (select .cse6 (_ bv4 32)))) (and .cse0 (= .cse1 ((_ sign_extend 24) ((_ extract 7 0) .cse2))) .cse3 .cse4 (= ~last_1_WrapperStruct00_var_1_5~0 ((_ extract 7 0) .cse5)) (= .cse5 .cse1))) (and (= (select .cse6 (_ bv0 32)) ((_ sign_extend 24) (_ bv14 8))) .cse0 .cse3 .cse4 (= (select .cse6 (_ bv18 32)) ((_ sign_extend 16) ((_ extract 15 0) (select .cse6 (_ bv6 32))))) (= .cse7 (select .cse6 (_ bv14 32)))))))) [2023-12-16 16:00:13,984 INFO L899 garLoopResultBuilder]: For program point L90-1(line 90) no Hoare annotation was computed. [2023-12-16 16:00:13,984 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-16 16:00:13,984 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-16 16:00:13,984 INFO L895 garLoopResultBuilder]: At program point L92(line 92) the Hoare annotation is: (let ((.cse0 (select |#memory_int#1| |~#WrapperStruct00~0.base|))) (let ((.cse4 (select .cse0 (_ bv10 32)))) (let ((.cse1 (= |~#WrapperStruct00~0.offset| (_ bv0 32))) (.cse2 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet31#1_44| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet31#1_44|) (select .cse0 (_ bv5 32))))) (.cse3 (bvsge .cse4 (_ bv1073741822 32)))) (or (and (= (select .cse0 (_ bv0 32)) ((_ sign_extend 24) (_ bv14 8))) .cse1 .cse2 .cse3 (= (select .cse0 (_ bv18 32)) ((_ sign_extend 16) ((_ extract 15 0) (select .cse0 (_ bv6 32))))) (= .cse4 (select .cse0 (_ bv14 32)))) (let ((.cse5 ((_ sign_extend 24) (_ bv16 8)))) (and .cse1 .cse2 .cse3 (= ~last_1_WrapperStruct00_var_1_5~0 ((_ extract 7 0) .cse5)) (= .cse5 (select .cse0 (_ bv4 32))))))))) [2023-12-16 16:00:13,984 INFO L899 garLoopResultBuilder]: For program point L92-1(line 92) no Hoare annotation was computed. [2023-12-16 16:00:13,984 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 63) no Hoare annotation was computed. [2023-12-16 16:00:13,984 INFO L899 garLoopResultBuilder]: For program point L76(lines 76 82) no Hoare annotation was computed. [2023-12-16 16:00:13,986 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:00:13,987 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 16:00:13,994 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][1bv32] could not be translated [2023-12-16 16:00:14,000 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][0bv32] could not be translated [2023-12-16 16:00:14,000 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][3bv32] could not be translated [2023-12-16 16:00:14,000 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet31#1_44 : bv8 :: ~sign_extend~32~16(v_ULTIMATE.start_updateVariables_#t~nondet31#1_44) == #memory_int#1[~#WrapperStruct00~0!base][5bv32]) could not be translated [2023-12-16 16:00:14,000 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][10bv32] could not be translated [2023-12-16 16:00:14,000 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][2bv32] could not be translated [2023-12-16 16:00:14,000 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][18bv32] could not be translated [2023-12-16 16:00:14,000 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][6bv32] could not be translated [2023-12-16 16:00:14,000 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][10bv32] could not be translated [2023-12-16 16:00:14,000 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][14bv32] could not be translated [2023-12-16 16:00:14,001 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][3bv32] could not be translated [2023-12-16 16:00:14,001 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][4bv32] could not be translated [2023-12-16 16:00:14,001 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][5bv32] could not be translated [2023-12-16 16:00:14,001 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet31#1_44 : bv8 :: ~sign_extend~32~16(v_ULTIMATE.start_updateVariables_#t~nondet31#1_44) == #memory_int#1[~#WrapperStruct00~0!base][5bv32]) could not be translated [2023-12-16 16:00:14,001 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][10bv32] could not be translated [2023-12-16 16:00:14,001 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][2bv32] could not be translated [2023-12-16 16:00:14,002 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][4bv32] could not be translated [2023-12-16 16:00:14,002 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][1bv32] could not be translated [2023-12-16 16:00:14,002 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][0bv32] could not be translated [2023-12-16 16:00:14,002 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][4bv32] could not be translated [2023-12-16 16:00:14,002 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][5bv32] could not be translated [2023-12-16 16:00:14,002 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet31#1_44 : bv8 :: ~sign_extend~32~16(v_ULTIMATE.start_updateVariables_#t~nondet31#1_44) == #memory_int#1[~#WrapperStruct00~0!base][5bv32]) could not be translated [2023-12-16 16:00:14,002 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][10bv32] could not be translated [2023-12-16 16:00:14,002 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][2bv32] could not be translated [2023-12-16 16:00:14,002 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][18bv32] could not be translated [2023-12-16 16:00:14,002 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][6bv32] could not be translated [2023-12-16 16:00:14,002 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][10bv32] could not be translated [2023-12-16 16:00:14,002 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][14bv32] could not be translated [2023-12-16 16:00:14,002 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][0bv32] could not be translated [2023-12-16 16:00:14,002 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][10bv32] could not be translated [2023-12-16 16:00:14,003 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][3bv32] could not be translated [2023-12-16 16:00:14,003 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][10bv32] could not be translated [2023-12-16 16:00:14,003 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][1bv32] could not be translated [2023-12-16 16:00:14,003 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][3bv32] could not be translated [2023-12-16 16:00:14,003 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet31#1_44 : bv8 :: ~sign_extend~32~16(v_ULTIMATE.start_updateVariables_#t~nondet31#1_44) == #memory_int#1[~#WrapperStruct00~0!base][5bv32]) could not be translated [2023-12-16 16:00:14,003 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~bvadd~32(2bv32, ~#WrapperStruct00~0!offset)] could not be translated [2023-12-16 16:00:14,003 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][18bv32] could not be translated [2023-12-16 16:00:14,003 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][6bv32] could not be translated [2023-12-16 16:00:14,003 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][10bv32] could not be translated [2023-12-16 16:00:14,003 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][14bv32] could not be translated [2023-12-16 16:00:14,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:00:14 BoogieIcfgContainer [2023-12-16 16:00:14,004 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 16:00:14,004 INFO L158 Benchmark]: Toolchain (without parser) took 42856.85ms. Allocated memory was 195.0MB in the beginning and 346.0MB in the end (delta: 151.0MB). Free memory was 154.6MB in the beginning and 159.1MB in the end (delta: -4.5MB). Peak memory consumption was 202.1MB. Max. memory is 8.0GB. [2023-12-16 16:00:14,004 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 195.0MB. Free memory is still 142.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 16:00:14,005 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.09ms. Allocated memory is still 195.0MB. Free memory was 154.1MB in the beginning and 139.0MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-16 16:00:14,005 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.04ms. Allocated memory is still 195.0MB. Free memory was 139.0MB in the beginning and 135.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 16:00:14,005 INFO L158 Benchmark]: Boogie Preprocessor took 46.96ms. Allocated memory is still 195.0MB. Free memory was 135.9MB in the beginning and 132.0MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-16 16:00:14,005 INFO L158 Benchmark]: RCFGBuilder took 484.67ms. Allocated memory is still 195.0MB. Free memory was 132.0MB in the beginning and 102.3MB in the end (delta: 29.7MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2023-12-16 16:00:14,005 INFO L158 Benchmark]: TraceAbstraction took 42048.90ms. Allocated memory was 195.0MB in the beginning and 346.0MB in the end (delta: 151.0MB). Free memory was 101.6MB in the beginning and 159.1MB in the end (delta: -57.4MB). Peak memory consumption was 148.6MB. Max. memory is 8.0GB. [2023-12-16 16:00:14,006 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.12ms. Allocated memory is still 195.0MB. Free memory is still 142.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 235.09ms. Allocated memory is still 195.0MB. Free memory was 154.1MB in the beginning and 139.0MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.04ms. Allocated memory is still 195.0MB. Free memory was 139.0MB in the beginning and 135.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.96ms. Allocated memory is still 195.0MB. Free memory was 135.9MB in the beginning and 132.0MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 484.67ms. Allocated memory is still 195.0MB. Free memory was 132.0MB in the beginning and 102.3MB in the end (delta: 29.7MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * TraceAbstraction took 42048.90ms. Allocated memory was 195.0MB in the beginning and 346.0MB in the end (delta: 151.0MB). Free memory was 101.6MB in the beginning and 159.1MB in the end (delta: -57.4MB). Peak memory consumption was 148.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][1bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][3bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet31#1_44 : bv8 :: ~sign_extend~32~16(v_ULTIMATE.start_updateVariables_#t~nondet31#1_44) == #memory_int#1[~#WrapperStruct00~0!base][5bv32]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][10bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][2bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][18bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][6bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][10bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][14bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][3bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][4bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][5bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet31#1_44 : bv8 :: ~sign_extend~32~16(v_ULTIMATE.start_updateVariables_#t~nondet31#1_44) == #memory_int#1[~#WrapperStruct00~0!base][5bv32]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][10bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][2bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][4bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][1bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][4bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][5bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet31#1_44 : bv8 :: ~sign_extend~32~16(v_ULTIMATE.start_updateVariables_#t~nondet31#1_44) == #memory_int#1[~#WrapperStruct00~0!base][5bv32]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][10bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][2bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][18bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][6bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][10bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][14bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][10bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][3bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][10bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][1bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][3bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet31#1_44 : bv8 :: ~sign_extend~32~16(v_ULTIMATE.start_updateVariables_#t~nondet31#1_44) == #memory_int#1[~#WrapperStruct00~0!base][5bv32]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][~bvadd~32(2bv32, ~#WrapperStruct00~0!offset)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][18bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][6bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][10bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#WrapperStruct00~0!base][14bv32] could not be translated * 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 66 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 42.0s, OverallIterations: 29, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 19.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4012 SdHoareTripleChecker+Valid, 15.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3997 mSDsluCounter, 9107 SdHoareTripleChecker+Invalid, 14.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6749 mSDsCounter, 394 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6194 IncrementalHoareTripleChecker+Invalid, 6588 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 394 mSolverCounterUnsat, 2358 mSDtfsCounter, 6194 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3121 GetRequests, 2780 SyntacticMatches, 2 SemanticMatches, 339 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1026 ImplicationChecksByTransitivity, 6.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=626occurred in iteration=21, InterpolantAutomatonStates: 281, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 29 MinimizatonAttempts, 1405 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 487 PreInvPairs, 519 NumberOfFragments, 1278 HoareAnnotationTreeSize, 487 FormulaSimplifications, 66112 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 10 FormulaSimplificationsInter, 18321 FormulaSimplificationTreeSizeReductionInter, 2.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 9.5s InterpolantComputationTime, 2635 NumberOfCodeBlocks, 2635 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2892 ConstructedInterpolants, 241 QuantifiedInterpolants, 19277 SizeOfPredicates, 193 NumberOfNonLiveVariables, 5817 ConjunctsInSsa, 396 ConjunctsInUnsatCore, 36 InterpolantComputations, 28 PerfectInterpolantSequences, 5193/5262 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: ((((((null & 127) == 14) && !(((null & 127) == 0))) || ((((null & 127) < 0) && (last_1_WrapperStruct00_var_1_5 == (16 & 127))) && !(((null & 127) == 0)))) || !(((null & 127) == 0))) || ((null & 127) == 0)) RESULT: Ultimate proved your program to be correct! [2023-12-16 16:00:14,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...