/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-sp_file-6.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 20:03:49,141 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 20:03:49,209 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-24 20:03:49,213 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 20:03:49,213 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 20:03:49,235 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 20:03:49,235 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 20:03:49,236 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 20:03:49,236 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 20:03:49,239 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 20:03:49,239 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 20:03:49,239 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 20:03:49,240 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 20:03:49,241 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 20:03:49,241 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 20:03:49,241 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 20:03:49,242 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 20:03:49,242 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 20:03:49,242 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 20:03:49,242 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 20:03:49,242 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 20:03:49,242 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 20:03:49,243 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 20:03:49,243 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 20:03:49,243 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 20:03:49,243 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 20:03:49,243 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 20:03:49,243 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 20:03:49,243 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 20:03:49,244 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 20:03:49,244 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 20:03:49,245 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 20:03:49,245 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 20:03:49,245 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 20:03:49,245 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 20:03:49,245 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 20:03:49,245 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 20:03:49,245 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 20:03:49,245 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 20:03:49,245 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 20:03:49,246 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 20:03:49,246 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 20:03:49,246 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 20:03:49,246 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 20:03:49,246 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 20:03:49,246 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 20:03:49,246 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-24 20:03:49,427 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 20:03:49,443 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 20:03:49,445 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 20:03:49,446 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 20:03:49,448 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 20:03:49,449 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-6.i [2023-12-24 20:03:50,518 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 20:03:50,721 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 20:03:50,721 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-6.i [2023-12-24 20:03:50,727 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f235cdf06/c787d8e8a80c4be29ed66b3627ea29fd/FLAG4113dcd8f [2023-12-24 20:03:50,741 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f235cdf06/c787d8e8a80c4be29ed66b3627ea29fd [2023-12-24 20:03:50,743 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 20:03:50,744 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 20:03:50,745 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 20:03:50,745 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 20:03:50,750 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 20:03:50,750 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 08:03:50" (1/1) ... [2023-12-24 20:03:50,751 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cdc6ff8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:03:50, skipping insertion in model container [2023-12-24 20:03:50,751 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 08:03:50" (1/1) ... [2023-12-24 20:03:50,781 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 20:03:50,903 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-sp_file-6.i[916,929] [2023-12-24 20:03:50,964 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 20:03:50,978 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 20:03:50,986 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-sp_file-6.i[916,929] [2023-12-24 20:03:51,011 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 20:03:51,028 INFO L206 MainTranslator]: Completed translation [2023-12-24 20:03:51,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:03:51 WrapperNode [2023-12-24 20:03:51,029 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 20:03:51,030 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 20:03:51,030 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 20:03:51,030 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 20:03:51,035 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:03:51" (1/1) ... [2023-12-24 20:03:51,047 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:03:51" (1/1) ... [2023-12-24 20:03:51,082 INFO L138 Inliner]: procedures = 36, calls = 166, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 523 [2023-12-24 20:03:51,083 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 20:03:51,083 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 20:03:51,083 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 20:03:51,083 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 20:03:51,091 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:03:51" (1/1) ... [2023-12-24 20:03:51,091 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:03:51" (1/1) ... [2023-12-24 20:03:51,096 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:03:51" (1/1) ... [2023-12-24 20:03:51,113 INFO L175 MemorySlicer]: Split 135 memory accesses to 2 slices as follows [2, 133]. 99 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 16]. The 18 writes are split as follows [0, 18]. [2023-12-24 20:03:51,113 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:03:51" (1/1) ... [2023-12-24 20:03:51,114 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:03:51" (1/1) ... [2023-12-24 20:03:51,126 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:03:51" (1/1) ... [2023-12-24 20:03:51,129 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:03:51" (1/1) ... [2023-12-24 20:03:51,132 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:03:51" (1/1) ... [2023-12-24 20:03:51,133 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:03:51" (1/1) ... [2023-12-24 20:03:51,137 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 20:03:51,138 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 20:03:51,138 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 20:03:51,138 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 20:03:51,139 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:03:51" (1/1) ... [2023-12-24 20:03:51,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 20:03:51,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 20:03:51,185 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-24 20:03:51,207 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-24 20:03:51,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 20:03:51,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2023-12-24 20:03:51,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2023-12-24 20:03:51,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2023-12-24 20:03:51,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2023-12-24 20:03:51,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-12-24 20:03:51,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-12-24 20:03:51,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2023-12-24 20:03:51,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2023-12-24 20:03:51,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 20:03:51,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-24 20:03:51,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2023-12-24 20:03:51,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2023-12-24 20:03:51,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2023-12-24 20:03:51,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2023-12-24 20:03:51,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-24 20:03:51,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-24 20:03:51,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2023-12-24 20:03:51,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2023-12-24 20:03:51,226 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-24 20:03:51,226 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-24 20:03:51,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 20:03:51,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 20:03:51,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2023-12-24 20:03:51,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2023-12-24 20:03:51,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2023-12-24 20:03:51,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2023-12-24 20:03:51,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-24 20:03:51,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-24 20:03:51,362 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 20:03:51,363 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 20:03:53,759 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 20:03:53,788 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 20:03:53,788 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 20:03:53,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 08:03:53 BoogieIcfgContainer [2023-12-24 20:03:53,789 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 20:03:53,790 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 20:03:53,790 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 20:03:53,792 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 20:03:53,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 08:03:50" (1/3) ... [2023-12-24 20:03:53,793 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f640c46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 08:03:53, skipping insertion in model container [2023-12-24 20:03:53,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:03:51" (2/3) ... [2023-12-24 20:03:53,793 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f640c46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 08:03:53, skipping insertion in model container [2023-12-24 20:03:53,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 08:03:53" (3/3) ... [2023-12-24 20:03:53,794 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-6.i [2023-12-24 20:03:53,806 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 20:03:53,806 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 20:03:53,836 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 20:03:53,841 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;@7669e80b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 20:03:53,841 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 20:03:53,844 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 93 states have (on average 1.4408602150537635) internal successors, (134), 94 states have internal predecessors, (134), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-24 20:03:53,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-12-24 20:03:53,881 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:03:53,882 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 20:03:53,882 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:03:53,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:03:53,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1691815467, now seen corresponding path program 1 times [2023-12-24 20:03:53,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:03:53,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [698663874] [2023-12-24 20:03:53,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:03:53,896 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-24 20:03:53,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:03:53,914 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-24 20:03:53,932 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-24 20:03:54,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:03:54,247 INFO L262 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 20:03:54,253 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:03:54,297 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2023-12-24 20:03:54,298 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 20:03:54,298 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:03:54,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [698663874] [2023-12-24 20:03:54,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [698663874] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 20:03:54,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 20:03:54,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 20:03:54,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486913601] [2023-12-24 20:03:54,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 20:03:54,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 20:03:54,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:03:54,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 20:03:54,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 20:03:54,332 INFO L87 Difference]: Start difference. First operand has 115 states, 93 states have (on average 1.4408602150537635) internal successors, (134), 94 states have internal predecessors, (134), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-24 20:03:54,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:03:54,384 INFO L93 Difference]: Finished difference Result 227 states and 361 transitions. [2023-12-24 20:03:54,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 20:03:54,386 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 153 [2023-12-24 20:03:54,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:03:54,393 INFO L225 Difference]: With dead ends: 227 [2023-12-24 20:03:54,393 INFO L226 Difference]: Without dead ends: 113 [2023-12-24 20:03:54,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 152 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-24 20:03:54,399 INFO L413 NwaCegarLoop]: 163 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, 163 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-24 20:03:54,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 163 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 20:03:54,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-12-24 20:03:54,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2023-12-24 20:03:54,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 92 states have (on average 1.4021739130434783) internal successors, (129), 92 states have internal predecessors, (129), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-24 20:03:54,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 167 transitions. [2023-12-24 20:03:54,440 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 167 transitions. Word has length 153 [2023-12-24 20:03:54,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:03:54,440 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 167 transitions. [2023-12-24 20:03:54,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-24 20:03:54,441 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 167 transitions. [2023-12-24 20:03:54,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-12-24 20:03:54,450 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:03:54,450 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 20:03:54,462 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 (2)] Ended with exit code 0 [2023-12-24 20:03:54,660 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-24 20:03:54,661 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:03:54,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:03:54,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1540379977, now seen corresponding path program 1 times [2023-12-24 20:03:54,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:03:54,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [651202113] [2023-12-24 20:03:54,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:03:54,665 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-24 20:03:54,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:03:54,680 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-24 20:03:54,681 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-24 20:03:54,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:03:54,966 INFO L262 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 20:03:54,970 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:03:55,036 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 352 proven. 0 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2023-12-24 20:03:55,037 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 20:03:55,037 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:03:55,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [651202113] [2023-12-24 20:03:55,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [651202113] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 20:03:55,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 20:03:55,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 20:03:55,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761031839] [2023-12-24 20:03:55,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 20:03:55,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 20:03:55,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:03:55,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 20:03:55,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 20:03:55,040 INFO L87 Difference]: Start difference. First operand 113 states and 167 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-24 20:03:55,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:03:55,138 INFO L93 Difference]: Finished difference Result 231 states and 342 transitions. [2023-12-24 20:03:55,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 20:03:55,140 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 153 [2023-12-24 20:03:55,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:03:55,141 INFO L225 Difference]: With dead ends: 231 [2023-12-24 20:03:55,141 INFO L226 Difference]: Without dead ends: 119 [2023-12-24 20:03:55,142 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-24 20:03:55,143 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 10 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 20:03:55,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 478 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 20:03:55,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-12-24 20:03:55,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 115. [2023-12-24 20:03:55,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 94 states have (on average 1.3936170212765957) internal successors, (131), 94 states have internal predecessors, (131), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-24 20:03:55,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 169 transitions. [2023-12-24 20:03:55,152 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 169 transitions. Word has length 153 [2023-12-24 20:03:55,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:03:55,152 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 169 transitions. [2023-12-24 20:03:55,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-24 20:03:55,153 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 169 transitions. [2023-12-24 20:03:55,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-12-24 20:03:55,154 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:03:55,154 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 20:03:55,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-24 20:03:55,363 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-24 20:03:55,364 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:03:55,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:03:55,364 INFO L85 PathProgramCache]: Analyzing trace with hash -357116789, now seen corresponding path program 1 times [2023-12-24 20:03:55,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:03:55,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1184879051] [2023-12-24 20:03:55,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:03:55,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-24 20:03:55,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:03:55,368 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-24 20:03:55,398 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-24 20:03:55,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:03:55,653 INFO L262 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 20:03:55,657 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:03:55,676 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-24 20:03:55,676 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 20:03:55,676 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:03:55,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1184879051] [2023-12-24 20:03:55,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1184879051] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 20:03:55,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 20:03:55,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 20:03:55,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810353118] [2023-12-24 20:03:55,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 20:03:55,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 20:03:55,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:03:55,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 20:03:55,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 20:03:55,678 INFO L87 Difference]: Start difference. First operand 115 states and 169 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-24 20:03:55,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:03:55,725 INFO L93 Difference]: Finished difference Result 252 states and 371 transitions. [2023-12-24 20:03:55,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 20:03:55,725 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2023-12-24 20:03:55,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:03:55,727 INFO L225 Difference]: With dead ends: 252 [2023-12-24 20:03:55,727 INFO L226 Difference]: Without dead ends: 138 [2023-12-24 20:03:55,727 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-24 20:03:55,731 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 43 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 20:03:55,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 472 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 20:03:55,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-12-24 20:03:55,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 117. [2023-12-24 20:03:55,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 96 states have (on average 1.3854166666666667) internal successors, (133), 96 states have internal predecessors, (133), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-24 20:03:55,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 171 transitions. [2023-12-24 20:03:55,748 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 171 transitions. Word has length 153 [2023-12-24 20:03:55,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:03:55,749 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 171 transitions. [2023-12-24 20:03:55,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-24 20:03:55,749 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 171 transitions. [2023-12-24 20:03:55,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-24 20:03:55,752 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:03:55,752 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 20:03:55,762 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-24 20:03:55,962 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-24 20:03:55,962 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:03:55,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:03:55,963 INFO L85 PathProgramCache]: Analyzing trace with hash 189042585, now seen corresponding path program 1 times [2023-12-24 20:03:55,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:03:55,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [610169570] [2023-12-24 20:03:55,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:03:55,964 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-24 20:03:55,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:03:55,969 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-24 20:03:55,970 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-24 20:03:56,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:03:56,256 INFO L262 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 20:03:56,260 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:03:56,428 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:03:56,429 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 175 treesize of output 67 [2023-12-24 20:03:56,485 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 336 proven. 0 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2023-12-24 20:03:56,485 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 20:03:56,486 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:03:56,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [610169570] [2023-12-24 20:03:56,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [610169570] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 20:03:56,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 20:03:56,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 20:03:56,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954378233] [2023-12-24 20:03:56,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 20:03:56,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 20:03:56,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:03:56,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 20:03:56,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-24 20:03:56,488 INFO L87 Difference]: Start difference. First operand 117 states and 171 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-24 20:04:00,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:04:00,262 INFO L93 Difference]: Finished difference Result 239 states and 350 transitions. [2023-12-24 20:04:00,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 20:04:00,264 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2023-12-24 20:04:00,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:04:00,265 INFO L225 Difference]: With dead ends: 239 [2023-12-24 20:04:00,265 INFO L226 Difference]: Without dead ends: 123 [2023-12-24 20:04:00,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2023-12-24 20:04:00,266 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 155 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2023-12-24 20:04:00,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 468 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2023-12-24 20:04:00,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-12-24 20:04:00,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 117. [2023-12-24 20:04:00,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 96 states have (on average 1.375) internal successors, (132), 96 states have internal predecessors, (132), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-24 20:04:00,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 170 transitions. [2023-12-24 20:04:00,271 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 170 transitions. Word has length 155 [2023-12-24 20:04:00,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:04:00,272 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 170 transitions. [2023-12-24 20:04:00,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-24 20:04:00,281 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 170 transitions. [2023-12-24 20:04:00,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-12-24 20:04:00,283 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:04:00,283 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 20:04:00,293 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-24 20:04:00,488 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-24 20:04:00,488 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:04:00,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:04:00,489 INFO L85 PathProgramCache]: Analyzing trace with hash 152636447, now seen corresponding path program 1 times [2023-12-24 20:04:00,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:04:00,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [626218581] [2023-12-24 20:04:00,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:04:00,490 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-24 20:04:00,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:04:00,505 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-24 20:04:00,506 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-24 20:04:00,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:04:00,814 INFO L262 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 20:04:00,818 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:04:00,977 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:04:00,978 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 173 treesize of output 65 [2023-12-24 20:04:01,000 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 352 proven. 0 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2023-12-24 20:04:01,001 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 20:04:01,001 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:04:01,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [626218581] [2023-12-24 20:04:01,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [626218581] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 20:04:01,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 20:04:01,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 20:04:01,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886449237] [2023-12-24 20:04:01,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 20:04:01,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 20:04:01,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:04:01,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 20:04:01,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-24 20:04:01,003 INFO L87 Difference]: Start difference. First operand 117 states and 170 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-24 20:04:05,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:04:05,226 INFO L93 Difference]: Finished difference Result 237 states and 345 transitions. [2023-12-24 20:04:05,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 20:04:05,227 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 157 [2023-12-24 20:04:05,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:04:05,228 INFO L225 Difference]: With dead ends: 237 [2023-12-24 20:04:05,229 INFO L226 Difference]: Without dead ends: 121 [2023-12-24 20:04:05,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2023-12-24 20:04:05,230 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 157 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-12-24 20:04:05,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 459 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2023-12-24 20:04:05,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-12-24 20:04:05,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 115. [2023-12-24 20:04:05,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 94 states have (on average 1.372340425531915) internal successors, (129), 94 states have internal predecessors, (129), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-24 20:04:05,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 167 transitions. [2023-12-24 20:04:05,235 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 167 transitions. Word has length 157 [2023-12-24 20:04:05,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:04:05,236 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 167 transitions. [2023-12-24 20:04:05,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-24 20:04:05,236 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 167 transitions. [2023-12-24 20:04:05,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-12-24 20:04:05,237 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:04:05,237 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 20:04:05,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-24 20:04:05,453 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-24 20:04:05,454 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:04:05,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:04:05,454 INFO L85 PathProgramCache]: Analyzing trace with hash 976385559, now seen corresponding path program 1 times [2023-12-24 20:04:05,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:04:05,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [345045891] [2023-12-24 20:04:05,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:04:05,455 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-24 20:04:05,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:04:05,456 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-24 20:04:05,457 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-24 20:04:05,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:04:05,757 INFO L262 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-24 20:04:05,760 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:04:05,916 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:04:05,917 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 172 treesize of output 64 [2023-12-24 20:04:05,962 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 360 proven. 32 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2023-12-24 20:04:05,962 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 20:04:06,214 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:04:06,214 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 110 treesize of output 1 [2023-12-24 20:04:06,228 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 24 proven. 30 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2023-12-24 20:04:06,229 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:04:06,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [345045891] [2023-12-24 20:04:06,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [345045891] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 20:04:06,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 20:04:06,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2023-12-24 20:04:06,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868280987] [2023-12-24 20:04:06,229 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 20:04:06,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-24 20:04:06,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:04:06,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-24 20:04:06,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-12-24 20:04:06,231 INFO L87 Difference]: Start difference. First operand 115 states and 167 transitions. Second operand has 12 states, 11 states have (on average 8.818181818181818) internal successors, (97), 12 states have internal predecessors, (97), 4 states have call successors, (37), 3 states have call predecessors, (37), 4 states have return successors, (37), 3 states have call predecessors, (37), 4 states have call successors, (37) [2023-12-24 20:04:10,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:04:10,761 INFO L93 Difference]: Finished difference Result 242 states and 348 transitions. [2023-12-24 20:04:10,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-24 20:04:10,762 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.818181818181818) internal successors, (97), 12 states have internal predecessors, (97), 4 states have call successors, (37), 3 states have call predecessors, (37), 4 states have return successors, (37), 3 states have call predecessors, (37), 4 states have call successors, (37) Word has length 159 [2023-12-24 20:04:10,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:04:10,765 INFO L225 Difference]: With dead ends: 242 [2023-12-24 20:04:10,765 INFO L226 Difference]: Without dead ends: 117 [2023-12-24 20:04:10,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2023-12-24 20:04:10,766 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 151 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2023-12-24 20:04:10,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 693 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2023-12-24 20:04:10,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-12-24 20:04:10,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2023-12-24 20:04:10,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 94 states have (on average 1.351063829787234) internal successors, (127), 94 states have internal predecessors, (127), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-24 20:04:10,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 165 transitions. [2023-12-24 20:04:10,771 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 165 transitions. Word has length 159 [2023-12-24 20:04:10,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:04:10,772 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 165 transitions. [2023-12-24 20:04:10,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.818181818181818) internal successors, (97), 12 states have internal predecessors, (97), 4 states have call successors, (37), 3 states have call predecessors, (37), 4 states have return successors, (37), 3 states have call predecessors, (37), 4 states have call successors, (37) [2023-12-24 20:04:10,772 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 165 transitions. [2023-12-24 20:04:10,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-12-24 20:04:10,773 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:04:10,773 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 20:04:10,783 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-24 20:04:10,983 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-24 20:04:10,983 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:04:10,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:04:10,984 INFO L85 PathProgramCache]: Analyzing trace with hash -412908455, now seen corresponding path program 1 times [2023-12-24 20:04:10,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:04:10,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [113066303] [2023-12-24 20:04:10,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:04:10,984 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-24 20:04:10,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:04:10,985 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-24 20:04:10,993 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-24 20:04:11,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:04:11,355 INFO L262 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 20:04:11,359 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:04:11,520 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:04:11,521 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 173 treesize of output 65 [2023-12-24 20:04:11,553 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2023-12-24 20:04:11,553 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 20:04:11,553 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:04:11,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [113066303] [2023-12-24 20:04:11,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [113066303] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 20:04:11,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 20:04:11,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 20:04:11,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105670654] [2023-12-24 20:04:11,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 20:04:11,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 20:04:11,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:04:11,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 20:04:11,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-24 20:04:11,555 INFO L87 Difference]: Start difference. First operand 115 states and 165 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-24 20:04:15,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:04:15,425 INFO L93 Difference]: Finished difference Result 235 states and 338 transitions. [2023-12-24 20:04:15,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 20:04:15,426 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 159 [2023-12-24 20:04:15,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:04:15,426 INFO L225 Difference]: With dead ends: 235 [2023-12-24 20:04:15,427 INFO L226 Difference]: Without dead ends: 121 [2023-12-24 20:04:15,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2023-12-24 20:04:15,427 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 132 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2023-12-24 20:04:15,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 452 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2023-12-24 20:04:15,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-12-24 20:04:15,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 115. [2023-12-24 20:04:15,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 94 states have (on average 1.3404255319148937) internal successors, (126), 94 states have internal predecessors, (126), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-24 20:04:15,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 164 transitions. [2023-12-24 20:04:15,434 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 164 transitions. Word has length 159 [2023-12-24 20:04:15,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:04:15,435 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 164 transitions. [2023-12-24 20:04:15,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-24 20:04:15,435 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 164 transitions. [2023-12-24 20:04:15,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2023-12-24 20:04:15,436 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:04:15,436 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 20:04:15,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-24 20:04:15,649 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-24 20:04:15,649 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:04:15,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:04:15,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1709253343, now seen corresponding path program 1 times [2023-12-24 20:04:15,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:04:15,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1076244626] [2023-12-24 20:04:15,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:04:15,650 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-24 20:04:15,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:04:15,651 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-24 20:04:15,653 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-24 20:04:16,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:04:16,156 INFO L262 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 20:04:16,159 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:04:16,171 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 15 treesize of output 7 [2023-12-24 20:04:16,180 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-24 20:04:16,180 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 20:04:16,180 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:04:16,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1076244626] [2023-12-24 20:04:16,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1076244626] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 20:04:16,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 20:04:16,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 20:04:16,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000349207] [2023-12-24 20:04:16,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 20:04:16,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 20:04:16,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:04:16,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 20:04:16,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 20:04:16,182 INFO L87 Difference]: Start difference. First operand 115 states and 164 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-24 20:04:16,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:04:16,292 INFO L93 Difference]: Finished difference Result 229 states and 327 transitions. [2023-12-24 20:04:16,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 20:04:16,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 161 [2023-12-24 20:04:16,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:04:16,294 INFO L225 Difference]: With dead ends: 229 [2023-12-24 20:04:16,294 INFO L226 Difference]: Without dead ends: 115 [2023-12-24 20:04:16,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 20:04:16,295 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 2 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 20:04:16,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 307 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 20:04:16,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-12-24 20:04:16,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2023-12-24 20:04:16,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 94 states have (on average 1.3297872340425532) internal successors, (125), 94 states have internal predecessors, (125), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-24 20:04:16,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 163 transitions. [2023-12-24 20:04:16,300 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 163 transitions. Word has length 161 [2023-12-24 20:04:16,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:04:16,300 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 163 transitions. [2023-12-24 20:04:16,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-24 20:04:16,301 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 163 transitions. [2023-12-24 20:04:16,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2023-12-24 20:04:16,302 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:04:16,302 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 20:04:16,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-12-24 20:04:16,513 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-24 20:04:16,514 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:04:16,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:04:16,514 INFO L85 PathProgramCache]: Analyzing trace with hash 891604893, now seen corresponding path program 1 times [2023-12-24 20:04:16,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:04:16,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1825480616] [2023-12-24 20:04:16,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:04:16,515 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-24 20:04:16,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:04:16,516 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-24 20:04:16,517 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-24 20:04:17,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:04:17,141 INFO L262 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 20:04:17,144 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:04:17,169 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 15 treesize of output 7 [2023-12-24 20:04:17,208 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-24 20:04:17,208 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 20:04:17,208 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:04:17,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1825480616] [2023-12-24 20:04:17,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1825480616] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 20:04:17,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 20:04:17,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 20:04:17,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366020731] [2023-12-24 20:04:17,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 20:04:17,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 20:04:17,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:04:17,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 20:04:17,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 20:04:17,210 INFO L87 Difference]: Start difference. First operand 115 states and 163 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-24 20:04:17,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:04:17,243 INFO L93 Difference]: Finished difference Result 229 states and 325 transitions. [2023-12-24 20:04:17,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 20:04:17,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 161 [2023-12-24 20:04:17,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:04:17,245 INFO L225 Difference]: With dead ends: 229 [2023-12-24 20:04:17,245 INFO L226 Difference]: Without dead ends: 115 [2023-12-24 20:04:17,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 20:04:17,247 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 40 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 20:04:17,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 270 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 20:04:17,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-12-24 20:04:17,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2023-12-24 20:04:17,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 94 states have (on average 1.3191489361702127) internal successors, (124), 94 states have internal predecessors, (124), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-24 20:04:17,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 162 transitions. [2023-12-24 20:04:17,255 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 162 transitions. Word has length 161 [2023-12-24 20:04:17,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:04:17,256 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 162 transitions. [2023-12-24 20:04:17,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-24 20:04:17,256 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 162 transitions. [2023-12-24 20:04:17,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2023-12-24 20:04:17,257 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:04:17,257 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 20:04:17,277 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-24 20:04:17,477 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-24 20:04:17,478 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:04:17,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:04:17,479 INFO L85 PathProgramCache]: Analyzing trace with hash -129463461, now seen corresponding path program 1 times [2023-12-24 20:04:17,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:04:17,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2080701721] [2023-12-24 20:04:17,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:04:17,479 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-24 20:04:17,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:04:17,480 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-24 20:04:17,481 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-24 20:04:18,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:04:18,213 INFO L262 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-24 20:04:18,218 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:04:20,190 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-24 20:04:20,790 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 30 treesize of output 25 [2023-12-24 20:04:21,271 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 0 case distinctions, treesize of input 38 treesize of output 36 [2023-12-24 20:04:21,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2023-12-24 20:04:22,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43 [2023-12-24 20:04:22,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 47 [2023-12-24 20:04:23,066 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:04:23,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 43 [2023-12-24 20:04:23,126 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 301 proven. 151 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2023-12-24 20:04:23,126 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 20:04:23,642 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:04:23,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2080701721] [2023-12-24 20:04:23,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2080701721] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 20:04:23,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1904989622] [2023-12-24 20:04:23,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:04:23,643 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 20:04:23,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 20:04:23,673 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 20:04:23,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2023-12-24 20:04:25,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:04:25,531 INFO L262 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-24 20:04:25,535 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:04:27,261 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-24 20:04:27,623 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-24 20:04:27,906 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-24 20:04:28,169 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-24 20:04:28,518 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 26 treesize of output 21 [2023-12-24 20:04:28,800 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 0 case distinctions, treesize of input 37 treesize of output 24 [2023-12-24 20:04:29,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 34 [2023-12-24 20:04:29,056 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 264 proven. 136 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2023-12-24 20:04:29,056 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 20:04:29,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1904989622] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 20:04:29,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 20:04:29,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9] total 21 [2023-12-24 20:04:29,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857816872] [2023-12-24 20:04:29,160 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 20:04:29,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-24 20:04:29,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:04:29,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-24 20:04:29,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=640, Unknown=0, NotChecked=0, Total=756 [2023-12-24 20:04:29,162 INFO L87 Difference]: Start difference. First operand 115 states and 162 transitions. Second operand has 22 states, 21 states have (on average 7.095238095238095) internal successors, (149), 20 states have internal predecessors, (149), 9 states have call successors, (38), 9 states have call predecessors, (38), 9 states have return successors, (38), 8 states have call predecessors, (38), 9 states have call successors, (38) [2023-12-24 20:04:36,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 20:04:45,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:04:45,564 INFO L93 Difference]: Finished difference Result 536 states and 740 transitions. [2023-12-24 20:04:45,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-12-24 20:04:45,565 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 7.095238095238095) internal successors, (149), 20 states have internal predecessors, (149), 9 states have call successors, (38), 9 states have call predecessors, (38), 9 states have return successors, (38), 8 states have call predecessors, (38), 9 states have call successors, (38) Word has length 161 [2023-12-24 20:04:45,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:04:45,569 INFO L225 Difference]: With dead ends: 536 [2023-12-24 20:04:45,570 INFO L226 Difference]: Without dead ends: 422 [2023-12-24 20:04:45,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 351 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 802 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=660, Invalid=2646, Unknown=0, NotChecked=0, Total=3306 [2023-12-24 20:04:45,571 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 1947 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 1872 mSolverCounterSat, 448 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1958 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 2320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 448 IncrementalHoareTripleChecker+Valid, 1872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.8s IncrementalHoareTripleChecker+Time [2023-12-24 20:04:45,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1958 Valid, 997 Invalid, 2320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [448 Valid, 1872 Invalid, 0 Unknown, 0 Unchecked, 13.8s Time] [2023-12-24 20:04:45,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2023-12-24 20:04:45,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 320. [2023-12-24 20:04:45,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 273 states have (on average 1.315018315018315) internal successors, (359), 275 states have internal predecessors, (359), 41 states have call successors, (41), 5 states have call predecessors, (41), 5 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2023-12-24 20:04:45,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 441 transitions. [2023-12-24 20:04:45,602 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 441 transitions. Word has length 161 [2023-12-24 20:04:45,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:04:45,602 INFO L495 AbstractCegarLoop]: Abstraction has 320 states and 441 transitions. [2023-12-24 20:04:45,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 7.095238095238095) internal successors, (149), 20 states have internal predecessors, (149), 9 states have call successors, (38), 9 states have call predecessors, (38), 9 states have return successors, (38), 8 states have call predecessors, (38), 9 states have call successors, (38) [2023-12-24 20:04:45,602 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 441 transitions. [2023-12-24 20:04:45,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2023-12-24 20:04:45,608 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:04:45,608 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 20:04:45,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-24 20:04:45,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Ended with exit code 0 [2023-12-24 20:04:46,030 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,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-24 20:04:46,030 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:04:46,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:04:46,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1773875476, now seen corresponding path program 1 times [2023-12-24 20:04:46,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:04:46,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [392724398] [2023-12-24 20:04:46,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:04:46,032 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-24 20:04:46,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:04:46,033 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-24 20:04:46,034 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-24 20:04:46,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:04:46,449 INFO L262 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-24 20:04:46,453 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:04:46,477 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 9 treesize of output 3 [2023-12-24 20:04:46,991 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 11 treesize of output 7 [2023-12-24 20:04:48,099 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:04:48,099 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 39 treesize of output 51 [2023-12-24 20:04:48,461 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-24 20:04:48,461 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 20:04:48,461 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:04:48,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [392724398] [2023-12-24 20:04:48,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [392724398] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 20:04:48,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 20:04:48,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-24 20:04:48,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778556322] [2023-12-24 20:04:48,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 20:04:48,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-24 20:04:48,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:04:48,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-24 20:04:48,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-12-24 20:04:48,462 INFO L87 Difference]: Start difference. First operand 320 states and 441 transitions. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 10 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-24 20:04:56,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 20:05:06,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 20:05:10,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:05:10,676 INFO L93 Difference]: Finished difference Result 1040 states and 1429 transitions. [2023-12-24 20:05:10,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-24 20:05:10,678 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 10 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 161 [2023-12-24 20:05:10,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:05:10,681 INFO L225 Difference]: With dead ends: 1040 [2023-12-24 20:05:10,681 INFO L226 Difference]: Without dead ends: 721 [2023-12-24 20:05:10,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=152, Invalid=604, Unknown=0, NotChecked=0, Total=756 [2023-12-24 20:05:10,683 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 309 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 890 mSolverCounterSat, 51 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 890 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2023-12-24 20:05:10,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 770 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 890 Invalid, 1 Unknown, 0 Unchecked, 16.1s Time] [2023-12-24 20:05:10,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2023-12-24 20:05:10,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 488. [2023-12-24 20:05:10,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 418 states have (on average 1.299043062200957) internal successors, (543), 420 states have internal predecessors, (543), 60 states have call successors, (60), 9 states have call predecessors, (60), 9 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2023-12-24 20:05:10,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 663 transitions. [2023-12-24 20:05:10,719 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 663 transitions. Word has length 161 [2023-12-24 20:05:10,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:05:10,719 INFO L495 AbstractCegarLoop]: Abstraction has 488 states and 663 transitions. [2023-12-24 20:05:10,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 10 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-24 20:05:10,719 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 663 transitions. [2023-12-24 20:05:10,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2023-12-24 20:05:10,720 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:05:10,720 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 20:05:10,732 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-24 20:05:10,932 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-24 20:05:10,933 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:05:10,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:05:10,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1992730194, now seen corresponding path program 1 times [2023-12-24 20:05:10,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:05:10,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [279858463] [2023-12-24 20:05:10,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:05:10,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-24 20:05:10,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:05:10,935 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-24 20:05:10,936 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-24 20:05:11,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:05:11,396 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-24 20:05:11,406 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:05:11,500 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 9 treesize of output 3 [2023-12-24 20:05:14,609 INFO L349 Elim1Store]: treesize reduction 38, result has 53.1 percent of original size [2023-12-24 20:05:14,609 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 3 case distinctions, treesize of input 38 treesize of output 60 [2023-12-24 20:05:16,777 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:05:16,777 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 51 treesize of output 55 [2023-12-24 20:05:17,386 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-24 20:05:17,386 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 20:05:17,386 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:05:17,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [279858463] [2023-12-24 20:05:17,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [279858463] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 20:05:17,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 20:05:17,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-24 20:05:17,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853173855] [2023-12-24 20:05:17,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 20:05:17,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-24 20:05:17,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:05:17,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-24 20:05:17,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2023-12-24 20:05:17,387 INFO L87 Difference]: Start difference. First operand 488 states and 663 transitions. Second operand has 12 states, 12 states have (on average 5.75) internal successors, (69), 11 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-24 20:05:36,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:05:36,982 INFO L93 Difference]: Finished difference Result 1205 states and 1641 transitions. [2023-12-24 20:05:36,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-24 20:05:36,984 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 11 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 161 [2023-12-24 20:05:36,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:05:36,988 INFO L225 Difference]: With dead ends: 1205 [2023-12-24 20:05:36,988 INFO L226 Difference]: Without dead ends: 886 [2023-12-24 20:05:36,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2023-12-24 20:05:36,990 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 239 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 1010 mSolverCounterSat, 50 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 1063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1010 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2023-12-24 20:05:36,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 814 Invalid, 1063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1010 Invalid, 3 Unknown, 0 Unchecked, 16.1s Time] [2023-12-24 20:05:36,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2023-12-24 20:05:37,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 591. [2023-12-24 20:05:37,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 498 states have (on average 1.2971887550200802) internal successors, (646), 500 states have internal predecessors, (646), 79 states have call successors, (79), 13 states have call predecessors, (79), 13 states have return successors, (79), 77 states have call predecessors, (79), 79 states have call successors, (79) [2023-12-24 20:05:37,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 804 transitions. [2023-12-24 20:05:37,059 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 804 transitions. Word has length 161 [2023-12-24 20:05:37,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:05:37,060 INFO L495 AbstractCegarLoop]: Abstraction has 591 states and 804 transitions. [2023-12-24 20:05:37,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 11 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-24 20:05:37,060 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 804 transitions. [2023-12-24 20:05:37,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-12-24 20:05:37,062 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:05:37,062 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 20:05:37,076 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 (14)] Ended with exit code 0 [2023-12-24 20:05:37,272 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-24 20:05:37,273 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:05:37,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:05:37,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1734416544, now seen corresponding path program 1 times [2023-12-24 20:05:37,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:05:37,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1620667210] [2023-12-24 20:05:37,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:05:37,274 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-24 20:05:37,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:05:37,276 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-24 20:05:37,278 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-24 20:05:37,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:05:38,035 INFO L262 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 48 conjunts are in the unsatisfiable core [2023-12-24 20:05:38,056 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:05:38,583 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 0 case distinctions, treesize of input 32 treesize of output 23 [2023-12-24 20:05:41,638 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 0 case distinctions, treesize of input 32 treesize of output 23 [2023-12-24 20:05:43,416 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 0 case distinctions, treesize of input 32 treesize of output 23 [2023-12-24 20:05:45,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2023-12-24 20:05:46,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2023-12-24 20:05:52,869 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 41 treesize of output 50 [2023-12-24 20:06:03,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 72 [2023-12-24 20:06:17,367 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 0 case distinctions, treesize of input 69 treesize of output 86 [2023-12-24 20:06:20,688 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 0 case distinctions, treesize of input 80 treesize of output 89 [2023-12-24 20:06:23,471 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 0 case distinctions, treesize of input 80 treesize of output 89 [2023-12-24 20:06:26,206 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 0 case distinctions, treesize of input 80 treesize of output 89 [2023-12-24 20:06:30,462 INFO L349 Elim1Store]: treesize reduction 222, result has 14.9 percent of original size [2023-12-24 20:06:30,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 21 case distinctions, treesize of input 100 treesize of output 153 [2023-12-24 20:06:39,400 INFO L349 Elim1Store]: treesize reduction 1272, result has 4.3 percent of original size [2023-12-24 20:06:39,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 18 select indices, 18 select index equivalence classes, 45 disjoint index pairs (out of 153 index pairs), introduced 18 new quantified variables, introduced 116 case distinctions, treesize of input 245 treesize of output 260 [2023-12-24 20:06:47,845 WARN L293 SmtUtils]: Spent 6.52s on a formula simplification that was a NOOP. DAG size: 494 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-12-24 20:06:47,846 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:06:47,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 18 select indices, 18 select index equivalence classes, 45 disjoint index pairs (out of 153 index pairs), introduced 18 new quantified variables, introduced 153 case distinctions, treesize of input 242 treesize of output 1250 [2023-12-24 20:17:42,950 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-12-24 20:17:42,951 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:17:42,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1620667210] [2023-12-24 20:17:42,952 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-12-24 20:17:42,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2023-12-24 20:17:42,965 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 (15)] Ended with exit code 0 [2023-12-24 20:17:43,152 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-24 20:17:43,153 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:268) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:410) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:394) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:500) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:298) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 75 more [2023-12-24 20:17:43,156 INFO L158 Benchmark]: Toolchain (without parser) took 832412.49ms. Allocated memory was 399.5MB in the beginning and 859.8MB in the end (delta: 460.3MB). Free memory was 354.4MB in the beginning and 364.4MB in the end (delta: -10.0MB). Peak memory consumption was 526.1MB. Max. memory is 8.0GB. [2023-12-24 20:17:43,157 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 203.4MB. Free memory is still 150.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 20:17:43,157 INFO L158 Benchmark]: CACSL2BoogieTranslator took 284.34ms. Allocated memory is still 399.5MB. Free memory was 353.9MB in the beginning and 336.0MB in the end (delta: 17.9MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-24 20:17:43,157 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.93ms. Allocated memory is still 399.5MB. Free memory was 336.0MB in the beginning and 332.4MB in the end (delta: 3.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-24 20:17:43,157 INFO L158 Benchmark]: Boogie Preprocessor took 54.28ms. Allocated memory is still 399.5MB. Free memory was 332.4MB in the beginning and 327.1MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-24 20:17:43,157 INFO L158 Benchmark]: RCFGBuilder took 2650.67ms. Allocated memory is still 399.5MB. Free memory was 327.1MB in the beginning and 281.5MB in the end (delta: 45.6MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. [2023-12-24 20:17:43,157 INFO L158 Benchmark]: TraceAbstraction took 829366.15ms. Allocated memory was 399.5MB in the beginning and 859.8MB in the end (delta: 460.3MB). Free memory was 280.5MB in the beginning and 364.4MB in the end (delta: -84.0MB). Peak memory consumption was 451.6MB. Max. memory is 8.0GB. [2023-12-24 20:17:43,158 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.10ms. Allocated memory is still 203.4MB. Free memory is still 150.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 284.34ms. Allocated memory is still 399.5MB. Free memory was 353.9MB in the beginning and 336.0MB in the end (delta: 17.9MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.93ms. Allocated memory is still 399.5MB. Free memory was 336.0MB in the beginning and 332.4MB in the end (delta: 3.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 54.28ms. Allocated memory is still 399.5MB. Free memory was 332.4MB in the beginning and 327.1MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 2650.67ms. Allocated memory is still 399.5MB. Free memory was 327.1MB in the beginning and 281.5MB in the end (delta: 45.6MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. * TraceAbstraction took 829366.15ms. Allocated memory was 399.5MB in the beginning and 859.8MB in the end (delta: 460.3MB). Free memory was 280.5MB in the beginning and 364.4MB in the end (delta: -84.0MB). Peak memory consumption was 451.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...