/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-a_file-12.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 12:51:34,227 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 12:51:34,292 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 12:51:34,297 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 12:51:34,298 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 12:51:34,319 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 12:51:34,319 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 12:51:34,319 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 12:51:34,320 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 12:51:34,322 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 12:51:34,323 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 12:51:34,323 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 12:51:34,323 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 12:51:34,324 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 12:51:34,325 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 12:51:34,325 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 12:51:34,325 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 12:51:34,325 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 12:51:34,325 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 12:51:34,326 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 12:51:34,326 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 12:51:34,327 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 12:51:34,327 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 12:51:34,327 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 12:51:34,327 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 12:51:34,327 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 12:51:34,327 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 12:51:34,328 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 12:51:34,328 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 12:51:34,328 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 12:51:34,329 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 12:51:34,329 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 12:51:34,329 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 12:51:34,329 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 12:51:34,329 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 12:51:34,329 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 12:51:34,329 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 12:51:34,329 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 12:51:34,329 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 12:51:34,330 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 12:51:34,330 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 12:51:34,330 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 12:51:34,330 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 12:51:34,330 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 12:51:34,330 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 12:51:34,330 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 12:51:34,330 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 12:51:34,484 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 12:51:34,517 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 12:51:34,518 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 12:51:34,519 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 12:51:34,519 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 12:51:34,521 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-12.i [2023-12-24 12:51:35,544 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 12:51:35,700 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 12:51:35,700 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-12.i [2023-12-24 12:51:35,706 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dc1c161f/9606ecb4b4e04e1cbb61dd414e513c1f/FLAG4c4c44cd1 [2023-12-24 12:51:35,717 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dc1c161f/9606ecb4b4e04e1cbb61dd414e513c1f [2023-12-24 12:51:35,719 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 12:51:35,720 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 12:51:35,721 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 12:51:35,721 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 12:51:35,724 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 12:51:35,724 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 12:51:35" (1/1) ... [2023-12-24 12:51:35,725 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65f0c0ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:51:35, skipping insertion in model container [2023-12-24 12:51:35,725 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 12:51:35" (1/1) ... [2023-12-24 12:51:35,744 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 12:51:35,858 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-a_file-12.i[916,929] [2023-12-24 12:51:35,907 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 12:51:35,927 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 12:51:35,935 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-a_file-12.i[916,929] [2023-12-24 12:51:35,977 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 12:51:35,989 INFO L206 MainTranslator]: Completed translation [2023-12-24 12:51:35,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:51:35 WrapperNode [2023-12-24 12:51:35,989 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 12:51:35,990 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 12:51:35,990 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 12:51:35,990 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 12:51:35,994 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:51:35" (1/1) ... [2023-12-24 12:51:36,005 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:51:35" (1/1) ... [2023-12-24 12:51:36,029 INFO L138 Inliner]: procedures = 30, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 445 [2023-12-24 12:51:36,030 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 12:51:36,030 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 12:51:36,030 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 12:51:36,030 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 12:51:36,038 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:51:35" (1/1) ... [2023-12-24 12:51:36,038 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:51:35" (1/1) ... [2023-12-24 12:51:36,044 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:51:35" (1/1) ... [2023-12-24 12:51:36,055 INFO L175 MemorySlicer]: Split 123 memory accesses to 4 slices as follows [2, 38, 12, 71]. 58 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 2, 4]. The 14 writes are split as follows [0, 8, 2, 4]. [2023-12-24 12:51:36,055 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:51:35" (1/1) ... [2023-12-24 12:51:36,055 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:51:35" (1/1) ... [2023-12-24 12:51:36,069 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:51:35" (1/1) ... [2023-12-24 12:51:36,071 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:51:35" (1/1) ... [2023-12-24 12:51:36,073 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:51:35" (1/1) ... [2023-12-24 12:51:36,075 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:51:35" (1/1) ... [2023-12-24 12:51:36,078 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 12:51:36,079 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 12:51:36,079 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 12:51:36,079 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 12:51:36,079 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:51:35" (1/1) ... [2023-12-24 12:51:36,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 12:51:36,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 12:51:36,105 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 12:51:36,123 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 12:51:36,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 12:51:36,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-12-24 12:51:36,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-12-24 12:51:36,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-12-24 12:51:36,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-12-24 12:51:36,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 12:51:36,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-24 12:51:36,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-24 12:51:36,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-12-24 12:51:36,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2023-12-24 12:51:36,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2023-12-24 12:51:36,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2023-12-24 12:51:36,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2023-12-24 12:51:36,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-24 12:51:36,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-24 12:51:36,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-24 12:51:36,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-12-24 12:51:36,129 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-24 12:51:36,129 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-24 12:51:36,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 12:51:36,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 12:51:36,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2023-12-24 12:51:36,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2023-12-24 12:51:36,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2023-12-24 12:51:36,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2023-12-24 12:51:36,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-24 12:51:36,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-24 12:51:36,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-24 12:51:36,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-12-24 12:51:36,215 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 12:51:36,216 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 12:51:36,660 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 12:51:36,700 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 12:51:36,700 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 12:51:36,701 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 12:51:36 BoogieIcfgContainer [2023-12-24 12:51:36,701 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 12:51:36,702 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 12:51:36,703 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 12:51:36,705 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 12:51:36,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 12:51:35" (1/3) ... [2023-12-24 12:51:36,705 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4800b71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 12:51:36, skipping insertion in model container [2023-12-24 12:51:36,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:51:35" (2/3) ... [2023-12-24 12:51:36,706 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4800b71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 12:51:36, skipping insertion in model container [2023-12-24 12:51:36,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 12:51:36" (3/3) ... [2023-12-24 12:51:36,706 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-12.i [2023-12-24 12:51:36,723 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 12:51:36,723 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 12:51:36,760 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 12:51:36,765 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;@44ce9e3d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 12:51:36,765 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 12:51:36,768 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 73 states have internal predecessors, (103), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-24 12:51:36,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-24 12:51:36,778 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:51:36,778 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:51:36,778 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:51:36,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:51:36,782 INFO L85 PathProgramCache]: Analyzing trace with hash 403899770, now seen corresponding path program 1 times [2023-12-24 12:51:36,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:51:36,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [598729492] [2023-12-24 12:51:36,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:51:36,791 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 12:51:36,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:51:36,796 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 12:51:36,804 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 12:51:36,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:51:36,979 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 12:51:36,992 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:51:37,023 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2023-12-24 12:51:37,023 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 12:51:37,024 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:51:37,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [598729492] [2023-12-24 12:51:37,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [598729492] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 12:51:37,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 12:51:37,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 12:51:37,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491747416] [2023-12-24 12:51:37,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 12:51:37,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 12:51:37,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:51:37,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 12:51:37,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 12:51:37,058 INFO L87 Difference]: Start difference. First operand has 91 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 73 states have internal predecessors, (103), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-24 12:51:37,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:51:37,093 INFO L93 Difference]: Finished difference Result 173 states and 274 transitions. [2023-12-24 12:51:37,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 12:51:37,095 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 112 [2023-12-24 12:51:37,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:51:37,100 INFO L225 Difference]: With dead ends: 173 [2023-12-24 12:51:37,100 INFO L226 Difference]: Without dead ends: 83 [2023-12-24 12:51:37,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 111 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 12:51:37,105 INFO L413 NwaCegarLoop]: 114 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, 114 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 12:51:37,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 12:51:37,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-12-24 12:51:37,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2023-12-24 12:51:37,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 65 states have (on average 1.323076923076923) internal successors, (86), 65 states have internal predecessors, (86), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-24 12:51:37,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 118 transitions. [2023-12-24 12:51:37,175 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 118 transitions. Word has length 112 [2023-12-24 12:51:37,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:51:37,194 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 118 transitions. [2023-12-24 12:51:37,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-24 12:51:37,194 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 118 transitions. [2023-12-24 12:51:37,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-24 12:51:37,198 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:51:37,198 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:51:37,206 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 12:51:37,404 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 12:51:37,404 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:51:37,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:51:37,405 INFO L85 PathProgramCache]: Analyzing trace with hash 749419866, now seen corresponding path program 1 times [2023-12-24 12:51:37,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:51:37,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [80054659] [2023-12-24 12:51:37,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:51:37,406 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 12:51:37,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:51:37,408 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 12:51:37,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-24 12:51:37,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:51:37,538 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 12:51:37,541 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:51:37,582 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-24 12:51:37,582 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 12:51:37,583 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:51:37,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [80054659] [2023-12-24 12:51:37,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [80054659] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 12:51:37,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 12:51:37,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 12:51:37,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369030563] [2023-12-24 12:51:37,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 12:51:37,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 12:51:37,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:51:37,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 12:51:37,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 12:51:37,590 INFO L87 Difference]: Start difference. First operand 83 states and 118 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 12:51:37,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:51:37,642 INFO L93 Difference]: Finished difference Result 165 states and 235 transitions. [2023-12-24 12:51:37,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 12:51:37,644 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 112 [2023-12-24 12:51:37,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:51:37,647 INFO L225 Difference]: With dead ends: 165 [2023-12-24 12:51:37,647 INFO L226 Difference]: Without dead ends: 83 [2023-12-24 12:51:37,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 109 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 12:51:37,650 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 45 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 12:51:37,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 286 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 12:51:37,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-12-24 12:51:37,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2023-12-24 12:51:37,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 65 states have internal predecessors, (85), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-24 12:51:37,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 117 transitions. [2023-12-24 12:51:37,657 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 117 transitions. Word has length 112 [2023-12-24 12:51:37,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:51:37,658 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 117 transitions. [2023-12-24 12:51:37,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 12:51:37,658 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 117 transitions. [2023-12-24 12:51:37,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-24 12:51:37,660 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:51:37,660 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:51:37,668 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 12:51:37,867 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 12:51:37,869 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:51:37,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:51:37,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1850359588, now seen corresponding path program 1 times [2023-12-24 12:51:37,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:51:37,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [251824816] [2023-12-24 12:51:37,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:51:37,870 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 12:51:37,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:51:37,871 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 12:51:37,872 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 12:51:37,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:51:37,986 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 12:51:37,989 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:51:38,014 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-24 12:51:38,014 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 12:51:38,015 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:51:38,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [251824816] [2023-12-24 12:51:38,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [251824816] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 12:51:38,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 12:51:38,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 12:51:38,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220518656] [2023-12-24 12:51:38,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 12:51:38,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 12:51:38,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:51:38,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 12:51:38,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 12:51:38,016 INFO L87 Difference]: Start difference. First operand 83 states and 117 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 12:51:38,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:51:38,060 INFO L93 Difference]: Finished difference Result 177 states and 250 transitions. [2023-12-24 12:51:38,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 12:51:38,060 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 114 [2023-12-24 12:51:38,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:51:38,061 INFO L225 Difference]: With dead ends: 177 [2023-12-24 12:51:38,061 INFO L226 Difference]: Without dead ends: 95 [2023-12-24 12:51:38,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-24 12:51:38,063 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 65 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 12:51:38,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 410 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 12:51:38,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-12-24 12:51:38,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 86. [2023-12-24 12:51:38,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 68 states have (on average 1.2941176470588236) internal successors, (88), 68 states have internal predecessors, (88), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-24 12:51:38,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 120 transitions. [2023-12-24 12:51:38,079 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 120 transitions. Word has length 114 [2023-12-24 12:51:38,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:51:38,079 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 120 transitions. [2023-12-24 12:51:38,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 12:51:38,079 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 120 transitions. [2023-12-24 12:51:38,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-24 12:51:38,081 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:51:38,081 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:51:38,096 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 12:51:38,281 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 12:51:38,282 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:51:38,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:51:38,282 INFO L85 PathProgramCache]: Analyzing trace with hash -993604616, now seen corresponding path program 1 times [2023-12-24 12:51:38,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:51:38,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1704284923] [2023-12-24 12:51:38,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:51:38,283 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 12:51:38,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:51:38,284 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 12:51:38,299 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 12:51:38,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:51:38,452 INFO L262 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-24 12:51:38,456 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:51:38,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-24 12:51:38,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2023-12-24 12:51:38,740 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 12:51:38,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2023-12-24 12:51:39,517 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 12:51:39,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 55 [2023-12-24 12:51:39,704 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 12:51:39,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 98 treesize of output 48 [2023-12-24 12:51:39,757 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 128 proven. 84 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2023-12-24 12:51:39,757 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 12:51:39,892 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-24 12:51:39,892 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:51:39,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1704284923] [2023-12-24 12:51:39,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1704284923] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 12:51:39,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 12:51:39,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [16] total 19 [2023-12-24 12:51:39,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260054386] [2023-12-24 12:51:39,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 12:51:39,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 12:51:39,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:51:39,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 12:51:39,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2023-12-24 12:51:39,894 INFO L87 Difference]: Start difference. First operand 86 states and 120 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 12:51:40,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:51:40,034 INFO L93 Difference]: Finished difference Result 125 states and 169 transitions. [2023-12-24 12:51:40,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 12:51:40,034 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116 [2023-12-24 12:51:40,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:51:40,036 INFO L225 Difference]: With dead ends: 125 [2023-12-24 12:51:40,036 INFO L226 Difference]: Without dead ends: 123 [2023-12-24 12:51:40,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2023-12-24 12:51:40,037 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 57 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 12:51:40,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 514 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 12:51:40,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-12-24 12:51:40,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 110. [2023-12-24 12:51:40,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 92 states have (on average 1.2934782608695652) internal successors, (119), 92 states have internal predecessors, (119), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-24 12:51:40,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 151 transitions. [2023-12-24 12:51:40,044 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 151 transitions. Word has length 116 [2023-12-24 12:51:40,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:51:40,044 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 151 transitions. [2023-12-24 12:51:40,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 12:51:40,045 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 151 transitions. [2023-12-24 12:51:40,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-24 12:51:40,046 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:51:40,046 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:51:40,051 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 12:51:40,251 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 12:51:40,251 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:51:40,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:51:40,252 INFO L85 PathProgramCache]: Analyzing trace with hash 604343881, now seen corresponding path program 1 times [2023-12-24 12:51:40,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:51:40,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [545071625] [2023-12-24 12:51:40,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:51:40,252 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 12:51:40,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:51:40,255 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 12:51:40,256 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 12:51:40,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:51:40,380 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-24 12:51:40,383 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:51:40,742 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 12:51:40,746 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 95 treesize of output 45 [2023-12-24 12:51:40,849 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-24 12:51:40,850 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 12:51:40,850 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:51:40,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [545071625] [2023-12-24 12:51:40,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [545071625] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 12:51:40,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 12:51:40,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-24 12:51:40,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522927516] [2023-12-24 12:51:40,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 12:51:40,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 12:51:40,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:51:40,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 12:51:40,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-24 12:51:40,851 INFO L87 Difference]: Start difference. First operand 110 states and 151 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 12:51:41,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:51:41,721 INFO L93 Difference]: Finished difference Result 278 states and 379 transitions. [2023-12-24 12:51:41,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 12:51:41,723 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 117 [2023-12-24 12:51:41,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:51:41,724 INFO L225 Difference]: With dead ends: 278 [2023-12-24 12:51:41,725 INFO L226 Difference]: Without dead ends: 169 [2023-12-24 12:51:41,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-24 12:51:41,726 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 87 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-24 12:51:41,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 623 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-24 12:51:41,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2023-12-24 12:51:41,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 165. [2023-12-24 12:51:41,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 136 states have (on average 1.2720588235294117) internal successors, (173), 137 states have internal predecessors, (173), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-24 12:51:41,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 225 transitions. [2023-12-24 12:51:41,742 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 225 transitions. Word has length 117 [2023-12-24 12:51:41,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:51:41,742 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 225 transitions. [2023-12-24 12:51:41,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 12:51:41,742 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 225 transitions. [2023-12-24 12:51:41,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-24 12:51:41,744 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:51:41,744 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:51:41,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 (6)] Forceful destruction successful, exit code 0 [2023-12-24 12:51:41,947 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 12:51:41,947 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:51:41,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:51:41,948 INFO L85 PathProgramCache]: Analyzing trace with hash -538292957, now seen corresponding path program 1 times [2023-12-24 12:51:41,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:51:41,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [673121493] [2023-12-24 12:51:41,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:51:41,948 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 12:51:41,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:51:41,949 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 12:51:41,982 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 12:51:42,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:51:42,071 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-24 12:51:42,074 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:51:42,179 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 12:51:42,180 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 69 treesize of output 31 [2023-12-24 12:51:42,229 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-24 12:51:42,229 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 12:51:42,229 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:51:42,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [673121493] [2023-12-24 12:51:42,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [673121493] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 12:51:42,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 12:51:42,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 12:51:42,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556053438] [2023-12-24 12:51:42,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 12:51:42,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 12:51:42,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:51:42,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 12:51:42,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 12:51:42,230 INFO L87 Difference]: Start difference. First operand 165 states and 225 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 12:51:42,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:51:42,636 INFO L93 Difference]: Finished difference Result 359 states and 488 transitions. [2023-12-24 12:51:42,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 12:51:42,637 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2023-12-24 12:51:42,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:51:42,639 INFO L225 Difference]: With dead ends: 359 [2023-12-24 12:51:42,639 INFO L226 Difference]: Without dead ends: 195 [2023-12-24 12:51:42,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-24 12:51:42,640 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 57 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-24 12:51:42,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 334 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-24 12:51:42,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2023-12-24 12:51:42,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 165. [2023-12-24 12:51:42,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 136 states have (on average 1.2647058823529411) internal successors, (172), 137 states have internal predecessors, (172), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-24 12:51:42,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 224 transitions. [2023-12-24 12:51:42,650 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 224 transitions. Word has length 118 [2023-12-24 12:51:42,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:51:42,651 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 224 transitions. [2023-12-24 12:51:42,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 12:51:42,651 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 224 transitions. [2023-12-24 12:51:42,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-24 12:51:42,652 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:51:42,652 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:51:42,663 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 (7)] Ended with exit code 0 [2023-12-24 12:51:42,863 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 12:51:42,864 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:51:42,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:51:42,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1566305001, now seen corresponding path program 1 times [2023-12-24 12:51:42,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:51:42,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1482442252] [2023-12-24 12:51:42,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:51:42,865 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 12:51:42,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:51:42,866 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 12:51:42,868 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 12:51:42,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:51:42,976 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 12:51:42,979 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:51:43,016 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 12:51:43,017 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 30 treesize of output 10 [2023-12-24 12:51:43,024 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-24 12:51:43,024 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 12:51:43,024 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:51:43,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1482442252] [2023-12-24 12:51:43,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1482442252] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 12:51:43,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 12:51:43,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 12:51:43,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165124690] [2023-12-24 12:51:43,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 12:51:43,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 12:51:43,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:51:43,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 12:51:43,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 12:51:43,025 INFO L87 Difference]: Start difference. First operand 165 states and 224 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 12:51:43,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:51:43,111 INFO L93 Difference]: Finished difference Result 449 states and 599 transitions. [2023-12-24 12:51:43,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 12:51:43,111 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2023-12-24 12:51:43,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:51:43,113 INFO L225 Difference]: With dead ends: 449 [2023-12-24 12:51:43,113 INFO L226 Difference]: Without dead ends: 285 [2023-12-24 12:51:43,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-24 12:51:43,114 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 83 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 12:51:43,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 474 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 12:51:43,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2023-12-24 12:51:43,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 260. [2023-12-24 12:51:43,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 217 states have (on average 1.2258064516129032) internal successors, (266), 220 states have internal predecessors, (266), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2023-12-24 12:51:43,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 342 transitions. [2023-12-24 12:51:43,127 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 342 transitions. Word has length 119 [2023-12-24 12:51:43,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:51:43,127 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 342 transitions. [2023-12-24 12:51:43,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 12:51:43,127 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 342 transitions. [2023-12-24 12:51:43,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-24 12:51:43,128 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:51:43,128 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:51:43,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-12-24 12:51:43,332 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 12:51:43,333 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:51:43,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:51:43,333 INFO L85 PathProgramCache]: Analyzing trace with hash -445192402, now seen corresponding path program 1 times [2023-12-24 12:51:43,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:51:43,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1420381829] [2023-12-24 12:51:43,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:51:43,334 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 12:51:43,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:51:43,335 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 12:51:43,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-24 12:51:43,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:51:43,449 INFO L262 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-24 12:51:43,455 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:51:43,645 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 39 treesize of output 21 [2023-12-24 12:51:43,655 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 225 proven. 30 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2023-12-24 12:51:43,655 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 12:51:43,826 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-12-24 12:51:43,826 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:51:43,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1420381829] [2023-12-24 12:51:43,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1420381829] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 12:51:43,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 12:51:43,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2023-12-24 12:51:43,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968134727] [2023-12-24 12:51:43,826 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 12:51:43,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-24 12:51:43,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:51:43,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-24 12:51:43,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-12-24 12:51:43,828 INFO L87 Difference]: Start difference. First operand 260 states and 342 transitions. Second operand has 10 states, 8 states have (on average 6.5) internal successors, (52), 10 states have internal predecessors, (52), 4 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (27), 2 states have call predecessors, (27), 4 states have call successors, (27) [2023-12-24 12:51:44,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:51:44,110 INFO L93 Difference]: Finished difference Result 547 states and 707 transitions. [2023-12-24 12:51:44,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-24 12:51:44,111 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 6.5) internal successors, (52), 10 states have internal predecessors, (52), 4 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (27), 2 states have call predecessors, (27), 4 states have call successors, (27) Word has length 119 [2023-12-24 12:51:44,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:51:44,124 INFO L225 Difference]: With dead ends: 547 [2023-12-24 12:51:44,125 INFO L226 Difference]: Without dead ends: 288 [2023-12-24 12:51:44,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 227 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2023-12-24 12:51:44,126 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 132 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 12:51:44,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 344 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 12:51:44,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2023-12-24 12:51:44,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 260. [2023-12-24 12:51:44,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 219 states have (on average 1.2146118721461188) internal successors, (266), 222 states have internal predecessors, (266), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-24 12:51:44,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 334 transitions. [2023-12-24 12:51:44,141 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 334 transitions. Word has length 119 [2023-12-24 12:51:44,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:51:44,141 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 334 transitions. [2023-12-24 12:51:44,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 6.5) internal successors, (52), 10 states have internal predecessors, (52), 4 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (27), 2 states have call predecessors, (27), 4 states have call successors, (27) [2023-12-24 12:51:44,142 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 334 transitions. [2023-12-24 12:51:44,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-24 12:51:44,143 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:51:44,143 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:51:44,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-24 12:51:44,347 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 12:51:44,347 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:51:44,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:51:44,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1786887988, now seen corresponding path program 1 times [2023-12-24 12:51:44,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:51:44,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [184609922] [2023-12-24 12:51:44,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:51:44,348 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 12:51:44,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:51:44,349 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 12:51:44,359 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 12:51:44,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:51:44,507 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-24 12:51:44,511 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:51:44,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-24 12:51:44,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2023-12-24 12:51:45,310 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 12:51:45,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 44 [2023-12-24 12:51:45,465 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 12:51:45,466 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 98 treesize of output 44 [2023-12-24 12:51:45,524 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 138 proven. 72 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2023-12-24 12:51:45,525 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 12:51:45,682 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-24 12:51:45,682 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:51:45,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [184609922] [2023-12-24 12:51:45,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [184609922] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 12:51:45,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 12:51:45,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [16] total 20 [2023-12-24 12:51:45,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680773613] [2023-12-24 12:51:45,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 12:51:45,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 12:51:45,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:51:45,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 12:51:45,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2023-12-24 12:51:45,684 INFO L87 Difference]: Start difference. First operand 260 states and 334 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 12:51:45,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:51:45,915 INFO L93 Difference]: Finished difference Result 294 states and 371 transitions. [2023-12-24 12:51:45,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-24 12:51:45,915 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2023-12-24 12:51:45,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:51:45,916 INFO L225 Difference]: With dead ends: 294 [2023-12-24 12:51:45,916 INFO L226 Difference]: Without dead ends: 292 [2023-12-24 12:51:45,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2023-12-24 12:51:45,917 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 65 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 12:51:45,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 770 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 12:51:45,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2023-12-24 12:51:45,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 288. [2023-12-24 12:51:45,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 241 states have (on average 1.1991701244813278) internal successors, (289), 246 states have internal predecessors, (289), 38 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 33 states have call predecessors, (38), 38 states have call successors, (38) [2023-12-24 12:51:45,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 365 transitions. [2023-12-24 12:51:45,933 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 365 transitions. Word has length 119 [2023-12-24 12:51:45,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:51:45,935 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 365 transitions. [2023-12-24 12:51:45,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 12:51:45,935 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 365 transitions. [2023-12-24 12:51:45,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-24 12:51:45,936 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:51:45,936 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:51:45,958 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 12:51:46,140 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 12:51:46,141 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:51:46,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:51:46,141 INFO L85 PathProgramCache]: Analyzing trace with hash 787874196, now seen corresponding path program 1 times [2023-12-24 12:51:46,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:51:46,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2141042177] [2023-12-24 12:51:46,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:51:46,142 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 12:51:46,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:51:46,157 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 12:51:46,168 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 12:51:46,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:51:46,280 INFO L262 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-24 12:51:46,283 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:51:46,399 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 12:51:46,400 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 68 treesize of output 30 [2023-12-24 12:51:46,456 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-24 12:51:46,456 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 12:51:46,456 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:51:46,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2141042177] [2023-12-24 12:51:46,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2141042177] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 12:51:46,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 12:51:46,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 12:51:46,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198994203] [2023-12-24 12:51:46,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 12:51:46,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 12:51:46,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:51:46,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 12:51:46,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 12:51:46,457 INFO L87 Difference]: Start difference. First operand 288 states and 365 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 12:51:46,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:51:46,922 INFO L93 Difference]: Finished difference Result 616 states and 775 transitions. [2023-12-24 12:51:46,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 12:51:46,923 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 121 [2023-12-24 12:51:46,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:51:46,924 INFO L225 Difference]: With dead ends: 616 [2023-12-24 12:51:46,924 INFO L226 Difference]: Without dead ends: 329 [2023-12-24 12:51:46,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-24 12:51:46,925 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 77 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-24 12:51:46,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 467 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-24 12:51:46,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2023-12-24 12:51:46,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 280. [2023-12-24 12:51:46,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 236 states have (on average 1.1906779661016949) internal successors, (281), 239 states have internal predecessors, (281), 34 states have call successors, (34), 9 states have call predecessors, (34), 9 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-24 12:51:46,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 349 transitions. [2023-12-24 12:51:46,939 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 349 transitions. Word has length 121 [2023-12-24 12:51:46,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:51:46,939 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 349 transitions. [2023-12-24 12:51:46,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 12:51:46,939 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 349 transitions. [2023-12-24 12:51:46,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-24 12:51:46,940 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:51:46,940 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:51:46,945 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 12:51:47,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 12:51:47,145 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:51:47,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:51:47,145 INFO L85 PathProgramCache]: Analyzing trace with hash 678083641, now seen corresponding path program 1 times [2023-12-24 12:51:47,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:51:47,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1967123151] [2023-12-24 12:51:47,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:51:47,146 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 12:51:47,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:51:47,147 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 12:51:47,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-24 12:51:47,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:51:47,301 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-24 12:51:47,308 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:51:47,435 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 12:51:47,435 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 71 treesize of output 33 [2023-12-24 12:51:47,509 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-24 12:51:47,509 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 12:51:47,509 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:51:47,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1967123151] [2023-12-24 12:51:47,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1967123151] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 12:51:47,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 12:51:47,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-24 12:51:47,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564075229] [2023-12-24 12:51:47,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 12:51:47,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 12:51:47,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:51:47,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 12:51:47,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-24 12:51:47,511 INFO L87 Difference]: Start difference. First operand 280 states and 349 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 12:51:47,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:51:47,953 INFO L93 Difference]: Finished difference Result 576 states and 716 transitions. [2023-12-24 12:51:47,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 12:51:47,956 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 121 [2023-12-24 12:51:47,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:51:47,959 INFO L225 Difference]: With dead ends: 576 [2023-12-24 12:51:47,959 INFO L226 Difference]: Without dead ends: 297 [2023-12-24 12:51:47,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-24 12:51:47,962 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 69 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-24 12:51:47,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 391 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-24 12:51:47,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2023-12-24 12:51:47,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 266. [2023-12-24 12:51:47,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 222 states have (on average 1.1711711711711712) internal successors, (260), 225 states have internal predecessors, (260), 34 states have call successors, (34), 9 states have call predecessors, (34), 9 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-24 12:51:47,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 328 transitions. [2023-12-24 12:51:47,982 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 328 transitions. Word has length 121 [2023-12-24 12:51:47,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:51:47,982 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 328 transitions. [2023-12-24 12:51:47,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 12:51:47,983 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 328 transitions. [2023-12-24 12:51:47,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-24 12:51:47,984 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:51:47,984 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:51:47,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-12-24 12:51:48,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 12:51:48,189 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:51:48,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:51:48,190 INFO L85 PathProgramCache]: Analyzing trace with hash 2065861567, now seen corresponding path program 1 times [2023-12-24 12:51:48,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:51:48,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1045476289] [2023-12-24 12:51:48,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:51:48,190 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 12:51:48,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:51:48,199 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 12:51:48,200 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 12:51:48,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:51:48,352 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-24 12:51:48,354 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:51:48,551 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 12:51:48,551 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 70 treesize of output 32 [2023-12-24 12:51:48,601 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-24 12:51:48,602 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 12:51:48,602 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:51:48,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1045476289] [2023-12-24 12:51:48,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1045476289] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 12:51:48,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 12:51:48,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-24 12:51:48,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716441461] [2023-12-24 12:51:48,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 12:51:48,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 12:51:48,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:51:48,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 12:51:48,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-24 12:51:48,603 INFO L87 Difference]: Start difference. First operand 266 states and 328 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 12:51:49,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:51:49,179 INFO L93 Difference]: Finished difference Result 579 states and 714 transitions. [2023-12-24 12:51:49,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 12:51:49,180 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 123 [2023-12-24 12:51:49,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:51:49,181 INFO L225 Difference]: With dead ends: 579 [2023-12-24 12:51:49,181 INFO L226 Difference]: Without dead ends: 314 [2023-12-24 12:51:49,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-24 12:51:49,182 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 82 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-24 12:51:49,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 573 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-24 12:51:49,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2023-12-24 12:51:49,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 266. [2023-12-24 12:51:49,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 222 states have (on average 1.162162162162162) internal successors, (258), 225 states have internal predecessors, (258), 34 states have call successors, (34), 9 states have call predecessors, (34), 9 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-24 12:51:49,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 326 transitions. [2023-12-24 12:51:49,196 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 326 transitions. Word has length 123 [2023-12-24 12:51:49,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:51:49,197 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 326 transitions. [2023-12-24 12:51:49,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 12:51:49,197 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 326 transitions. [2023-12-24 12:51:49,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-24 12:51:49,198 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:51:49,198 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:51:49,202 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 12:51:49,402 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 12:51:49,402 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:51:49,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:51:49,403 INFO L85 PathProgramCache]: Analyzing trace with hash -633145617, now seen corresponding path program 1 times [2023-12-24 12:51:49,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:51:49,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [303368486] [2023-12-24 12:51:49,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:51:49,403 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 12:51:49,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:51:49,404 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 12:51:49,405 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 12:51:49,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:51:49,528 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 12:51:49,530 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:51:49,553 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 12:51:49,553 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 37 treesize of output 17 [2023-12-24 12:51:49,571 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-24 12:51:49,572 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 12:51:49,572 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:51:49,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [303368486] [2023-12-24 12:51:49,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [303368486] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 12:51:49,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 12:51:49,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 12:51:49,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453524792] [2023-12-24 12:51:49,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 12:51:49,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 12:51:49,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:51:49,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 12:51:49,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 12:51:49,573 INFO L87 Difference]: Start difference. First operand 266 states and 326 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 12:51:49,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:51:49,904 INFO L93 Difference]: Finished difference Result 694 states and 856 transitions. [2023-12-24 12:51:49,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 12:51:49,905 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 124 [2023-12-24 12:51:49,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:51:49,907 INFO L225 Difference]: With dead ends: 694 [2023-12-24 12:51:49,907 INFO L226 Difference]: Without dead ends: 429 [2023-12-24 12:51:49,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-24 12:51:49,910 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 110 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-24 12:51:49,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 410 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-24 12:51:49,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2023-12-24 12:51:49,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 268. [2023-12-24 12:51:49,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 224 states have (on average 1.1651785714285714) internal successors, (261), 227 states have internal predecessors, (261), 34 states have call successors, (34), 9 states have call predecessors, (34), 9 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-24 12:51:49,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 329 transitions. [2023-12-24 12:51:49,933 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 329 transitions. Word has length 124 [2023-12-24 12:51:49,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:51:49,933 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 329 transitions. [2023-12-24 12:51:49,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 12:51:49,933 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 329 transitions. [2023-12-24 12:51:49,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-24 12:51:49,935 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:51:49,935 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:51:49,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-12-24 12:51:50,140 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 12:51:50,141 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:51:50,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:51:50,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1856383345, now seen corresponding path program 1 times [2023-12-24 12:51:50,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:51:50,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1465639917] [2023-12-24 12:51:50,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:51:50,142 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 12:51:50,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:51:50,148 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 12:51:50,150 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 12:51:50,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:51:50,297 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-24 12:51:50,300 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:51:50,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-24 12:51:50,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-12-24 12:51:50,350 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 29 treesize of output 13 [2023-12-24 12:51:50,466 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 12:51:50,467 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 40 treesize of output 20 [2023-12-24 12:51:50,496 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 231 proven. 12 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2023-12-24 12:51:50,496 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 12:51:50,803 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 72 proven. 15 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2023-12-24 12:51:50,803 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:51:50,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1465639917] [2023-12-24 12:51:50,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1465639917] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 12:51:50,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 12:51:50,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2023-12-24 12:51:50,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158067162] [2023-12-24 12:51:50,803 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 12:51:50,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-24 12:51:50,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:51:50,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-24 12:51:50,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2023-12-24 12:51:50,805 INFO L87 Difference]: Start difference. First operand 268 states and 329 transitions. Second operand has 21 states, 17 states have (on average 4.235294117647059) internal successors, (72), 21 states have internal predecessors, (72), 8 states have call successors, (21), 3 states have call predecessors, (21), 7 states have return successors, (21), 4 states have call predecessors, (21), 8 states have call successors, (21) [2023-12-24 12:51:51,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:51:51,473 INFO L93 Difference]: Finished difference Result 558 states and 679 transitions. [2023-12-24 12:51:51,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-24 12:51:51,473 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 4.235294117647059) internal successors, (72), 21 states have internal predecessors, (72), 8 states have call successors, (21), 3 states have call predecessors, (21), 7 states have return successors, (21), 4 states have call predecessors, (21), 8 states have call successors, (21) Word has length 124 [2023-12-24 12:51:51,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:51:51,475 INFO L225 Difference]: With dead ends: 558 [2023-12-24 12:51:51,476 INFO L226 Difference]: Without dead ends: 291 [2023-12-24 12:51:51,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 226 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=206, Invalid=664, Unknown=0, NotChecked=0, Total=870 [2023-12-24 12:51:51,477 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 124 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-24 12:51:51,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 427 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-24 12:51:51,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2023-12-24 12:51:51,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 275. [2023-12-24 12:51:51,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 229 states have (on average 1.1572052401746724) internal successors, (265), 232 states have internal predecessors, (265), 34 states have call successors, (34), 11 states have call predecessors, (34), 11 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-24 12:51:51,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 333 transitions. [2023-12-24 12:51:51,492 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 333 transitions. Word has length 124 [2023-12-24 12:51:51,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:51:51,492 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 333 transitions. [2023-12-24 12:51:51,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 4.235294117647059) internal successors, (72), 21 states have internal predecessors, (72), 8 states have call successors, (21), 3 states have call predecessors, (21), 7 states have return successors, (21), 4 states have call predecessors, (21), 8 states have call successors, (21) [2023-12-24 12:51:51,493 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 333 transitions. [2023-12-24 12:51:51,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-24 12:51:51,493 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:51:51,493 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:51:51,512 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 12:51:51,698 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 12:51:51,698 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:51:51,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:51:51,699 INFO L85 PathProgramCache]: Analyzing trace with hash 214101926, now seen corresponding path program 1 times [2023-12-24 12:51:51,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:51:51,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [213170495] [2023-12-24 12:51:51,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:51:51,700 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 12:51:51,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:51:51,701 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 12:51:51,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-12-24 12:51:51,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:51:51,830 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 12:51:51,832 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:51:51,854 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 12:51:51,855 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 37 treesize of output 17 [2023-12-24 12:51:51,871 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-24 12:51:51,871 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 12:51:51,872 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:51:51,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [213170495] [2023-12-24 12:51:51,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [213170495] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 12:51:51,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 12:51:51,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 12:51:51,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765873712] [2023-12-24 12:51:51,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 12:51:51,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 12:51:51,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:51:51,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 12:51:51,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 12:51:51,873 INFO L87 Difference]: Start difference. First operand 275 states and 333 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 12:51:52,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:51:52,189 INFO L93 Difference]: Finished difference Result 708 states and 864 transitions. [2023-12-24 12:51:52,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 12:51:52,190 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 124 [2023-12-24 12:51:52,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:51:52,191 INFO L225 Difference]: With dead ends: 708 [2023-12-24 12:51:52,191 INFO L226 Difference]: Without dead ends: 434 [2023-12-24 12:51:52,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-24 12:51:52,192 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 102 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-24 12:51:52,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 410 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-24 12:51:52,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2023-12-24 12:51:52,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 276. [2023-12-24 12:51:52,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 230 states have (on average 1.1565217391304348) internal successors, (266), 233 states have internal predecessors, (266), 34 states have call successors, (34), 11 states have call predecessors, (34), 11 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-24 12:51:52,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 334 transitions. [2023-12-24 12:51:52,208 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 334 transitions. Word has length 124 [2023-12-24 12:51:52,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:51:52,209 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 334 transitions. [2023-12-24 12:51:52,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 12:51:52,209 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 334 transitions. [2023-12-24 12:51:52,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-24 12:51:52,209 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:51:52,210 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:51:52,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-12-24 12:51:52,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 12:51:52,414 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:51:52,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:51:52,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1591336408, now seen corresponding path program 1 times [2023-12-24 12:51:52,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:51:52,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [907078744] [2023-12-24 12:51:52,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:51:52,415 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 12:51:52,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:51:52,416 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 12:51:52,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-12-24 12:51:52,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:51:52,587 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-24 12:51:52,594 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:51:52,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-24 12:51:52,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-12-24 12:51:52,721 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 12:51:52,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37 [2023-12-24 12:51:52,921 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 12:51:52,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 43 [2023-12-24 12:51:52,982 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 12:51:52,982 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 56 treesize of output 26 [2023-12-24 12:51:53,029 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 229 proven. 15 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2023-12-24 12:51:53,029 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 12:51:53,177 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-24 12:51:53,177 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:51:53,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [907078744] [2023-12-24 12:51:53,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [907078744] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 12:51:53,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 12:51:53,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 17 [2023-12-24 12:51:53,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91707423] [2023-12-24 12:51:53,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 12:51:53,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 12:51:53,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:51:53,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 12:51:53,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2023-12-24 12:51:53,178 INFO L87 Difference]: Start difference. First operand 276 states and 334 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 12:51:53,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:51:53,386 INFO L93 Difference]: Finished difference Result 769 states and 940 transitions. [2023-12-24 12:51:53,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 12:51:53,388 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 124 [2023-12-24 12:51:53,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:51:53,390 INFO L225 Difference]: With dead ends: 769 [2023-12-24 12:51:53,390 INFO L226 Difference]: Without dead ends: 494 [2023-12-24 12:51:53,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2023-12-24 12:51:53,391 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 134 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 12:51:53,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 455 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 12:51:53,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2023-12-24 12:51:53,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 309. [2023-12-24 12:51:53,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 263 states have (on average 1.1596958174904943) internal successors, (305), 266 states have internal predecessors, (305), 34 states have call successors, (34), 11 states have call predecessors, (34), 11 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-24 12:51:53,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 373 transitions. [2023-12-24 12:51:53,413 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 373 transitions. Word has length 124 [2023-12-24 12:51:53,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:51:53,414 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 373 transitions. [2023-12-24 12:51:53,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 12:51:53,414 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 373 transitions. [2023-12-24 12:51:53,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-24 12:51:53,415 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:51:53,415 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:51:53,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-12-24 12:51:53,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 12:51:53,620 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:51:53,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:51:53,621 INFO L85 PathProgramCache]: Analyzing trace with hash -890271830, now seen corresponding path program 1 times [2023-12-24 12:51:53,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:51:53,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1292967745] [2023-12-24 12:51:53,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:51:53,622 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 12:51:53,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:51:53,623 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 12:51:53,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-12-24 12:51:53,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:51:53,772 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 12:51:53,774 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:51:53,798 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 12:51:53,799 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 37 treesize of output 17 [2023-12-24 12:51:53,822 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-24 12:51:53,822 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 12:51:53,822 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:51:53,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1292967745] [2023-12-24 12:51:53,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1292967745] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 12:51:53,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 12:51:53,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 12:51:53,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16527831] [2023-12-24 12:51:53,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 12:51:53,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 12:51:53,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:51:53,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 12:51:53,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 12:51:53,824 INFO L87 Difference]: Start difference. First operand 309 states and 373 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 12:51:54,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:51:54,087 INFO L93 Difference]: Finished difference Result 811 states and 981 transitions. [2023-12-24 12:51:54,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 12:51:54,099 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 124 [2023-12-24 12:51:54,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:51:54,101 INFO L225 Difference]: With dead ends: 811 [2023-12-24 12:51:54,101 INFO L226 Difference]: Without dead ends: 503 [2023-12-24 12:51:54,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-24 12:51:54,104 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 185 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 12:51:54,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 404 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 12:51:54,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2023-12-24 12:51:54,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 315. [2023-12-24 12:51:54,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 269 states have (on average 1.1672862453531598) internal successors, (314), 272 states have internal predecessors, (314), 34 states have call successors, (34), 11 states have call predecessors, (34), 11 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-24 12:51:54,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 382 transitions. [2023-12-24 12:51:54,125 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 382 transitions. Word has length 124 [2023-12-24 12:51:54,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:51:54,126 INFO L495 AbstractCegarLoop]: Abstraction has 315 states and 382 transitions. [2023-12-24 12:51:54,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 12:51:54,127 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 382 transitions. [2023-12-24 12:51:54,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-24 12:51:54,128 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:51:54,128 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:51:54,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-12-24 12:51:54,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 12:51:54,332 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:51:54,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:51:54,333 INFO L85 PathProgramCache]: Analyzing trace with hash -210213460, now seen corresponding path program 1 times [2023-12-24 12:51:54,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:51:54,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1607366654] [2023-12-24 12:51:54,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:51:54,333 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 12:51:54,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:51:54,334 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 12:51:54,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-12-24 12:51:54,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:51:54,524 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 38 conjunts are in the unsatisfiable core [2023-12-24 12:51:54,528 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:51:54,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-24 12:51:54,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2023-12-24 12:51:54,644 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 39 treesize of output 26 [2023-12-24 12:51:55,033 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 12:51:55,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 58 [2023-12-24 12:51:55,335 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 12:51:55,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 88 treesize of output 40 [2023-12-24 12:51:55,579 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 231 proven. 12 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2023-12-24 12:51:55,579 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 12:51:56,045 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-24 12:51:56,045 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:51:56,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1607366654] [2023-12-24 12:51:56,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1607366654] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 12:51:56,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 12:51:56,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [24] total 33 [2023-12-24 12:51:56,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202586339] [2023-12-24 12:51:56,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 12:51:56,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-24 12:51:56,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:51:56,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-24 12:51:56,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=940, Unknown=0, NotChecked=0, Total=1056 [2023-12-24 12:51:56,047 INFO L87 Difference]: Start difference. First operand 315 states and 382 transitions. Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 12:51:57,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:51:57,371 INFO L93 Difference]: Finished difference Result 888 states and 1078 transitions. [2023-12-24 12:51:57,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-24 12:51:57,372 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 124 [2023-12-24 12:51:57,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:51:57,373 INFO L225 Difference]: With dead ends: 888 [2023-12-24 12:51:57,373 INFO L226 Difference]: Without dead ends: 574 [2023-12-24 12:51:57,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=271, Invalid=2179, Unknown=0, NotChecked=0, Total=2450 [2023-12-24 12:51:57,375 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 298 mSDsluCounter, 1481 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 1647 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-24 12:51:57,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 1647 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-24 12:51:57,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2023-12-24 12:51:57,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 366. [2023-12-24 12:51:57,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 320 states have (on average 1.196875) internal successors, (383), 323 states have internal predecessors, (383), 34 states have call successors, (34), 11 states have call predecessors, (34), 11 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-24 12:51:57,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 451 transitions. [2023-12-24 12:51:57,395 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 451 transitions. Word has length 124 [2023-12-24 12:51:57,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:51:57,395 INFO L495 AbstractCegarLoop]: Abstraction has 366 states and 451 transitions. [2023-12-24 12:51:57,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 12:51:57,395 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 451 transitions. [2023-12-24 12:51:57,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-24 12:51:57,396 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:51:57,396 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:51:57,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2023-12-24 12:51:57,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 12:51:57,601 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:51:57,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:51:57,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1460146867, now seen corresponding path program 1 times [2023-12-24 12:51:57,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:51:57,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1119018611] [2023-12-24 12:51:57,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:51:57,602 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 12:51:57,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:51:57,604 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 12:51:57,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-12-24 12:51:57,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:51:57,770 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 12:51:57,773 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:51:57,802 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 12:51:57,802 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 37 treesize of output 17 [2023-12-24 12:51:57,837 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-24 12:51:57,837 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 12:51:57,837 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:51:57,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1119018611] [2023-12-24 12:51:57,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1119018611] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 12:51:57,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 12:51:57,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 12:51:57,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237640059] [2023-12-24 12:51:57,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 12:51:57,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 12:51:57,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:51:57,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 12:51:57,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 12:51:57,839 INFO L87 Difference]: Start difference. First operand 366 states and 451 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 12:51:58,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:51:58,144 INFO L93 Difference]: Finished difference Result 943 states and 1149 transitions. [2023-12-24 12:51:58,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 12:51:58,160 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 124 [2023-12-24 12:51:58,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:51:58,162 INFO L225 Difference]: With dead ends: 943 [2023-12-24 12:51:58,162 INFO L226 Difference]: Without dead ends: 578 [2023-12-24 12:51:58,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-24 12:51:58,163 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 150 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 12:51:58,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 419 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 12:51:58,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2023-12-24 12:51:58,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 369. [2023-12-24 12:51:58,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 323 states have (on average 1.195046439628483) internal successors, (386), 326 states have internal predecessors, (386), 34 states have call successors, (34), 11 states have call predecessors, (34), 11 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-24 12:51:58,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 454 transitions. [2023-12-24 12:51:58,199 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 454 transitions. Word has length 124 [2023-12-24 12:51:58,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:51:58,199 INFO L495 AbstractCegarLoop]: Abstraction has 369 states and 454 transitions. [2023-12-24 12:51:58,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 12:51:58,199 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 454 transitions. [2023-12-24 12:51:58,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-24 12:51:58,200 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:51:58,200 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:51:58,207 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 (20)] Ended with exit code 0 [2023-12-24 12:51:58,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 12:51:58,405 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:51:58,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:51:58,405 INFO L85 PathProgramCache]: Analyzing trace with hash 2140205237, now seen corresponding path program 1 times [2023-12-24 12:51:58,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:51:58,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1741902409] [2023-12-24 12:51:58,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:51:58,405 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 12:51:58,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:51:58,407 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 12:51:58,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-12-24 12:51:58,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:51:58,581 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-24 12:51:58,589 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:51:58,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-24 12:51:58,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-12-24 12:51:58,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2023-12-24 12:51:58,785 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 12:51:58,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 45 [2023-12-24 12:51:58,919 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 12:51:58,920 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 61 treesize of output 29 [2023-12-24 12:51:58,947 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2023-12-24 12:51:58,947 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 12:51:58,947 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:51:58,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1741902409] [2023-12-24 12:51:58,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1741902409] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 12:51:58,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 12:51:58,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-24 12:51:58,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249038672] [2023-12-24 12:51:58,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 12:51:58,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-24 12:51:58,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:51:58,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-24 12:51:58,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-12-24 12:51:58,949 INFO L87 Difference]: Start difference. First operand 369 states and 454 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 3 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2023-12-24 12:51:59,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:51:59,559 INFO L93 Difference]: Finished difference Result 869 states and 1061 transitions. [2023-12-24 12:51:59,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-24 12:51:59,560 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 3 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 124 [2023-12-24 12:51:59,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:51:59,561 INFO L225 Difference]: With dead ends: 869 [2023-12-24 12:51:59,561 INFO L226 Difference]: Without dead ends: 501 [2023-12-24 12:51:59,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 115 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-12-24 12:51:59,563 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 304 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-24 12:51:59,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 419 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-24 12:51:59,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2023-12-24 12:51:59,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 372. [2023-12-24 12:51:59,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 326 states have (on average 1.1932515337423313) internal successors, (389), 329 states have internal predecessors, (389), 34 states have call successors, (34), 11 states have call predecessors, (34), 11 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-24 12:51:59,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 457 transitions. [2023-12-24 12:51:59,583 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 457 transitions. Word has length 124 [2023-12-24 12:51:59,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:51:59,583 INFO L495 AbstractCegarLoop]: Abstraction has 372 states and 457 transitions. [2023-12-24 12:51:59,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 3 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2023-12-24 12:51:59,584 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 457 transitions. [2023-12-24 12:51:59,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-24 12:51:59,584 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:51:59,584 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:51:59,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2023-12-24 12:51:59,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 12:51:59,790 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:51:59,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:51:59,790 INFO L85 PathProgramCache]: Analyzing trace with hash -773694227, now seen corresponding path program 1 times [2023-12-24 12:51:59,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:51:59,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [488440479] [2023-12-24 12:51:59,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:51:59,790 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 12:51:59,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:51:59,792 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 12:51:59,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-12-24 12:51:59,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:51:59,986 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-24 12:51:59,989 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:51:59,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-24 12:51:59,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-12-24 12:52:00,089 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 12:52:00,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 33 [2023-12-24 12:52:00,177 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 12:52:00,177 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 54 treesize of output 24 [2023-12-24 12:52:00,200 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2023-12-24 12:52:00,201 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 12:52:00,201 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:52:00,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [488440479] [2023-12-24 12:52:00,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [488440479] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 12:52:00,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 12:52:00,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-24 12:52:00,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398228179] [2023-12-24 12:52:00,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 12:52:00,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 12:52:00,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:52:00,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 12:52:00,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-24 12:52:00,202 INFO L87 Difference]: Start difference. First operand 372 states and 457 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-24 12:52:01,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:52:01,063 INFO L93 Difference]: Finished difference Result 962 states and 1179 transitions. [2023-12-24 12:52:01,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-24 12:52:01,063 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 124 [2023-12-24 12:52:01,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:52:01,065 INFO L225 Difference]: With dead ends: 962 [2023-12-24 12:52:01,065 INFO L226 Difference]: Without dead ends: 591 [2023-12-24 12:52:01,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-12-24 12:52:01,067 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 244 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-24 12:52:01,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 666 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-24 12:52:01,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2023-12-24 12:52:01,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 407. [2023-12-24 12:52:01,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 361 states have (on average 1.1994459833795015) internal successors, (433), 364 states have internal predecessors, (433), 34 states have call successors, (34), 11 states have call predecessors, (34), 11 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-24 12:52:01,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 501 transitions. [2023-12-24 12:52:01,090 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 501 transitions. Word has length 124 [2023-12-24 12:52:01,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:52:01,091 INFO L495 AbstractCegarLoop]: Abstraction has 407 states and 501 transitions. [2023-12-24 12:52:01,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-24 12:52:01,091 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 501 transitions. [2023-12-24 12:52:01,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-24 12:52:01,091 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:52:01,092 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:52:01,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2023-12-24 12:52:01,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 12:52:01,297 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:52:01,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:52:01,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1576724470, now seen corresponding path program 1 times [2023-12-24 12:52:01,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:52:01,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1918227318] [2023-12-24 12:52:01,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:52:01,298 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 12:52:01,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:52:01,299 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 12:52:01,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-12-24 12:52:01,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:52:01,471 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-24 12:52:01,476 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:52:01,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-24 12:52:01,512 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 31 treesize of output 15 [2023-12-24 12:52:01,646 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 12:52:01,647 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 44 treesize of output 20 [2023-12-24 12:52:01,676 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 149 proven. 6 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2023-12-24 12:52:01,676 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 12:52:02,031 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 78 proven. 9 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2023-12-24 12:52:02,032 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:52:02,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1918227318] [2023-12-24 12:52:02,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1918227318] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 12:52:02,032 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 12:52:02,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2023-12-24 12:52:02,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486017843] [2023-12-24 12:52:02,032 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 12:52:02,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-24 12:52:02,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:52:02,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-24 12:52:02,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2023-12-24 12:52:02,034 INFO L87 Difference]: Start difference. First operand 407 states and 501 transitions. Second operand has 21 states, 17 states have (on average 4.0588235294117645) internal successors, (69), 20 states have internal predecessors, (69), 7 states have call successors, (19), 3 states have call predecessors, (19), 6 states have return successors, (19), 4 states have call predecessors, (19), 7 states have call successors, (19) [2023-12-24 12:52:02,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:52:02,781 INFO L93 Difference]: Finished difference Result 792 states and 969 transitions. [2023-12-24 12:52:02,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-24 12:52:02,782 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 4.0588235294117645) internal successors, (69), 20 states have internal predecessors, (69), 7 states have call successors, (19), 3 states have call predecessors, (19), 6 states have return successors, (19), 4 states have call predecessors, (19), 7 states have call successors, (19) Word has length 124 [2023-12-24 12:52:02,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:52:02,783 INFO L225 Difference]: With dead ends: 792 [2023-12-24 12:52:02,784 INFO L226 Difference]: Without dead ends: 386 [2023-12-24 12:52:02,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 226 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=206, Invalid=664, Unknown=0, NotChecked=0, Total=870 [2023-12-24 12:52:02,785 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 104 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-24 12:52:02,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 488 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-24 12:52:02,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2023-12-24 12:52:02,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 374. [2023-12-24 12:52:02,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 327 states have (on average 1.1865443425076452) internal successors, (388), 330 states have internal predecessors, (388), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-24 12:52:02,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 456 transitions. [2023-12-24 12:52:02,807 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 456 transitions. Word has length 124 [2023-12-24 12:52:02,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:52:02,807 INFO L495 AbstractCegarLoop]: Abstraction has 374 states and 456 transitions. [2023-12-24 12:52:02,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 4.0588235294117645) internal successors, (69), 20 states have internal predecessors, (69), 7 states have call successors, (19), 3 states have call predecessors, (19), 6 states have return successors, (19), 4 states have call predecessors, (19), 7 states have call successors, (19) [2023-12-24 12:52:02,808 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 456 transitions. [2023-12-24 12:52:02,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-24 12:52:02,809 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:52:02,809 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:52:02,826 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 (23)] Forceful destruction successful, exit code 0 [2023-12-24 12:52:03,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 12:52:03,014 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:52:03,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:52:03,014 INFO L85 PathProgramCache]: Analyzing trace with hash 73553316, now seen corresponding path program 1 times [2023-12-24 12:52:03,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:52:03,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [228876141] [2023-12-24 12:52:03,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:52:03,015 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 12:52:03,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:52:03,016 INFO L229 MonitoredProcess]: Starting monitored process 24 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 12:52:03,018 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 (24)] Waiting until timeout for monitored process [2023-12-24 12:52:03,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:52:03,237 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-24 12:52:03,241 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:52:03,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-24 12:52:03,276 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 25 [2023-12-24 12:52:03,688 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 12:52:03,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 51 [2023-12-24 12:52:04,125 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 12:52:04,125 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 106 treesize of output 46 [2023-12-24 12:52:04,325 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 149 proven. 6 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2023-12-24 12:52:04,326 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 12:52:04,987 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-24 12:52:04,988 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:52:04,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [228876141] [2023-12-24 12:52:04,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [228876141] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 12:52:04,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 12:52:04,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [25] total 35 [2023-12-24 12:52:04,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495951068] [2023-12-24 12:52:04,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 12:52:04,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-24 12:52:04,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:52:04,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-24 12:52:04,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1060, Unknown=0, NotChecked=0, Total=1190 [2023-12-24 12:52:04,989 INFO L87 Difference]: Start difference. First operand 374 states and 456 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 12:52:07,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:52:07,052 INFO L93 Difference]: Finished difference Result 1016 states and 1224 transitions. [2023-12-24 12:52:07,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-24 12:52:07,053 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 124 [2023-12-24 12:52:07,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:52:07,055 INFO L225 Difference]: With dead ends: 1016 [2023-12-24 12:52:07,055 INFO L226 Difference]: Without dead ends: 643 [2023-12-24 12:52:07,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=335, Invalid=2635, Unknown=0, NotChecked=0, Total=2970 [2023-12-24 12:52:07,056 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 430 mSDsluCounter, 1477 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 1646 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-24 12:52:07,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 1646 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-24 12:52:07,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2023-12-24 12:52:07,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 374. [2023-12-24 12:52:07,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 327 states have (on average 1.1865443425076452) internal successors, (388), 330 states have internal predecessors, (388), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-24 12:52:07,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 456 transitions. [2023-12-24 12:52:07,082 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 456 transitions. Word has length 124 [2023-12-24 12:52:07,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:52:07,082 INFO L495 AbstractCegarLoop]: Abstraction has 374 states and 456 transitions. [2023-12-24 12:52:07,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 12:52:07,082 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 456 transitions. [2023-12-24 12:52:07,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-24 12:52:07,083 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:52:07,083 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:52:07,112 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 (24)] Forceful destruction successful, exit code 0 [2023-12-24 12:52:07,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 12:52:07,289 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:52:07,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:52:07,289 INFO L85 PathProgramCache]: Analyzing trace with hash 753611686, now seen corresponding path program 1 times [2023-12-24 12:52:07,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:52:07,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [583374728] [2023-12-24 12:52:07,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:52:07,290 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 12:52:07,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:52:07,291 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 12:52:07,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-12-24 12:52:07,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:52:07,429 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-24 12:52:07,431 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:52:07,451 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 12:52:07,452 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 36 treesize of output 16 [2023-12-24 12:52:07,466 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-24 12:52:07,467 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 12:52:07,467 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:52:07,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [583374728] [2023-12-24 12:52:07,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [583374728] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 12:52:07,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 12:52:07,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 12:52:07,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51762652] [2023-12-24 12:52:07,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 12:52:07,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 12:52:07,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:52:07,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 12:52:07,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 12:52:07,470 INFO L87 Difference]: Start difference. First operand 374 states and 456 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 12:52:07,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:52:07,733 INFO L93 Difference]: Finished difference Result 923 states and 1115 transitions. [2023-12-24 12:52:07,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 12:52:07,734 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 124 [2023-12-24 12:52:07,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:52:07,735 INFO L225 Difference]: With dead ends: 923 [2023-12-24 12:52:07,735 INFO L226 Difference]: Without dead ends: 550 [2023-12-24 12:52:07,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-24 12:52:07,736 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 128 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 12:52:07,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 506 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 12:52:07,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2023-12-24 12:52:07,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 374. [2023-12-24 12:52:07,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 327 states have (on average 1.1681957186544343) internal successors, (382), 330 states have internal predecessors, (382), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-24 12:52:07,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 450 transitions. [2023-12-24 12:52:07,760 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 450 transitions. Word has length 124 [2023-12-24 12:52:07,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:52:07,760 INFO L495 AbstractCegarLoop]: Abstraction has 374 states and 450 transitions. [2023-12-24 12:52:07,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 12:52:07,760 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 450 transitions. [2023-12-24 12:52:07,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-24 12:52:07,761 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:52:07,761 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:52:07,765 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 (25)] Forceful destruction successful, exit code 0 [2023-12-24 12:52:07,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 12:52:07,965 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:52:07,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:52:07,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1870995283, now seen corresponding path program 1 times [2023-12-24 12:52:07,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:52:07,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1717254520] [2023-12-24 12:52:07,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:52:07,966 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 12:52:07,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:52:07,967 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 12:52:07,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2023-12-24 12:52:08,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:52:08,137 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-24 12:52:08,140 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:52:08,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-12-24 12:52:08,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2023-12-24 12:52:08,268 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 12:52:08,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 34 [2023-12-24 12:52:08,341 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 12:52:08,341 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 55 treesize of output 25 [2023-12-24 12:52:08,366 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2023-12-24 12:52:08,366 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 12:52:08,366 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:52:08,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1717254520] [2023-12-24 12:52:08,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1717254520] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 12:52:08,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 12:52:08,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-24 12:52:08,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194770760] [2023-12-24 12:52:08,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 12:52:08,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 12:52:08,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:52:08,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 12:52:08,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-24 12:52:08,367 INFO L87 Difference]: Start difference. First operand 374 states and 450 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-24 12:52:09,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:52:09,053 INFO L93 Difference]: Finished difference Result 929 states and 1103 transitions. [2023-12-24 12:52:09,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-24 12:52:09,054 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 124 [2023-12-24 12:52:09,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:52:09,055 INFO L225 Difference]: With dead ends: 929 [2023-12-24 12:52:09,056 INFO L226 Difference]: Without dead ends: 556 [2023-12-24 12:52:09,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-12-24 12:52:09,056 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 233 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-24 12:52:09,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 521 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-24 12:52:09,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2023-12-24 12:52:09,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 371. [2023-12-24 12:52:09,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 324 states have (on average 1.1419753086419753) internal successors, (370), 327 states have internal predecessors, (370), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-24 12:52:09,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 438 transitions. [2023-12-24 12:52:09,082 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 438 transitions. Word has length 124 [2023-12-24 12:52:09,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:52:09,082 INFO L495 AbstractCegarLoop]: Abstraction has 371 states and 438 transitions. [2023-12-24 12:52:09,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-24 12:52:09,082 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 438 transitions. [2023-12-24 12:52:09,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-24 12:52:09,083 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:52:09,083 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:52:09,087 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 (26)] Ended with exit code 0 [2023-12-24 12:52:09,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 12:52:09,288 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:52:09,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:52:09,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1454676264, now seen corresponding path program 1 times [2023-12-24 12:52:09,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:52:09,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1926927541] [2023-12-24 12:52:09,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:52:09,289 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 12:52:09,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:52:09,290 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 12:52:09,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-12-24 12:52:09,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:52:09,465 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-24 12:52:09,469 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:52:09,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-24 12:52:09,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2023-12-24 12:52:09,647 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 12:52:09,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 31 [2023-12-24 12:52:09,825 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 12:52:09,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 33 [2023-12-24 12:52:09,903 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 12:52:09,903 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 57 treesize of output 25 [2023-12-24 12:52:09,931 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 229 proven. 15 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2023-12-24 12:52:09,931 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 12:52:10,062 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-24 12:52:10,062 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:52:10,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1926927541] [2023-12-24 12:52:10,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1926927541] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 12:52:10,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 12:52:10,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 17 [2023-12-24 12:52:10,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607222047] [2023-12-24 12:52:10,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 12:52:10,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 12:52:10,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:52:10,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 12:52:10,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2023-12-24 12:52:10,064 INFO L87 Difference]: Start difference. First operand 371 states and 438 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 12:52:10,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:52:10,252 INFO L93 Difference]: Finished difference Result 852 states and 999 transitions. [2023-12-24 12:52:10,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 12:52:10,254 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 124 [2023-12-24 12:52:10,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:52:10,255 INFO L225 Difference]: With dead ends: 852 [2023-12-24 12:52:10,255 INFO L226 Difference]: Without dead ends: 482 [2023-12-24 12:52:10,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 229 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2023-12-24 12:52:10,256 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 144 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 12:52:10,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 403 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 12:52:10,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2023-12-24 12:52:10,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 356. [2023-12-24 12:52:10,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 309 states have (on average 1.110032362459547) internal successors, (343), 312 states have internal predecessors, (343), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-24 12:52:10,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 411 transitions. [2023-12-24 12:52:10,282 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 411 transitions. Word has length 124 [2023-12-24 12:52:10,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:52:10,282 INFO L495 AbstractCegarLoop]: Abstraction has 356 states and 411 transitions. [2023-12-24 12:52:10,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 12:52:10,282 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 411 transitions. [2023-12-24 12:52:10,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-24 12:52:10,283 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:52:10,283 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:52:10,288 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 (27)] Forceful destruction successful, exit code 0 [2023-12-24 12:52:10,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 12:52:10,488 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:52:10,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:52:10,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1731885018, now seen corresponding path program 1 times [2023-12-24 12:52:10,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:52:10,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2096005131] [2023-12-24 12:52:10,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:52:10,489 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 12:52:10,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:52:10,490 INFO L229 MonitoredProcess]: Starting monitored process 28 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 12:52:10,491 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 (28)] Waiting until timeout for monitored process [2023-12-24 12:52:10,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:52:10,650 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 12:52:10,652 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:52:10,674 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 12:52:10,675 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 36 treesize of output 16 [2023-12-24 12:52:10,688 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-24 12:52:10,688 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 12:52:10,688 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:52:10,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2096005131] [2023-12-24 12:52:10,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2096005131] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 12:52:10,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 12:52:10,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 12:52:10,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111527125] [2023-12-24 12:52:10,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 12:52:10,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 12:52:10,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:52:10,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 12:52:10,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 12:52:10,689 INFO L87 Difference]: Start difference. First operand 356 states and 411 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 12:52:10,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:52:10,942 INFO L93 Difference]: Finished difference Result 755 states and 872 transitions. [2023-12-24 12:52:10,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 12:52:10,943 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 124 [2023-12-24 12:52:10,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:52:10,944 INFO L225 Difference]: With dead ends: 755 [2023-12-24 12:52:10,944 INFO L226 Difference]: Without dead ends: 400 [2023-12-24 12:52:10,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-24 12:52:10,945 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 87 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 12:52:10,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 517 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 12:52:10,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2023-12-24 12:52:10,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 300. [2023-12-24 12:52:10,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 253 states have (on average 1.0909090909090908) internal successors, (276), 256 states have internal predecessors, (276), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-24 12:52:10,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 344 transitions. [2023-12-24 12:52:10,970 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 344 transitions. Word has length 124 [2023-12-24 12:52:10,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:52:10,972 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 344 transitions. [2023-12-24 12:52:10,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 12:52:10,973 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 344 transitions. [2023-12-24 12:52:10,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-24 12:52:10,973 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:52:10,973 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:52:10,980 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 (28)] Forceful destruction successful, exit code 0 [2023-12-24 12:52:11,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 12:52:11,181 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:52:11,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:52:11,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1811246588, now seen corresponding path program 1 times [2023-12-24 12:52:11,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:52:11,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1924725560] [2023-12-24 12:52:11,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:52:11,182 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 12:52:11,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:52:11,183 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 12:52:11,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2023-12-24 12:52:11,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:52:11,368 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-24 12:52:11,371 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:52:11,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-12-24 12:52:11,604 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 12:52:11,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 30 [2023-12-24 12:52:11,675 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 12:52:11,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 40 [2023-12-24 12:52:11,863 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 12:52:11,864 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 69 treesize of output 33 [2023-12-24 12:52:11,887 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 279 proven. 12 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2023-12-24 12:52:11,887 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 12:52:12,229 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:52:12,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1924725560] [2023-12-24 12:52:12,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1924725560] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 12:52:12,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1798037827] [2023-12-24 12:52:12,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:52:12,230 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 12:52:12,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 12:52:12,261 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 12:52:12,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2023-12-24 12:52:12,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:52:12,544 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-24 12:52:12,546 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:52:12,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-24 12:52:12,779 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 12:52:12,835 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-24 12:52:12,835 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 12:52:12,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1798037827] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 12:52:12,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 12:52:12,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2023-12-24 12:52:12,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546631804] [2023-12-24 12:52:12,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 12:52:12,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 12:52:12,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:52:12,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 12:52:12,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2023-12-24 12:52:12,836 INFO L87 Difference]: Start difference. First operand 300 states and 344 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 12:52:13,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:52:13,043 INFO L93 Difference]: Finished difference Result 626 states and 720 transitions. [2023-12-24 12:52:13,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 12:52:13,043 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 125 [2023-12-24 12:52:13,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:52:13,044 INFO L225 Difference]: With dead ends: 626 [2023-12-24 12:52:13,044 INFO L226 Difference]: Without dead ends: 327 [2023-12-24 12:52:13,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=133, Invalid=467, Unknown=0, NotChecked=0, Total=600 [2023-12-24 12:52:13,045 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 77 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 12:52:13,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 333 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 12:52:13,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2023-12-24 12:52:13,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 287. [2023-12-24 12:52:13,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 240 states have (on average 1.0791666666666666) internal successors, (259), 243 states have internal predecessors, (259), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-24 12:52:13,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 327 transitions. [2023-12-24 12:52:13,072 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 327 transitions. Word has length 125 [2023-12-24 12:52:13,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:52:13,072 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 327 transitions. [2023-12-24 12:52:13,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 12:52:13,072 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 327 transitions. [2023-12-24 12:52:13,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-12-24 12:52:13,073 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:52:13,073 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:52:13,077 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 (29)] Ended with exit code 0 [2023-12-24 12:52:13,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Forceful destruction successful, exit code 0 [2023-12-24 12:52:13,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-24 12:52:13,478 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:52:13,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:52:13,478 INFO L85 PathProgramCache]: Analyzing trace with hash 645320458, now seen corresponding path program 1 times [2023-12-24 12:52:13,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:52:13,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1669043779] [2023-12-24 12:52:13,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:52:13,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 12:52:13,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:52:13,481 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 12:52:13,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2023-12-24 12:52:13,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:52:13,653 INFO L262 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-24 12:52:13,655 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:52:13,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-12-24 12:52:13,885 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 12:52:13,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 40 [2023-12-24 12:52:14,011 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 12:52:14,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 53 [2023-12-24 12:52:14,252 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 12:52:14,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 79 treesize of output 37 [2023-12-24 12:52:14,277 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 279 proven. 12 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2023-12-24 12:52:14,277 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 12:52:14,641 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:52:14,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1669043779] [2023-12-24 12:52:14,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1669043779] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 12:52:14,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [452609242] [2023-12-24 12:52:14,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:52:14,642 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 12:52:14,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 12:52:14,643 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 12:52:14,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2023-12-24 12:52:14,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:52:14,953 INFO L262 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-24 12:52:14,956 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:52:14,985 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 12:52:15,078 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 21 treesize of output 20 [2023-12-24 12:52:15,172 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 12:52:15,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2023-12-24 12:52:15,771 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 63 treesize of output 49 [2023-12-24 12:52:16,149 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 12:52:16,150 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 92 treesize of output 52 [2023-12-24 12:52:16,387 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2023-12-24 12:52:16,387 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 12:52:16,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [452609242] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 12:52:16,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 12:52:16,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [11] total 26 [2023-12-24 12:52:16,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278744645] [2023-12-24 12:52:16,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 12:52:16,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-24 12:52:16,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:52:16,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-24 12:52:16,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1008, Unknown=0, NotChecked=0, Total=1190 [2023-12-24 12:52:16,388 INFO L87 Difference]: Start difference. First operand 287 states and 327 transitions. Second operand has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 16 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-24 12:52:17,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:52:17,391 INFO L93 Difference]: Finished difference Result 362 states and 408 transitions. [2023-12-24 12:52:17,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-24 12:52:17,392 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 16 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 127 [2023-12-24 12:52:17,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:52:17,393 INFO L225 Difference]: With dead ends: 362 [2023-12-24 12:52:17,393 INFO L226 Difference]: Without dead ends: 360 [2023-12-24 12:52:17,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=318, Invalid=1844, Unknown=0, NotChecked=0, Total=2162 [2023-12-24 12:52:17,394 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 251 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-24 12:52:17,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 918 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-24 12:52:17,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2023-12-24 12:52:17,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 332. [2023-12-24 12:52:17,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 285 states have (on average 1.0771929824561404) internal successors, (307), 288 states have internal predecessors, (307), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-24 12:52:17,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 375 transitions. [2023-12-24 12:52:17,426 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 375 transitions. Word has length 127 [2023-12-24 12:52:17,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:52:17,426 INFO L495 AbstractCegarLoop]: Abstraction has 332 states and 375 transitions. [2023-12-24 12:52:17,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 16 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-24 12:52:17,427 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 375 transitions. [2023-12-24 12:52:17,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-12-24 12:52:17,428 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:52:17,428 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:52:17,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2023-12-24 12:52:17,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (32)] Forceful destruction successful, exit code 0 [2023-12-24 12:52:17,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-24 12:52:17,833 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:52:17,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:52:17,833 INFO L85 PathProgramCache]: Analyzing trace with hash -164026168, now seen corresponding path program 1 times [2023-12-24 12:52:17,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:52:17,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1804365629] [2023-12-24 12:52:17,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:52:17,834 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 12:52:17,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:52:17,835 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 12:52:17,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2023-12-24 12:52:18,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:52:18,006 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-24 12:52:18,010 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:52:18,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-12-24 12:52:18,194 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 12:52:18,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2023-12-24 12:52:18,231 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 12:52:18,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2023-12-24 12:52:18,314 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 12:52:18,314 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 51 treesize of output 25 [2023-12-24 12:52:18,338 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 213 proven. 12 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2023-12-24 12:52:18,338 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 12:52:18,685 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:52:18,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1804365629] [2023-12-24 12:52:18,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1804365629] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 12:52:18,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [770139525] [2023-12-24 12:52:18,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:52:18,686 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 12:52:18,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 12:52:18,687 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 12:52:18,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (34)] Waiting until timeout for monitored process [2023-12-24 12:52:18,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:52:18,981 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-24 12:52:18,983 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:52:19,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-24 12:52:19,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-24 12:52:19,214 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 12:52:19,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2023-12-24 12:52:19,291 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-24 12:52:19,291 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 12:52:19,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [770139525] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 12:52:19,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 12:52:19,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2023-12-24 12:52:19,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212080853] [2023-12-24 12:52:19,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 12:52:19,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 12:52:19,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:52:19,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 12:52:19,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2023-12-24 12:52:19,293 INFO L87 Difference]: Start difference. First operand 332 states and 375 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 12:52:19,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:52:19,571 INFO L93 Difference]: Finished difference Result 676 states and 763 transitions. [2023-12-24 12:52:19,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-24 12:52:19,572 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 127 [2023-12-24 12:52:19,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:52:19,573 INFO L225 Difference]: With dead ends: 676 [2023-12-24 12:52:19,573 INFO L226 Difference]: Without dead ends: 345 [2023-12-24 12:52:19,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=115, Invalid=485, Unknown=0, NotChecked=0, Total=600 [2023-12-24 12:52:19,575 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 75 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 12:52:19,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 410 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 12:52:19,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2023-12-24 12:52:19,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 344. [2023-12-24 12:52:19,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 294 states have (on average 1.0714285714285714) internal successors, (315), 298 states have internal predecessors, (315), 36 states have call successors, (36), 13 states have call predecessors, (36), 13 states have return successors, (36), 32 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-24 12:52:19,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 387 transitions. [2023-12-24 12:52:19,609 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 387 transitions. Word has length 127 [2023-12-24 12:52:19,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:52:19,609 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 387 transitions. [2023-12-24 12:52:19,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 12:52:19,609 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 387 transitions. [2023-12-24 12:52:19,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-12-24 12:52:19,612 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:52:19,612 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:52:19,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (34)] Forceful destruction successful, exit code 0 [2023-12-24 12:52:19,821 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 (33)] Forceful destruction successful, exit code 0 [2023-12-24 12:52:20,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 12:52:20,022 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:52:20,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:52:20,022 INFO L85 PathProgramCache]: Analyzing trace with hash 511306952, now seen corresponding path program 1 times [2023-12-24 12:52:20,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:52:20,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2141113937] [2023-12-24 12:52:20,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:52:20,023 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 12:52:20,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:52:20,024 INFO L229 MonitoredProcess]: Starting monitored process 35 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 12:52:20,056 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 (35)] Waiting until timeout for monitored process [2023-12-24 12:52:20,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:52:20,206 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-24 12:52:20,209 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:52:20,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-12-24 12:52:20,410 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 12:52:20,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2023-12-24 12:52:20,507 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 12:52:20,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 39 [2023-12-24 12:52:20,630 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 12:52:20,630 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 61 treesize of output 29 [2023-12-24 12:52:20,650 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 213 proven. 12 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2023-12-24 12:52:20,650 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 12:52:20,979 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:52:20,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2141113937] [2023-12-24 12:52:20,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2141113937] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 12:52:20,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1031623969] [2023-12-24 12:52:20,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:52:20,979 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 12:52:20,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 12:52:20,981 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 12:52:20,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (36)] Waiting until timeout for monitored process [2023-12-24 12:52:21,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:52:21,304 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-24 12:52:21,307 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:52:21,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-24 12:52:21,354 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 12:52:21,730 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 12:52:21,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2023-12-24 12:52:21,880 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2023-12-24 12:52:21,880 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 12:52:21,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1031623969] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 12:52:21,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 12:52:21,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 15 [2023-12-24 12:52:21,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416971182] [2023-12-24 12:52:21,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 12:52:21,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 12:52:21,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:52:21,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 12:52:21,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2023-12-24 12:52:21,882 INFO L87 Difference]: Start difference. First operand 344 states and 387 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-24 12:52:22,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:52:22,296 INFO L93 Difference]: Finished difference Result 697 states and 784 transitions. [2023-12-24 12:52:22,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-24 12:52:22,297 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 127 [2023-12-24 12:52:22,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:52:22,298 INFO L225 Difference]: With dead ends: 697 [2023-12-24 12:52:22,298 INFO L226 Difference]: Without dead ends: 354 [2023-12-24 12:52:22,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 296 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=144, Invalid=612, Unknown=0, NotChecked=0, Total=756 [2023-12-24 12:52:22,299 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 137 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-24 12:52:22,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 426 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-24 12:52:22,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2023-12-24 12:52:22,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 344. [2023-12-24 12:52:22,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 294 states have (on average 1.0680272108843538) internal successors, (314), 298 states have internal predecessors, (314), 36 states have call successors, (36), 13 states have call predecessors, (36), 13 states have return successors, (36), 32 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-24 12:52:22,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 386 transitions. [2023-12-24 12:52:22,332 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 386 transitions. Word has length 127 [2023-12-24 12:52:22,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:52:22,332 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 386 transitions. [2023-12-24 12:52:22,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-24 12:52:22,332 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 386 transitions. [2023-12-24 12:52:22,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-12-24 12:52:22,333 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 12:52:22,333 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:52:22,360 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 (35)] Ended with exit code 0 [2023-12-24 12:52:22,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (36)] Forceful destruction successful, exit code 0 [2023-12-24 12:52:22,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-24 12:52:22,743 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 12:52:22,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 12:52:22,743 INFO L85 PathProgramCache]: Analyzing trace with hash -298039674, now seen corresponding path program 1 times [2023-12-24 12:52:22,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 12:52:22,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1610889931] [2023-12-24 12:52:22,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 12:52:22,744 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 12:52:22,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 12:52:22,745 INFO L229 MonitoredProcess]: Starting monitored process 37 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 12:52:22,746 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 (37)] Waiting until timeout for monitored process [2023-12-24 12:52:22,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 12:52:22,888 INFO L262 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-24 12:52:22,897 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 12:52:22,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-12-24 12:52:22,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-12-24 12:52:23,026 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-24 12:52:23,027 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 12:52:23,027 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 12:52:23,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1610889931] [2023-12-24 12:52:23,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1610889931] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 12:52:23,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 12:52:23,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-24 12:52:23,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451880116] [2023-12-24 12:52:23,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 12:52:23,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-24 12:52:23,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 12:52:23,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-24 12:52:23,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2023-12-24 12:52:23,028 INFO L87 Difference]: Start difference. First operand 344 states and 386 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 12:52:23,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 12:52:23,411 INFO L93 Difference]: Finished difference Result 447 states and 508 transitions. [2023-12-24 12:52:23,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-24 12:52:23,412 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 127 [2023-12-24 12:52:23,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 12:52:23,412 INFO L225 Difference]: With dead ends: 447 [2023-12-24 12:52:23,412 INFO L226 Difference]: Without dead ends: 0 [2023-12-24 12:52:23,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2023-12-24 12:52:23,413 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 108 mSDsluCounter, 1278 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 1456 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 12:52:23,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 1456 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 12:52:23,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-24 12:52:23,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-24 12:52:23,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 12:52:23,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-24 12:52:23,414 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 127 [2023-12-24 12:52:23,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 12:52:23,414 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-24 12:52:23,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 12:52:23,414 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-24 12:52:23,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-24 12:52:23,416 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 12:52:23,437 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 (37)] Forceful destruction successful, exit code 0 [2023-12-24 12:52:23,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 12:52:23,624 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-24 12:52:31,233 WARN L293 SmtUtils]: Spent 7.60s on a formula simplification. DAG size of input: 213 DAG size of output: 263 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-24 12:52:38,627 WARN L293 SmtUtils]: Spent 7.39s on a formula simplification. DAG size of input: 213 DAG size of output: 263 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-24 12:52:50,270 WARN L293 SmtUtils]: Spent 11.64s on a formula simplification. DAG size of input: 226 DAG size of output: 275 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-24 12:53:01,948 WARN L293 SmtUtils]: Spent 11.67s on a formula simplification. DAG size of input: 226 DAG size of output: 275 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-24 12:53:16,941 WARN L293 SmtUtils]: Spent 14.99s on a formula simplification. DAG size of input: 237 DAG size of output: 288 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-24 12:53:41,442 WARN L293 SmtUtils]: Spent 24.50s on a formula simplification. DAG size of input: 157 DAG size of output: 198 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-24 12:54:05,975 WARN L293 SmtUtils]: Spent 24.53s on a formula simplification. DAG size of input: 157 DAG size of output: 198 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-24 12:54:30,235 WARN L293 SmtUtils]: Spent 24.26s on a formula simplification. DAG size of input: 157 DAG size of output: 198 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-24 12:54:54,979 WARN L293 SmtUtils]: Spent 24.29s on a formula simplification. DAG size of input: 157 DAG size of output: 198 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-24 12:55:09,078 WARN L293 SmtUtils]: Spent 5.22s on a formula simplification. DAG size of input: 151 DAG size of output: 190 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-24 12:55:36,740 WARN L293 SmtUtils]: Spent 27.66s on a formula simplification. DAG size of input: 162 DAG size of output: 202 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-24 12:55:43,837 WARN L293 SmtUtils]: Spent 7.10s on a formula simplification. DAG size of input: 186 DAG size of output: 151 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-24 12:56:11,808 WARN L293 SmtUtils]: Spent 27.96s on a formula simplification. DAG size of input: 162 DAG size of output: 202 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-24 12:56:19,427 WARN L293 SmtUtils]: Spent 7.62s on a formula simplification. DAG size of input: 192 DAG size of output: 157 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-24 12:56:25,043 WARN L293 SmtUtils]: Spent 5.21s on a formula simplification. DAG size of input: 151 DAG size of output: 190 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-24 12:56:56,165 WARN L293 SmtUtils]: Spent 27.80s on a formula simplification. DAG size of input: 162 DAG size of output: 202 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-24 12:57:04,245 WARN L293 SmtUtils]: Spent 8.07s on a formula simplification. DAG size of input: 156 DAG size of output: 198 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-24 12:57:11,319 WARN L293 SmtUtils]: Spent 7.07s on a formula simplification. DAG size of input: 186 DAG size of output: 151 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-24 12:57:19,872 WARN L293 SmtUtils]: Spent 5.22s on a formula simplification. DAG size of input: 151 DAG size of output: 190 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-24 12:57:44,257 WARN L293 SmtUtils]: Spent 24.38s on a formula simplification. DAG size of input: 157 DAG size of output: 198 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-24 12:58:12,084 WARN L293 SmtUtils]: Spent 24.46s on a formula simplification. DAG size of input: 157 DAG size of output: 198 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-24 12:58:17,323 WARN L293 SmtUtils]: Spent 5.24s on a formula simplification. DAG size of input: 151 DAG size of output: 190 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-24 12:58:22,554 WARN L293 SmtUtils]: Spent 5.23s on a formula simplification. DAG size of input: 151 DAG size of output: 190 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-24 12:58:46,957 WARN L293 SmtUtils]: Spent 24.40s on a formula simplification. DAG size of input: 157 DAG size of output: 198 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-24 12:58:54,604 WARN L293 SmtUtils]: Spent 7.65s on a formula simplification. DAG size of input: 192 DAG size of output: 157 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-24 12:59:26,528 WARN L293 SmtUtils]: Spent 27.81s on a formula simplification. DAG size of input: 162 DAG size of output: 202 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-24 12:59:34,641 WARN L293 SmtUtils]: Spent 8.11s on a formula simplification. DAG size of input: 156 DAG size of output: 198 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-24 12:59:39,862 WARN L293 SmtUtils]: Spent 5.22s on a formula simplification. DAG size of input: 151 DAG size of output: 190 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-24 13:00:04,313 WARN L293 SmtUtils]: Spent 24.45s on a formula simplification. DAG size of input: 157 DAG size of output: 198 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-24 13:00:16,033 WARN L293 SmtUtils]: Spent 9.38s on a formula simplification. DAG size of input: 187 DAG size of output: 208 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-24 13:00:25,539 WARN L293 SmtUtils]: Spent 9.51s on a formula simplification. DAG size of input: 187 DAG size of output: 208 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-24 13:00:36,359 WARN L293 SmtUtils]: Spent 9.31s on a formula simplification. DAG size of input: 187 DAG size of output: 208 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-24 13:00:45,662 WARN L293 SmtUtils]: Spent 9.30s on a formula simplification. DAG size of input: 187 DAG size of output: 208 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-24 13:01:02,286 WARN L293 SmtUtils]: Spent 16.62s on a formula simplification. DAG size of input: 200 DAG size of output: 221 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-24 13:01:20,558 WARN L293 SmtUtils]: Spent 10.25s on a formula simplification. DAG size of input: 811 DAG size of output: 1 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 13:01:25,966 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-24 13:01:25,966 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-24 13:01:25,966 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-24 13:01:25,966 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-24 13:01:25,966 INFO L899 garLoopResultBuilder]: For program point L35-2(lines 35 37) no Hoare annotation was computed. [2023-12-24 13:01:25,967 INFO L895 garLoopResultBuilder]: At program point L85(line 85) the Hoare annotation is: (let ((.cse1 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|)) (.cse4 (select |#memory_int#3| |~#unsigned_char_Array_0~0.base|))) (let ((.cse2 (select .cse4 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse0 (select .cse1 (_ bv3 32))) (.cse3 (select .cse4 (bvadd (_ bv2 32) |~#unsigned_char_Array_0~0.offset|)))) (and (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet53#1_54| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet53#1_54|) .cse0)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet47#1_48| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet47#1_48|) (select .cse1 (_ bv0 32)))) (bvsge ((_ zero_extend 24) ((_ extract 7 0) .cse2)) (_ bv127 32)) (= |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv0 32)) (bvsle ((_ zero_extend 24) ((_ extract 7 0) .cse3)) (_ bv127 32)) (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse4 |~#unsigned_char_Array_0~0.offset|))) (_ bv127 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet68#1_35| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet68#1_35|) .cse2)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet50#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet50#1_47|) (select .cse1 (_ bv2 32)))) (bvsle ((_ zero_extend 24) ((_ extract 7 0) .cse0)) (_ bv0 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet65#1_35| (_ BitVec 8))) (= .cse3 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet65#1_35|)))))) [2023-12-24 13:01:25,967 INFO L899 garLoopResultBuilder]: For program point L85-1(line 85) no Hoare annotation was computed. [2023-12-24 13:01:25,967 INFO L899 garLoopResultBuilder]: For program point L52(lines 52 58) no Hoare annotation was computed. [2023-12-24 13:01:25,967 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-24 13:01:25,967 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-24 13:01:25,967 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-24 13:01:25,967 INFO L895 garLoopResultBuilder]: At program point L69(line 69) the Hoare annotation is: (let ((.cse3 (select |#memory_int#3| |~#unsigned_char_Array_0~0.base|))) (let ((.cse1 (select .cse3 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse0 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|)) (.cse2 (select .cse3 (bvadd (_ bv2 32) |~#unsigned_char_Array_0~0.offset|)))) (and (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet53#1_54| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet53#1_54|) (select .cse0 (_ bv3 32)))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet47#1_48| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet47#1_48|) (select .cse0 (_ bv0 32)))) (bvsge ((_ zero_extend 24) ((_ extract 7 0) .cse1)) (_ bv127 32)) (= |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv0 32)) (bvsle ((_ zero_extend 24) ((_ extract 7 0) .cse2)) (_ bv127 32)) (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse3 |~#unsigned_char_Array_0~0.offset|))) (_ bv127 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet68#1_37| (_ BitVec 8))) (= .cse1 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet68#1_37|))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet50#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet50#1_47|) (select .cse0 (_ bv2 32)))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet65#1_35| (_ BitVec 8))) (= .cse2 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet65#1_35|)))))) [2023-12-24 13:01:25,967 INFO L899 garLoopResultBuilder]: For program point L69-1(line 69) no Hoare annotation was computed. [2023-12-24 13:01:25,967 INFO L899 garLoopResultBuilder]: For program point L36(line 36) no Hoare annotation was computed. [2023-12-24 13:01:25,967 INFO L899 garLoopResultBuilder]: For program point L36-2(line 36) no Hoare annotation was computed. [2023-12-24 13:01:25,967 INFO L899 garLoopResultBuilder]: For program point L36-3(line 36) no Hoare annotation was computed. [2023-12-24 13:01:25,967 INFO L899 garLoopResultBuilder]: For program point L36-5(line 36) no Hoare annotation was computed. [2023-12-24 13:01:25,967 INFO L899 garLoopResultBuilder]: For program point L36-7(line 36) no Hoare annotation was computed. [2023-12-24 13:01:25,967 INFO L899 garLoopResultBuilder]: For program point L36-9(line 36) no Hoare annotation was computed. [2023-12-24 13:01:25,967 INFO L899 garLoopResultBuilder]: For program point L36-10(line 36) no Hoare annotation was computed. [2023-12-24 13:01:25,967 INFO L899 garLoopResultBuilder]: For program point L53(lines 53 55) no Hoare annotation was computed. [2023-12-24 13:01:25,968 INFO L895 garLoopResultBuilder]: At program point L70(line 70) the Hoare annotation is: (let ((.cse1 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|)) (.cse4 (select |#memory_int#3| |~#unsigned_char_Array_0~0.base|))) (let ((.cse2 (select .cse4 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse3 (select .cse4 (bvadd (_ bv2 32) |~#unsigned_char_Array_0~0.offset|))) (.cse0 (select .cse1 (_ bv3 32)))) (and (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet53#1_54| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet53#1_54|) .cse0)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet47#1_48| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet47#1_48|) (select .cse1 (_ bv0 32)))) (bvsge ((_ zero_extend 24) ((_ extract 7 0) .cse2)) (_ bv127 32)) (= |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv0 32)) (bvsle ((_ zero_extend 24) ((_ extract 7 0) .cse3)) (_ bv127 32)) (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse4 |~#unsigned_char_Array_0~0.offset|))) (_ bv127 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet68#1_35| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet68#1_35|) .cse2)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet50#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet50#1_47|) (select .cse1 (_ bv2 32)))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet65#1_35| (_ BitVec 8))) (= .cse3 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet65#1_35|))) (= ((_ extract 7 0) .cse0) |ULTIMATE.start_updateVariables_#t~mem55#1|)))) [2023-12-24 13:01:25,968 INFO L899 garLoopResultBuilder]: For program point L70-1(line 70) no Hoare annotation was computed. [2023-12-24 13:01:25,968 INFO L895 garLoopResultBuilder]: At program point L72(line 72) the Hoare annotation is: (let ((.cse1 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|)) (.cse4 (select |#memory_int#3| |~#unsigned_char_Array_0~0.base|))) (let ((.cse2 (select .cse4 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse0 (select .cse1 (_ bv3 32))) (.cse3 (select .cse4 (bvadd (_ bv2 32) |~#unsigned_char_Array_0~0.offset|)))) (and (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet53#1_54| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet53#1_54|) .cse0)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet47#1_48| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet47#1_48|) (select .cse1 (_ bv0 32)))) (bvsge ((_ zero_extend 24) ((_ extract 7 0) .cse2)) (_ bv127 32)) (= |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv0 32)) (bvsle ((_ zero_extend 24) ((_ extract 7 0) .cse3)) (_ bv127 32)) (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse4 |~#unsigned_char_Array_0~0.offset|))) (_ bv127 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet68#1_35| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet68#1_35|) .cse2)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet50#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet50#1_47|) (select .cse1 (_ bv2 32)))) (bvsle ((_ zero_extend 24) ((_ extract 7 0) .cse0)) (_ bv0 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet65#1_35| (_ BitVec 8))) (= .cse3 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet65#1_35|)))))) [2023-12-24 13:01:25,968 INFO L899 garLoopResultBuilder]: For program point L72-1(line 72) no Hoare annotation was computed. [2023-12-24 13:01:25,968 INFO L895 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (let ((.cse1 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|)) (.cse4 (select |#memory_int#3| |~#unsigned_char_Array_0~0.base|))) (let ((.cse2 (select .cse4 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse0 (select .cse1 (_ bv3 32))) (.cse3 (select .cse4 (bvadd (_ bv2 32) |~#unsigned_char_Array_0~0.offset|)))) (and (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet53#1_54| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet53#1_54|) .cse0)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet47#1_48| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet47#1_48|) (select .cse1 (_ bv0 32)))) (bvsge ((_ zero_extend 24) ((_ extract 7 0) .cse2)) (_ bv127 32)) (= |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv0 32)) (bvsle ((_ zero_extend 24) ((_ extract 7 0) .cse3)) (_ bv127 32)) (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse4 |~#unsigned_char_Array_0~0.offset|))) (_ bv127 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet68#1_35| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet68#1_35|) .cse2)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet50#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet50#1_47|) (select .cse1 (_ bv2 32)))) (bvsle ((_ zero_extend 24) ((_ extract 7 0) .cse0)) (_ bv0 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet65#1_35| (_ BitVec 8))) (= .cse3 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet65#1_35|)))))) [2023-12-24 13:01:25,968 INFO L899 garLoopResultBuilder]: For program point L73-1(line 73) no Hoare annotation was computed. [2023-12-24 13:01:25,968 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 48) no Hoare annotation was computed. [2023-12-24 13:01:25,968 INFO L899 garLoopResultBuilder]: For program point L40-1(lines 40 48) no Hoare annotation was computed. [2023-12-24 13:01:25,968 INFO L899 garLoopResultBuilder]: For program point L90(line 90) no Hoare annotation was computed. [2023-12-24 13:01:25,968 INFO L899 garLoopResultBuilder]: For program point L90-1(line 90) no Hoare annotation was computed. [2023-12-24 13:01:25,968 INFO L899 garLoopResultBuilder]: For program point L90-2(line 90) no Hoare annotation was computed. [2023-12-24 13:01:25,968 INFO L899 garLoopResultBuilder]: For program point L90-4(line 90) no Hoare annotation was computed. [2023-12-24 13:01:25,968 INFO L899 garLoopResultBuilder]: For program point L90-6(line 90) no Hoare annotation was computed. [2023-12-24 13:01:25,968 INFO L899 garLoopResultBuilder]: For program point L90-8(line 90) no Hoare annotation was computed. [2023-12-24 13:01:25,968 INFO L899 garLoopResultBuilder]: For program point L90-9(line 90) no Hoare annotation was computed. [2023-12-24 13:01:25,968 INFO L899 garLoopResultBuilder]: For program point L90-10(line 90) no Hoare annotation was computed. [2023-12-24 13:01:25,968 INFO L899 garLoopResultBuilder]: For program point L90-11(line 90) no Hoare annotation was computed. [2023-12-24 13:01:25,968 INFO L899 garLoopResultBuilder]: For program point L90-13(line 90) no Hoare annotation was computed. [2023-12-24 13:01:25,969 INFO L899 garLoopResultBuilder]: For program point L90-14(line 90) no Hoare annotation was computed. [2023-12-24 13:01:25,969 INFO L899 garLoopResultBuilder]: For program point L90-16(line 90) no Hoare annotation was computed. [2023-12-24 13:01:25,969 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 45) no Hoare annotation was computed. [2023-12-24 13:01:25,969 INFO L899 garLoopResultBuilder]: For program point L90-18(line 90) no Hoare annotation was computed. [2023-12-24 13:01:25,969 INFO L899 garLoopResultBuilder]: For program point L90-20(line 90) no Hoare annotation was computed. [2023-12-24 13:01:25,969 INFO L899 garLoopResultBuilder]: For program point L90-21(line 90) no Hoare annotation was computed. [2023-12-24 13:01:25,969 INFO L899 garLoopResultBuilder]: For program point L90-23(line 90) no Hoare annotation was computed. [2023-12-24 13:01:25,969 INFO L899 garLoopResultBuilder]: For program point L90-25(line 90) no Hoare annotation was computed. [2023-12-24 13:01:25,969 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-24 13:01:25,969 INFO L899 garLoopResultBuilder]: For program point L90-26(line 90) no Hoare annotation was computed. [2023-12-24 13:01:25,969 INFO L899 garLoopResultBuilder]: For program point L90-27(line 90) no Hoare annotation was computed. [2023-12-24 13:01:25,969 INFO L899 garLoopResultBuilder]: For program point L90-28(line 90) no Hoare annotation was computed. [2023-12-24 13:01:25,969 INFO L899 garLoopResultBuilder]: For program point L90-29(line 90) no Hoare annotation was computed. [2023-12-24 13:01:25,969 INFO L899 garLoopResultBuilder]: For program point L90-31(line 90) no Hoare annotation was computed. [2023-12-24 13:01:25,969 INFO L899 garLoopResultBuilder]: For program point L90-33(line 90) no Hoare annotation was computed. [2023-12-24 13:01:25,969 INFO L899 garLoopResultBuilder]: For program point L90-34(line 90) no Hoare annotation was computed. [2023-12-24 13:01:25,969 INFO L899 garLoopResultBuilder]: For program point L90-36(line 90) no Hoare annotation was computed. [2023-12-24 13:01:25,969 INFO L899 garLoopResultBuilder]: For program point L90-38(line 90) no Hoare annotation was computed. [2023-12-24 13:01:25,969 INFO L899 garLoopResultBuilder]: For program point L90-40(line 90) no Hoare annotation was computed. [2023-12-24 13:01:25,969 INFO L895 garLoopResultBuilder]: At program point L75(line 75) the Hoare annotation is: (let ((.cse1 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|)) (.cse4 (select |#memory_int#3| |~#unsigned_char_Array_0~0.base|))) (let ((.cse2 (select .cse4 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse0 (select .cse1 (_ bv3 32))) (.cse3 (select .cse4 (bvadd (_ bv2 32) |~#unsigned_char_Array_0~0.offset|)))) (and (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet53#1_54| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet53#1_54|) .cse0)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet47#1_48| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet47#1_48|) (select .cse1 (_ bv0 32)))) (bvsge ((_ zero_extend 24) ((_ extract 7 0) .cse2)) (_ bv127 32)) (= |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv0 32)) (bvsle ((_ zero_extend 24) ((_ extract 7 0) .cse3)) (_ bv127 32)) (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse4 |~#unsigned_char_Array_0~0.offset|))) (_ bv127 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet68#1_35| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet68#1_35|) .cse2)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet50#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet50#1_47|) (select .cse1 (_ bv2 32)))) (bvsle ((_ zero_extend 24) ((_ extract 7 0) .cse0)) (_ bv0 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet65#1_35| (_ BitVec 8))) (= .cse3 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet65#1_35|)))))) [2023-12-24 13:01:25,969 INFO L899 garLoopResultBuilder]: For program point L75-1(line 75) no Hoare annotation was computed. [2023-12-24 13:01:25,969 INFO L899 garLoopResultBuilder]: For program point L42(line 42) no Hoare annotation was computed. [2023-12-24 13:01:25,970 INFO L899 garLoopResultBuilder]: For program point L42-2(line 42) no Hoare annotation was computed. [2023-12-24 13:01:25,970 INFO L899 garLoopResultBuilder]: For program point L42-4(line 42) no Hoare annotation was computed. [2023-12-24 13:01:25,970 INFO L899 garLoopResultBuilder]: For program point L42-5(line 42) no Hoare annotation was computed. [2023-12-24 13:01:25,970 INFO L895 garLoopResultBuilder]: At program point L76(line 76) the Hoare annotation is: (let ((.cse1 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|)) (.cse4 (select |#memory_int#3| |~#unsigned_char_Array_0~0.base|))) (let ((.cse2 (select .cse4 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse0 (select .cse1 (_ bv3 32))) (.cse3 (select .cse4 (bvadd (_ bv2 32) |~#unsigned_char_Array_0~0.offset|)))) (and (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet53#1_54| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet53#1_54|) .cse0)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet47#1_48| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet47#1_48|) (select .cse1 (_ bv0 32)))) (bvsge ((_ zero_extend 24) ((_ extract 7 0) .cse2)) (_ bv127 32)) (= |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv0 32)) (bvsle ((_ zero_extend 24) ((_ extract 7 0) .cse3)) (_ bv127 32)) (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse4 |~#unsigned_char_Array_0~0.offset|))) (_ bv127 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet68#1_35| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet68#1_35|) .cse2)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet50#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet50#1_47|) (select .cse1 (_ bv2 32)))) (bvsle ((_ zero_extend 24) ((_ extract 7 0) .cse0)) (_ bv0 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet65#1_35| (_ BitVec 8))) (= .cse3 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet65#1_35|)))))) [2023-12-24 13:01:25,970 INFO L899 garLoopResultBuilder]: For program point L76-1(line 76) no Hoare annotation was computed. [2023-12-24 13:01:25,970 INFO L895 garLoopResultBuilder]: At program point L78(line 78) the Hoare annotation is: (let ((.cse1 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|)) (.cse4 (select |#memory_int#3| |~#unsigned_char_Array_0~0.base|))) (let ((.cse2 (select .cse4 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse0 (select .cse1 (_ bv3 32))) (.cse3 (select .cse4 (bvadd (_ bv2 32) |~#unsigned_char_Array_0~0.offset|)))) (and (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet53#1_54| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet53#1_54|) .cse0)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet47#1_48| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet47#1_48|) (select .cse1 (_ bv0 32)))) (bvsge ((_ zero_extend 24) ((_ extract 7 0) .cse2)) (_ bv127 32)) (= |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv0 32)) (bvsle ((_ zero_extend 24) ((_ extract 7 0) .cse3)) (_ bv127 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet68#1_35| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet68#1_35|) .cse2)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet50#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet50#1_47|) (select .cse1 (_ bv2 32)))) (bvsle ((_ zero_extend 24) ((_ extract 7 0) .cse0)) (_ bv0 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet65#1_35| (_ BitVec 8))) (= .cse3 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet65#1_35|)))))) [2023-12-24 13:01:25,970 INFO L899 garLoopResultBuilder]: For program point L78-1(line 78) no Hoare annotation was computed. [2023-12-24 13:01:25,970 INFO L895 garLoopResultBuilder]: At program point L79(line 79) the Hoare annotation is: (let ((.cse2 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|)) (.cse1 (select |#memory_int#3| |~#unsigned_char_Array_0~0.base|))) (let ((.cse3 (select .cse1 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse0 (select .cse2 (_ bv3 32))) (.cse4 (select .cse1 (bvadd (_ bv2 32) |~#unsigned_char_Array_0~0.offset|)))) (and (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet53#1_54| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet53#1_54|) .cse0)) (= ((_ extract 7 0) (select .cse1 |~#unsigned_char_Array_0~0.offset|)) |ULTIMATE.start_updateVariables_#t~mem64#1|) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet47#1_48| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet47#1_48|) (select .cse2 (_ bv0 32)))) (bvsge ((_ zero_extend 24) ((_ extract 7 0) .cse3)) (_ bv127 32)) (= |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv0 32)) (bvsle ((_ zero_extend 24) ((_ extract 7 0) .cse4)) (_ bv127 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet68#1_35| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet68#1_35|) .cse3)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet50#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet50#1_47|) (select .cse2 (_ bv2 32)))) (bvsle ((_ zero_extend 24) ((_ extract 7 0) .cse0)) (_ bv0 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet65#1_35| (_ BitVec 8))) (= .cse4 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet65#1_35|)))))) [2023-12-24 13:01:25,970 INFO L899 garLoopResultBuilder]: For program point L79-1(line 79) no Hoare annotation was computed. [2023-12-24 13:01:25,970 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-24 13:01:25,970 INFO L895 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: (let ((.cse1 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|)) (.cse4 (select |#memory_int#3| |~#unsigned_char_Array_0~0.base|))) (let ((.cse2 (select .cse4 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse0 (select .cse1 (_ bv3 32))) (.cse3 (select .cse4 (bvadd (_ bv2 32) |~#unsigned_char_Array_0~0.offset|)))) (and (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet53#1_54| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet53#1_54|) .cse0)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet47#1_48| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet47#1_48|) (select .cse1 (_ bv0 32)))) (bvsge ((_ zero_extend 24) ((_ extract 7 0) .cse2)) (_ bv127 32)) (= |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv0 32)) (bvsle ((_ zero_extend 24) ((_ extract 7 0) .cse3)) (_ bv127 32)) (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse4 |~#unsigned_char_Array_0~0.offset|))) (_ bv127 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet68#1_35| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet68#1_35|) .cse2)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet50#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet50#1_47|) (select .cse1 (_ bv2 32)))) (bvsle ((_ zero_extend 24) ((_ extract 7 0) .cse0)) (_ bv0 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet65#1_35| (_ BitVec 8))) (= .cse3 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet65#1_35|)))))) [2023-12-24 13:01:25,970 INFO L899 garLoopResultBuilder]: For program point L63-1(line 63) no Hoare annotation was computed. [2023-12-24 13:01:25,971 INFO L895 garLoopResultBuilder]: At program point L96-2(lines 96 102) the Hoare annotation is: (let ((.cse1 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|)) (.cse4 (select |#memory_int#3| |~#unsigned_char_Array_0~0.base|))) (let ((.cse2 (select .cse4 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse0 (select .cse1 (_ bv3 32))) (.cse3 (select .cse4 (bvadd (_ bv2 32) |~#unsigned_char_Array_0~0.offset|)))) (and (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet53#1_54| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet53#1_54|) .cse0)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet47#1_48| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet47#1_48|) (select .cse1 (_ bv0 32)))) (bvsge ((_ zero_extend 24) ((_ extract 7 0) .cse2)) (_ bv127 32)) (= |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv0 32)) (bvsle ((_ zero_extend 24) ((_ extract 7 0) .cse3)) (_ bv127 32)) (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse4 |~#unsigned_char_Array_0~0.offset|))) (_ bv127 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet68#1_35| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet68#1_35|) .cse2)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet50#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet50#1_47|) (select .cse1 (_ bv2 32)))) (bvsle ((_ zero_extend 24) ((_ extract 7 0) .cse0)) (_ bv0 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet65#1_35| (_ BitVec 8))) (= .cse3 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet65#1_35|)))))) [2023-12-24 13:01:25,971 INFO L899 garLoopResultBuilder]: For program point L96-3(lines 96 102) no Hoare annotation was computed. [2023-12-24 13:01:25,971 INFO L895 garLoopResultBuilder]: At program point L64(line 64) the Hoare annotation is: (let ((.cse1 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|)) (.cse4 (select |#memory_int#3| |~#unsigned_char_Array_0~0.base|))) (let ((.cse2 (select .cse4 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse0 (select .cse1 (_ bv3 32))) (.cse3 (select .cse4 (bvadd (_ bv2 32) |~#unsigned_char_Array_0~0.offset|)))) (and (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet53#1_54| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet53#1_54|) .cse0)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet47#1_48| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet47#1_48|) (select .cse1 (_ bv0 32)))) (bvsge ((_ zero_extend 24) ((_ extract 7 0) .cse2)) (_ bv127 32)) (= |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv0 32)) (bvsle ((_ zero_extend 24) ((_ extract 7 0) .cse3)) (_ bv127 32)) (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse4 |~#unsigned_char_Array_0~0.offset|))) (_ bv127 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet68#1_35| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet68#1_35|) .cse2)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet50#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet50#1_47|) (select .cse1 (_ bv2 32)))) (bvsle ((_ zero_extend 24) ((_ extract 7 0) .cse0)) (_ bv0 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet65#1_35| (_ BitVec 8))) (= .cse3 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet65#1_35|)))))) [2023-12-24 13:01:25,971 INFO L899 garLoopResultBuilder]: For program point L64-1(line 64) no Hoare annotation was computed. [2023-12-24 13:01:25,971 INFO L895 garLoopResultBuilder]: At program point L81(line 81) the Hoare annotation is: (let ((.cse1 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse0 (select .cse1 (_ bv3 32))) (.cse2 (select |#memory_int#3| |~#unsigned_char_Array_0~0.base|))) (and (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet53#1_54| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet53#1_54|) .cse0)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet47#1_48| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet47#1_48|) (select .cse1 (_ bv0 32)))) (= |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv0 32)) (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse2 |~#unsigned_char_Array_0~0.offset|))) (_ bv127 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet68#1_35| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet68#1_35|) (select .cse2 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32))))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet50#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet50#1_47|) (select .cse1 (_ bv2 32)))) (bvsle ((_ zero_extend 24) ((_ extract 7 0) .cse0)) (_ bv0 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet65#1_35| (_ BitVec 8))) (= (select .cse2 (bvadd (_ bv2 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet65#1_35|)))))) [2023-12-24 13:01:25,971 INFO L899 garLoopResultBuilder]: For program point L81-1(line 81) no Hoare annotation was computed. [2023-12-24 13:01:25,971 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-24 13:01:25,971 INFO L895 garLoopResultBuilder]: At program point L82(line 82) the Hoare annotation is: (let ((.cse3 (select |#memory_int#3| |~#unsigned_char_Array_0~0.base|)) (.cse2 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse0 (select .cse2 (_ bv3 32))) (.cse1 (select .cse3 (bvadd (_ bv2 32) |~#unsigned_char_Array_0~0.offset|)))) (and (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet53#1_54| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet53#1_54|) .cse0)) (= |ULTIMATE.start_updateVariables_#t~mem67#1| ((_ extract 7 0) .cse1)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet47#1_48| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet47#1_48|) (select .cse2 (_ bv0 32)))) (= |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv0 32)) (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse3 |~#unsigned_char_Array_0~0.offset|))) (_ bv127 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet68#1_35| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet68#1_35|) (select .cse3 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32))))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet50#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet50#1_47|) (select .cse2 (_ bv2 32)))) (bvsle ((_ zero_extend 24) ((_ extract 7 0) .cse0)) (_ bv0 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet65#1_35| (_ BitVec 8))) (= .cse1 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet65#1_35|)))))) [2023-12-24 13:01:25,971 INFO L899 garLoopResultBuilder]: For program point L82-1(line 82) no Hoare annotation was computed. [2023-12-24 13:01:25,976 INFO L895 garLoopResultBuilder]: At program point L66(line 66) the Hoare annotation is: (let ((.cse1 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|)) (.cse4 (select |#memory_int#3| |~#unsigned_char_Array_0~0.base|))) (let ((.cse2 (select .cse4 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse0 (select .cse1 (_ bv3 32))) (.cse3 (select .cse4 (bvadd (_ bv2 32) |~#unsigned_char_Array_0~0.offset|)))) (and (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet53#1_54| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet53#1_54|) .cse0)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet47#1_48| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet47#1_48|) (select .cse1 (_ bv0 32)))) (bvsge ((_ zero_extend 24) ((_ extract 7 0) .cse2)) (_ bv127 32)) (= |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv0 32)) (bvsle ((_ zero_extend 24) ((_ extract 7 0) .cse3)) (_ bv127 32)) (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse4 |~#unsigned_char_Array_0~0.offset|))) (_ bv127 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet68#1_35| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet68#1_35|) .cse2)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet50#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet50#1_47|) (select .cse1 (_ bv2 32)))) (bvsle ((_ zero_extend 24) ((_ extract 7 0) .cse0)) (_ bv0 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet65#1_35| (_ BitVec 8))) (= .cse3 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet65#1_35|)))))) [2023-12-24 13:01:25,977 INFO L899 garLoopResultBuilder]: For program point L66-1(line 66) no Hoare annotation was computed. [2023-12-24 13:01:25,977 INFO L899 garLoopResultBuilder]: For program point L33(lines 33 60) no Hoare annotation was computed. [2023-12-24 13:01:25,977 INFO L895 garLoopResultBuilder]: At program point L67(line 67) the Hoare annotation is: (let ((.cse1 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|)) (.cse4 (select |#memory_int#3| |~#unsigned_char_Array_0~0.base|))) (let ((.cse2 (select .cse4 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse0 (select .cse1 (_ bv3 32))) (.cse3 (select .cse4 (bvadd (_ bv2 32) |~#unsigned_char_Array_0~0.offset|)))) (and (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet53#1_54| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet53#1_54|) .cse0)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet47#1_48| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet47#1_48|) (select .cse1 (_ bv0 32)))) (bvsge ((_ zero_extend 24) ((_ extract 7 0) .cse2)) (_ bv127 32)) (= |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv0 32)) (bvsle ((_ zero_extend 24) ((_ extract 7 0) .cse3)) (_ bv127 32)) (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse4 |~#unsigned_char_Array_0~0.offset|))) (_ bv127 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet68#1_35| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet68#1_35|) .cse2)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet50#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet50#1_47|) (select .cse1 (_ bv2 32)))) (bvsle ((_ zero_extend 24) ((_ extract 7 0) .cse0)) (_ bv0 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet65#1_35| (_ BitVec 8))) (= .cse3 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet65#1_35|)))))) [2023-12-24 13:01:25,977 INFO L899 garLoopResultBuilder]: For program point L67-1(line 67) no Hoare annotation was computed. [2023-12-24 13:01:25,977 INFO L895 garLoopResultBuilder]: At program point L84(line 84) the Hoare annotation is: (let ((.cse2 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|)) (.cse4 (select |#memory_int#3| |~#unsigned_char_Array_0~0.base|))) (let ((.cse1 (select .cse4 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse0 (select .cse2 (_ bv3 32))) (.cse3 (select .cse4 (bvadd (_ bv2 32) |~#unsigned_char_Array_0~0.offset|)))) (and (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet53#1_54| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet53#1_54|) .cse0)) (= ((_ extract 7 0) .cse1) |ULTIMATE.start_updateVariables_#t~mem69#1|) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet47#1_48| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet47#1_48|) (select .cse2 (_ bv0 32)))) (= |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv0 32)) (bvsle ((_ zero_extend 24) ((_ extract 7 0) .cse3)) (_ bv127 32)) (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse4 |~#unsigned_char_Array_0~0.offset|))) (_ bv127 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet68#1_35| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet68#1_35|) .cse1)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet50#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet50#1_47|) (select .cse2 (_ bv2 32)))) (bvsle ((_ zero_extend 24) ((_ extract 7 0) .cse0)) (_ bv0 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet65#1_35| (_ BitVec 8))) (= .cse3 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet65#1_35|)))))) [2023-12-24 13:01:25,977 INFO L899 garLoopResultBuilder]: For program point L84-1(line 84) no Hoare annotation was computed. [2023-12-24 13:01:25,977 INFO L899 garLoopResultBuilder]: For program point L51(lines 51 59) no Hoare annotation was computed. [2023-12-24 13:01:25,977 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 37) no Hoare annotation was computed. [2023-12-24 13:01:25,979 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:01:25,981 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 13:01:26,002 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet53#1_54 : bv8 :: ~sign_extend~32~8(v_ULTIMATE.start_updateVariables_#t~nondet53#1_54) == #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][3bv32]) could not be translated [2023-12-24 13:01:26,002 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet47#1_48 : bv8 :: ~sign_extend~32~8(v_ULTIMATE.start_updateVariables_#t~nondet47#1_48) == #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][0bv32]) could not be translated [2023-12-24 13:01:26,003 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#unsigned_char_Array_0~0!base][~bvadd~32(~#unsigned_char_Array_0~0!offset, 1bv32)] could not be translated [2023-12-24 13:01:26,005 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#unsigned_char_Array_0~0!base][~bvadd~32(2bv32, ~#unsigned_char_Array_0~0!offset)] could not be translated [2023-12-24 13:01:26,005 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#unsigned_char_Array_0~0!base][~#unsigned_char_Array_0~0!offset] could not be translated [2023-12-24 13:01:26,005 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet68#1_35 : bv8 :: ~sign_extend~32~8(v_ULTIMATE.start_updateVariables_#t~nondet68#1_35) == #memory_int#3[~#unsigned_char_Array_0~0!base][~bvadd~32(~#unsigned_char_Array_0~0!offset, 1bv32)]) could not be translated [2023-12-24 13:01:26,005 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet50#1_47 : bv8 :: ~sign_extend~32~8(v_ULTIMATE.start_updateVariables_#t~nondet50#1_47) == #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][2bv32]) could not be translated [2023-12-24 13:01:26,005 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][3bv32] could not be translated [2023-12-24 13:01:26,006 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet65#1_35 : bv8 :: #memory_int#3[~#unsigned_char_Array_0~0!base][~bvadd~32(2bv32, ~#unsigned_char_Array_0~0!offset)] == ~sign_extend~32~8(v_ULTIMATE.start_updateVariables_#t~nondet65#1_35)) could not be translated [2023-12-24 13:01:26,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 01:01:26 BoogieIcfgContainer [2023-12-24 13:01:26,008 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 13:01:26,008 INFO L158 Benchmark]: Toolchain (without parser) took 590287.98ms. Allocated memory was 362.8MB in the beginning and 788.5MB in the end (delta: 425.7MB). Free memory was 324.5MB in the beginning and 346.0MB in the end (delta: -21.5MB). Peak memory consumption was 473.1MB. Max. memory is 8.0GB. [2023-12-24 13:01:26,008 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 192.9MB. Free memory is still 148.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 13:01:26,008 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.59ms. Allocated memory is still 362.8MB. Free memory was 324.5MB in the beginning and 307.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-24 13:01:26,008 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.83ms. Allocated memory is still 362.8MB. Free memory was 307.7MB in the beginning and 304.6MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-24 13:01:26,008 INFO L158 Benchmark]: Boogie Preprocessor took 47.78ms. Allocated memory is still 362.8MB. Free memory was 304.6MB in the beginning and 299.3MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-24 13:01:26,008 INFO L158 Benchmark]: RCFGBuilder took 622.37ms. Allocated memory is still 362.8MB. Free memory was 299.3MB in the beginning and 264.7MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2023-12-24 13:01:26,008 INFO L158 Benchmark]: TraceAbstraction took 589305.28ms. Allocated memory was 362.8MB in the beginning and 788.5MB in the end (delta: 425.7MB). Free memory was 263.7MB in the beginning and 346.0MB in the end (delta: -82.3MB). Peak memory consumption was 412.3MB. Max. memory is 8.0GB. [2023-12-24 13:01:26,009 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.11ms. Allocated memory is still 192.9MB. Free memory is still 148.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 268.59ms. Allocated memory is still 362.8MB. Free memory was 324.5MB in the beginning and 307.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.83ms. Allocated memory is still 362.8MB. Free memory was 307.7MB in the beginning and 304.6MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.78ms. Allocated memory is still 362.8MB. Free memory was 304.6MB in the beginning and 299.3MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 622.37ms. Allocated memory is still 362.8MB. Free memory was 299.3MB in the beginning and 264.7MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 589305.28ms. Allocated memory was 362.8MB in the beginning and 788.5MB in the end (delta: 425.7MB). Free memory was 263.7MB in the beginning and 346.0MB in the end (delta: -82.3MB). Peak memory consumption was 412.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet53#1_54 : bv8 :: ~sign_extend~32~8(v_ULTIMATE.start_updateVariables_#t~nondet53#1_54) == #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][3bv32]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet47#1_48 : bv8 :: ~sign_extend~32~8(v_ULTIMATE.start_updateVariables_#t~nondet47#1_48) == #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][0bv32]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#unsigned_char_Array_0~0!base][~bvadd~32(~#unsigned_char_Array_0~0!offset, 1bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#unsigned_char_Array_0~0!base][~bvadd~32(2bv32, ~#unsigned_char_Array_0~0!offset)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#unsigned_char_Array_0~0!base][~#unsigned_char_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet68#1_35 : bv8 :: ~sign_extend~32~8(v_ULTIMATE.start_updateVariables_#t~nondet68#1_35) == #memory_int#3[~#unsigned_char_Array_0~0!base][~bvadd~32(~#unsigned_char_Array_0~0!offset, 1bv32)]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet50#1_47 : bv8 :: ~sign_extend~32~8(v_ULTIMATE.start_updateVariables_#t~nondet50#1_47) == #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][2bv32]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][3bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet65#1_35 : bv8 :: #memory_int#3[~#unsigned_char_Array_0~0!base][~bvadd~32(2bv32, ~#unsigned_char_Array_0~0!offset)] == ~sign_extend~32~8(v_ULTIMATE.start_updateVariables_#t~nondet65#1_35)) could not be translated * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 91 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 589.2s, OverallIterations: 32, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 15.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 542.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4275 SdHoareTripleChecker+Valid, 10.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4244 mSDsluCounter, 18181 SdHoareTripleChecker+Invalid, 8.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14086 mSDsCounter, 226 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7264 IncrementalHoareTripleChecker+Invalid, 7490 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 226 mSolverCounterUnsat, 4095 mSDtfsCounter, 7264 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5864 GetRequests, 5377 SyntacticMatches, 8 SemanticMatches, 479 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3262 ImplicationChecksByTransitivity, 10.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=407occurred in iteration=21, InterpolantAutomatonStates: 303, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 32 MinimizatonAttempts, 2626 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 943 PreInvPairs, 1001 NumberOfFragments, 1527 HoareAnnotationTreeSize, 943 FormulaSimplifications, 2006640273 FormulaSimplificationTreeSizeReduction, 518.7s HoareSimplificationTime, 18 FormulaSimplificationsInter, 575878392 FormulaSimplificationTreeSizeReductionInter, 23.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.0s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 17.3s InterpolantComputationTime, 4410 NumberOfCodeBlocks, 4410 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 5463 ConstructedInterpolants, 797 QuantifiedInterpolants, 40494 SizeOfPredicates, 337 NumberOfNonLiveVariables, 8926 ConjunctsInSsa, 508 ConjunctsInUnsatCore, 45 InterpolantComputations, 29 PerfectInterpolantSequences, 21246/21600 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: (((((null & 127) >= 127) && ((null & 127) <= 127)) && ((null & 127) <= 127)) && ((null & 127) <= 0)) RESULT: Ultimate proved your program to be correct! [2023-12-24 13:01:26,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...