/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_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-37.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 01:44:49,615 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 01:44:49,685 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-21 01:44:49,689 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 01:44:49,689 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 01:44:49,710 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 01:44:49,711 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 01:44:49,711 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 01:44:49,711 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 01:44:49,714 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 01:44:49,714 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 01:44:49,715 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 01:44:49,715 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 01:44:49,716 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 01:44:49,716 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 01:44:49,716 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 01:44:49,717 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 01:44:49,717 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 01:44:49,718 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 01:44:49,718 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 01:44:49,718 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 01:44:49,719 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 01:44:49,719 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 01:44:49,719 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 01:44:49,719 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 01:44:49,719 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 01:44:49,719 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 01:44:49,719 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 01:44:49,720 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 01:44:49,720 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 01:44:49,721 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 01:44:49,721 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 01:44:49,721 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 01:44:49,721 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 01:44:49,721 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 01:44:49,721 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 01:44:49,722 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 01:44:49,722 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 01:44:49,722 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 01:44:49,722 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 01:44:49,722 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 01:44:49,722 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 01:44:49,723 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 01:44:49,723 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-21 01:44:49,869 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 01:44:49,882 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 01:44:49,884 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 01:44:49,885 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 01:44:49,885 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 01:44:49,885 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-37.i [2023-12-21 01:44:50,906 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 01:44:51,072 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 01:44:51,072 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-37.i [2023-12-21 01:44:51,077 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ea64eb16/a34e7c1da0fb4fffbf156a1c0b43008a/FLAG80a2d51ab [2023-12-21 01:44:51,487 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ea64eb16/a34e7c1da0fb4fffbf156a1c0b43008a [2023-12-21 01:44:51,489 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 01:44:51,490 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 01:44:51,491 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 01:44:51,491 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 01:44:51,494 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 01:44:51,494 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 01:44:51" (1/1) ... [2023-12-21 01:44:51,495 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b4ba5c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:44:51, skipping insertion in model container [2023-12-21 01:44:51,495 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 01:44:51" (1/1) ... [2023-12-21 01:44:51,526 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 01:44:51,639 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-37.i[916,929] [2023-12-21 01:44:51,707 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 01:44:51,716 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 01:44:51,723 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-37.i[916,929] [2023-12-21 01:44:51,759 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 01:44:51,771 INFO L206 MainTranslator]: Completed translation [2023-12-21 01:44:51,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:44:51 WrapperNode [2023-12-21 01:44:51,772 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 01:44:51,773 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 01:44:51,773 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 01:44:51,773 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 01:44:51,777 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:44:51" (1/1) ... [2023-12-21 01:44:51,815 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:44:51" (1/1) ... [2023-12-21 01:44:51,847 INFO L138 Inliner]: procedures = 29, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 462 [2023-12-21 01:44:51,848 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 01:44:51,848 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 01:44:51,848 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 01:44:51,848 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 01:44:51,868 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:44:51" (1/1) ... [2023-12-21 01:44:51,868 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:44:51" (1/1) ... [2023-12-21 01:44:51,875 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:44:51" (1/1) ... [2023-12-21 01:44:51,899 INFO L175 MemorySlicer]: Split 124 memory accesses to 8 slices as follows [2, 8, 52, 20, 7, 15, 6, 14]. 42 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 5, 2, 1, 2, 1, 2]. The 17 writes are split as follows [0, 1, 7, 2, 1, 3, 1, 2]. [2023-12-21 01:44:51,899 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:44:51" (1/1) ... [2023-12-21 01:44:51,900 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:44:51" (1/1) ... [2023-12-21 01:44:51,912 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:44:51" (1/1) ... [2023-12-21 01:44:51,915 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:44:51" (1/1) ... [2023-12-21 01:44:51,917 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:44:51" (1/1) ... [2023-12-21 01:44:51,919 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:44:51" (1/1) ... [2023-12-21 01:44:51,927 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 01:44:51,927 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 01:44:51,928 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 01:44:51,928 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 01:44:51,928 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:44:51" (1/1) ... [2023-12-21 01:44:51,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 01:44:51,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 01:44:51,958 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-21 01:44:51,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-21 01:44:51,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 01:44:51,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-21 01:44:51,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-21 01:44:51,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-12-21 01:44:51,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2023-12-21 01:44:51,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2023-12-21 01:44:51,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2023-12-21 01:44:51,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2023-12-21 01:44:51,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2023-12-21 01:44:51,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-21 01:44:51,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-21 01:44:51,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-21 01:44:51,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-21 01:44:51,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-21 01:44:51,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-12-21 01:44:51,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2023-12-21 01:44:51,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2023-12-21 01:44:51,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-21 01:44:51,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-21 01:44:51,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-12-21 01:44:51,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2023-12-21 01:44:51,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2023-12-21 01:44:51,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2023-12-21 01:44:51,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2023-12-21 01:44:51,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2023-12-21 01:44:51,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-21 01:44:51,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-21 01:44:51,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-21 01:44:51,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-21 01:44:51,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-21 01:44:51,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-12-21 01:44:51,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2023-12-21 01:44:51,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2023-12-21 01:44:51,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-21 01:44:51,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-21 01:44:51,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-12-21 01:44:51,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2023-12-21 01:44:51,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2023-12-21 01:44:51,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2023-12-21 01:44:51,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2023-12-21 01:44:51,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2023-12-21 01:44:51,984 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-21 01:44:51,984 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-21 01:44:51,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 01:44:51,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-21 01:44:51,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-21 01:44:51,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-21 01:44:51,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-21 01:44:51,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-12-21 01:44:51,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-12-21 01:44:51,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2023-12-21 01:44:51,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 01:44:51,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 01:44:52,134 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 01:44:52,136 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 01:44:52,482 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 01:44:52,509 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 01:44:52,509 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-21 01:44:52,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 01:44:52 BoogieIcfgContainer [2023-12-21 01:44:52,509 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 01:44:52,511 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 01:44:52,511 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 01:44:52,513 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 01:44:52,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 01:44:51" (1/3) ... [2023-12-21 01:44:52,514 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ae1ab6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 01:44:52, skipping insertion in model container [2023-12-21 01:44:52,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:44:51" (2/3) ... [2023-12-21 01:44:52,514 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ae1ab6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 01:44:52, skipping insertion in model container [2023-12-21 01:44:52,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 01:44:52" (3/3) ... [2023-12-21 01:44:52,515 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-37.i [2023-12-21 01:44:52,538 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 01:44:52,538 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 01:44:52,570 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 01:44:52,574 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;@33676bdf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 01:44:52,575 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 01:44:52,577 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 73 states have internal predecessors, (103), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-21 01:44:52,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-21 01:44:52,586 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:44:52,587 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:44:52,587 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:44:52,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:44:52,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1753225376, now seen corresponding path program 1 times [2023-12-21 01:44:52,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:44:52,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442413857] [2023-12-21 01:44:52,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:44:52,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:44:52,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:52,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 01:44:52,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:52,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-21 01:44:52,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:52,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:44:52,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:52,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 01:44:52,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:52,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:44:52,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:52,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:44:52,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:52,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:44:52,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:52,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:44:52,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:52,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:44:52,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:52,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:44:52,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:52,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 01:44:52,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:52,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:44:52,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:52,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:44:52,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:52,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 01:44:52,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:52,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 01:44:52,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:52,834 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-21 01:44:52,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:44:52,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442413857] [2023-12-21 01:44:52,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442413857] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:44:52,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:44:52,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 01:44:52,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011813323] [2023-12-21 01:44:52,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:44:52,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 01:44:52,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:44:52,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 01:44:52,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 01:44:52,865 INFO L87 Difference]: Start difference. First operand has 90 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 73 states have internal predecessors, (103), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-21 01:44:52,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:44:52,908 INFO L93 Difference]: Finished difference Result 177 states and 279 transitions. [2023-12-21 01:44:52,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 01:44:52,911 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 117 [2023-12-21 01:44:52,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:44:52,917 INFO L225 Difference]: With dead ends: 177 [2023-12-21 01:44:52,917 INFO L226 Difference]: Without dead ends: 88 [2023-12-21 01:44:52,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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-21 01:44:52,921 INFO L413 NwaCegarLoop]: 124 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, 124 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-21 01:44:52,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:44:52,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-12-21 01:44:52,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-12-21 01:44:52,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 71 states have (on average 1.380281690140845) internal successors, (98), 71 states have internal predecessors, (98), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-21 01:44:52,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 128 transitions. [2023-12-21 01:44:52,963 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 128 transitions. Word has length 117 [2023-12-21 01:44:52,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:44:52,964 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 128 transitions. [2023-12-21 01:44:52,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-21 01:44:52,964 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 128 transitions. [2023-12-21 01:44:52,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-21 01:44:52,966 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:44:52,966 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:44:52,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 01:44:52,967 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:44:52,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:44:52,967 INFO L85 PathProgramCache]: Analyzing trace with hash 396753538, now seen corresponding path program 1 times [2023-12-21 01:44:52,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:44:52,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733888540] [2023-12-21 01:44:52,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:44:52,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:44:53,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:53,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 01:44:53,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:53,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-21 01:44:53,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:53,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:44:53,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:53,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 01:44:53,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:53,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:44:53,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:53,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:44:53,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:53,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:44:53,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:53,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:44:53,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:53,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:44:53,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:53,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:44:53,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:53,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 01:44:53,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:53,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:44:53,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:53,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:44:53,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:53,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 01:44:53,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:53,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 01:44:53,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:53,318 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-21 01:44:53,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:44:53,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733888540] [2023-12-21 01:44:53,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733888540] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:44:53,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:44:53,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 01:44:53,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509515698] [2023-12-21 01:44:53,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:44:53,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 01:44:53,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:44:53,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 01:44:53,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 01:44:53,325 INFO L87 Difference]: Start difference. First operand 88 states and 128 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-21 01:44:53,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:44:53,392 INFO L93 Difference]: Finished difference Result 187 states and 272 transitions. [2023-12-21 01:44:53,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 01:44:53,392 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 117 [2023-12-21 01:44:53,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:44:53,396 INFO L225 Difference]: With dead ends: 187 [2023-12-21 01:44:53,396 INFO L226 Difference]: Without dead ends: 100 [2023-12-21 01:44:53,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 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-21 01:44:53,399 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 21 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:44:53,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 363 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:44:53,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-12-21 01:44:53,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 90. [2023-12-21 01:44:53,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 73 states have (on average 1.36986301369863) internal successors, (100), 73 states have internal predecessors, (100), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-21 01:44:53,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 130 transitions. [2023-12-21 01:44:53,408 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 130 transitions. Word has length 117 [2023-12-21 01:44:53,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:44:53,409 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 130 transitions. [2023-12-21 01:44:53,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-21 01:44:53,409 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 130 transitions. [2023-12-21 01:44:53,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-21 01:44:53,411 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:44:53,411 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:44:53,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 01:44:53,411 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:44:53,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:44:53,411 INFO L85 PathProgramCache]: Analyzing trace with hash -412593088, now seen corresponding path program 1 times [2023-12-21 01:44:53,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:44:53,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335190614] [2023-12-21 01:44:53,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:44:53,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:44:53,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:53,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 01:44:53,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:53,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-21 01:44:53,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:53,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:44:53,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:53,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 01:44:53,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:53,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:44:53,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:53,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:44:53,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:53,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:44:53,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:53,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:44:53,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:53,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:44:53,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:53,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:44:53,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:53,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 01:44:53,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:53,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:44:53,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:53,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:44:53,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:53,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 01:44:53,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:53,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 01:44:53,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:53,624 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-21 01:44:53,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:44:53,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335190614] [2023-12-21 01:44:53,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335190614] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:44:53,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:44:53,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 01:44:53,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820030033] [2023-12-21 01:44:53,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:44:53,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 01:44:53,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:44:53,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 01:44:53,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 01:44:53,629 INFO L87 Difference]: Start difference. First operand 90 states and 130 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-21 01:44:53,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:44:53,669 INFO L93 Difference]: Finished difference Result 187 states and 270 transitions. [2023-12-21 01:44:53,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 01:44:53,670 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 117 [2023-12-21 01:44:53,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:44:53,672 INFO L225 Difference]: With dead ends: 187 [2023-12-21 01:44:53,672 INFO L226 Difference]: Without dead ends: 98 [2023-12-21 01:44:53,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 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-21 01:44:53,673 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 12 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:44:53,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 361 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:44:53,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-12-21 01:44:53,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 92. [2023-12-21 01:44:53,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 75 states have (on average 1.36) internal successors, (102), 75 states have internal predecessors, (102), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-21 01:44:53,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 132 transitions. [2023-12-21 01:44:53,679 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 132 transitions. Word has length 117 [2023-12-21 01:44:53,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:44:53,680 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 132 transitions. [2023-12-21 01:44:53,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-21 01:44:53,680 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 132 transitions. [2023-12-21 01:44:53,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-21 01:44:53,681 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:44:53,681 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:44:53,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-21 01:44:53,682 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:44:53,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:44:53,682 INFO L85 PathProgramCache]: Analyzing trace with hash -355334786, now seen corresponding path program 1 times [2023-12-21 01:44:53,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:44:53,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164774803] [2023-12-21 01:44:53,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:44:53,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:44:53,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:53,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 01:44:53,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:53,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-21 01:44:53,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:53,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:44:53,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:53,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 01:44:53,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:53,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:44:53,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:53,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:44:53,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:53,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:44:53,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:53,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:44:53,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:53,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:44:53,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:53,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:44:53,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:53,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 01:44:53,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:53,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:44:53,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:53,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:44:53,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:53,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 01:44:53,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:53,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 01:44:53,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:53,837 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-21 01:44:53,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:44:53,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164774803] [2023-12-21 01:44:53,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164774803] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:44:53,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:44:53,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 01:44:53,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996247198] [2023-12-21 01:44:53,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:44:53,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 01:44:53,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:44:53,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 01:44:53,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 01:44:53,838 INFO L87 Difference]: Start difference. First operand 92 states and 132 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-21 01:44:53,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:44:53,860 INFO L93 Difference]: Finished difference Result 187 states and 268 transitions. [2023-12-21 01:44:53,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 01:44:53,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 117 [2023-12-21 01:44:53,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:44:53,861 INFO L225 Difference]: With dead ends: 187 [2023-12-21 01:44:53,862 INFO L226 Difference]: Without dead ends: 96 [2023-12-21 01:44:53,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 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-21 01:44:53,863 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 3 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:44:53,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 361 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:44:53,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-12-21 01:44:53,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2023-12-21 01:44:53,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 77 states have (on average 1.3506493506493507) internal successors, (104), 77 states have internal predecessors, (104), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-21 01:44:53,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 134 transitions. [2023-12-21 01:44:53,868 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 134 transitions. Word has length 117 [2023-12-21 01:44:53,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:44:53,868 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 134 transitions. [2023-12-21 01:44:53,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-21 01:44:53,868 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 134 transitions. [2023-12-21 01:44:53,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-21 01:44:53,869 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:44:53,869 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:44:53,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-21 01:44:53,870 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:44:53,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:44:53,870 INFO L85 PathProgramCache]: Analyzing trace with hash -355275204, now seen corresponding path program 1 times [2023-12-21 01:44:53,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:44:53,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815473053] [2023-12-21 01:44:53,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:44:53,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:44:53,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:54,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 01:44:54,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:54,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-21 01:44:54,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:54,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:44:54,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:54,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 01:44:54,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:54,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:44:54,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:54,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:44:54,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:54,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:44:54,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:54,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:44:54,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:54,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:44:54,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:54,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:44:54,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:54,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 01:44:54,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:54,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:44:54,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:54,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:44:54,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:54,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 01:44:54,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:54,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 01:44:54,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:54,534 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-21 01:44:54,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:44:54,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815473053] [2023-12-21 01:44:54,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815473053] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:44:54,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:44:54,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 01:44:54,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910772955] [2023-12-21 01:44:54,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:44:54,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 01:44:54,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:44:54,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 01:44:54,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 01:44:54,538 INFO L87 Difference]: Start difference. First operand 94 states and 134 transitions. Second operand has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-21 01:44:54,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:44:54,621 INFO L93 Difference]: Finished difference Result 211 states and 300 transitions. [2023-12-21 01:44:54,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 01:44:54,621 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 117 [2023-12-21 01:44:54,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:44:54,623 INFO L225 Difference]: With dead ends: 211 [2023-12-21 01:44:54,623 INFO L226 Difference]: Without dead ends: 118 [2023-12-21 01:44:54,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-21 01:44:54,626 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 132 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 01:44:54,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 586 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 01:44:54,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-12-21 01:44:54,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2023-12-21 01:44:54,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 92 states have (on average 1.315217391304348) internal successors, (121), 93 states have internal predecessors, (121), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-21 01:44:54,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 165 transitions. [2023-12-21 01:44:54,647 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 165 transitions. Word has length 117 [2023-12-21 01:44:54,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:44:54,647 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 165 transitions. [2023-12-21 01:44:54,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-21 01:44:54,648 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 165 transitions. [2023-12-21 01:44:54,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-21 01:44:54,649 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:44:54,649 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:44:54,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-21 01:44:54,649 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:44:54,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:44:54,649 INFO L85 PathProgramCache]: Analyzing trace with hash -942542819, now seen corresponding path program 1 times [2023-12-21 01:44:54,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:44:54,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27691523] [2023-12-21 01:44:54,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:44:54,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:44:54,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:54,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 01:44:54,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:54,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-21 01:44:54,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:54,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:44:54,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:54,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 01:44:54,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:54,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:44:54,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:54,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:44:54,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:54,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:44:54,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:54,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:44:54,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:54,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:44:54,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:54,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:44:54,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:55,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 01:44:55,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:55,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:44:55,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:55,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:44:55,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:55,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 01:44:55,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:55,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 01:44:55,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:55,010 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-21 01:44:55,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:44:55,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27691523] [2023-12-21 01:44:55,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27691523] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:44:55,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:44:55,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 01:44:55,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5567297] [2023-12-21 01:44:55,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:44:55,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 01:44:55,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:44:55,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 01:44:55,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 01:44:55,012 INFO L87 Difference]: Start difference. First operand 117 states and 165 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-21 01:44:55,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:44:55,130 INFO L93 Difference]: Finished difference Result 339 states and 473 transitions. [2023-12-21 01:44:55,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 01:44:55,131 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 120 [2023-12-21 01:44:55,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:44:55,133 INFO L225 Difference]: With dead ends: 339 [2023-12-21 01:44:55,133 INFO L226 Difference]: Without dead ends: 242 [2023-12-21 01:44:55,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-21 01:44:55,136 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 182 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 01:44:55,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 604 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 01:44:55,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2023-12-21 01:44:55,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 210. [2023-12-21 01:44:55,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 168 states have (on average 1.3154761904761905) internal successors, (221), 170 states have internal predecessors, (221), 37 states have call successors, (37), 4 states have call predecessors, (37), 4 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2023-12-21 01:44:55,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 295 transitions. [2023-12-21 01:44:55,152 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 295 transitions. Word has length 120 [2023-12-21 01:44:55,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:44:55,152 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 295 transitions. [2023-12-21 01:44:55,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-21 01:44:55,153 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 295 transitions. [2023-12-21 01:44:55,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-21 01:44:55,153 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:44:55,153 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:44:55,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-21 01:44:55,154 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:44:55,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:44:55,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1953660069, now seen corresponding path program 1 times [2023-12-21 01:44:55,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:44:55,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343571594] [2023-12-21 01:44:55,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:44:55,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:44:55,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:55,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 01:44:55,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:55,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-21 01:44:55,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:55,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:44:55,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:55,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 01:44:55,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:55,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:44:55,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:55,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:44:55,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:55,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:44:55,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:55,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:44:55,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:55,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:44:55,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:55,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:44:55,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:55,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 01:44:55,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:55,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:44:55,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:55,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:44:55,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:55,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 01:44:55,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:55,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 01:44:55,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:55,617 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 39 proven. 3 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-12-21 01:44:55,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:44:55,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343571594] [2023-12-21 01:44:55,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343571594] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 01:44:55,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165613907] [2023-12-21 01:44:55,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:44:55,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 01:44:55,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 01:44:55,620 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 01:44:55,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-21 01:44:55,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:55,820 INFO L262 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-21 01:44:55,850 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 01:44:55,941 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-21 01:44:55,999 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 23 treesize of output 11 [2023-12-21 01:44:56,254 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-21 01:44:56,258 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 19 treesize of output 11 [2023-12-21 01:44:56,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-21 01:44:56,307 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-21 01:44:56,327 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 215 proven. 3 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2023-12-21 01:44:56,327 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 01:44:56,530 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 29 treesize of output 17 [2023-12-21 01:44:56,598 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 39 proven. 3 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-12-21 01:44:56,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165613907] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 01:44:56,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 01:44:56,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2023-12-21 01:44:56,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035442446] [2023-12-21 01:44:56,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 01:44:56,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-21 01:44:56,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:44:56,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-21 01:44:56,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=597, Unknown=0, NotChecked=0, Total=702 [2023-12-21 01:44:56,601 INFO L87 Difference]: Start difference. First operand 210 states and 295 transitions. Second operand has 27 states, 24 states have (on average 4.375) internal successors, (105), 27 states have internal predecessors, (105), 11 states have call successors, (42), 4 states have call predecessors, (42), 7 states have return successors, (42), 8 states have call predecessors, (42), 11 states have call successors, (42) [2023-12-21 01:44:57,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:44:57,115 INFO L93 Difference]: Finished difference Result 420 states and 576 transitions. [2023-12-21 01:44:57,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-21 01:44:57,116 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 4.375) internal successors, (105), 27 states have internal predecessors, (105), 11 states have call successors, (42), 4 states have call predecessors, (42), 7 states have return successors, (42), 8 states have call predecessors, (42), 11 states have call successors, (42) Word has length 120 [2023-12-21 01:44:57,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:44:57,117 INFO L225 Difference]: With dead ends: 420 [2023-12-21 01:44:57,117 INFO L226 Difference]: Without dead ends: 230 [2023-12-21 01:44:57,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=290, Invalid=1116, Unknown=0, NotChecked=0, Total=1406 [2023-12-21 01:44:57,119 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 352 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 01:44:57,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 357 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 01:44:57,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2023-12-21 01:44:57,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 214. [2023-12-21 01:44:57,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 172 states have (on average 1.302325581395349) internal successors, (224), 174 states have internal predecessors, (224), 35 states have call successors, (35), 6 states have call predecessors, (35), 6 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2023-12-21 01:44:57,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 294 transitions. [2023-12-21 01:44:57,132 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 294 transitions. Word has length 120 [2023-12-21 01:44:57,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:44:57,132 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 294 transitions. [2023-12-21 01:44:57,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 4.375) internal successors, (105), 27 states have internal predecessors, (105), 11 states have call successors, (42), 4 states have call predecessors, (42), 7 states have return successors, (42), 8 states have call predecessors, (42), 11 states have call successors, (42) [2023-12-21 01:44:57,132 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 294 transitions. [2023-12-21 01:44:57,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-21 01:44:57,133 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:44:57,133 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:44:57,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-21 01:44:57,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 01:44:57,340 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:44:57,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:44:57,341 INFO L85 PathProgramCache]: Analyzing trace with hash 535868893, now seen corresponding path program 1 times [2023-12-21 01:44:57,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:44:57,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658012363] [2023-12-21 01:44:57,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:44:57,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:44:57,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:57,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 01:44:57,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:57,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-21 01:44:57,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:57,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:44:57,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:57,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 01:44:57,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:57,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:44:57,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:57,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:44:57,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:57,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:44:57,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:57,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:44:57,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:57,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:44:57,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:57,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:44:57,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:57,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 01:44:57,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:57,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:44:57,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:57,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:44:57,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:57,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 01:44:57,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:57,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 01:44:57,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:57,738 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-21 01:44:57,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:44:57,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658012363] [2023-12-21 01:44:57,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658012363] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:44:57,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:44:57,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-21 01:44:57,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167344910] [2023-12-21 01:44:57,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:44:57,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-21 01:44:57,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:44:57,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-21 01:44:57,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-21 01:44:57,739 INFO L87 Difference]: Start difference. First operand 214 states and 294 transitions. Second operand has 9 states, 8 states have (on average 6.0) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-21 01:44:57,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:44:57,978 INFO L93 Difference]: Finished difference Result 437 states and 598 transitions. [2023-12-21 01:44:57,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-21 01:44:57,979 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 120 [2023-12-21 01:44:57,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:44:57,981 INFO L225 Difference]: With dead ends: 437 [2023-12-21 01:44:57,981 INFO L226 Difference]: Without dead ends: 243 [2023-12-21 01:44:57,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-12-21 01:44:57,982 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 242 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 01:44:57,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 545 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 01:44:57,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2023-12-21 01:44:57,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 215. [2023-12-21 01:44:57,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 173 states have (on average 1.2947976878612717) internal successors, (224), 175 states have internal predecessors, (224), 35 states have call successors, (35), 6 states have call predecessors, (35), 6 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2023-12-21 01:44:57,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 294 transitions. [2023-12-21 01:44:57,998 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 294 transitions. Word has length 120 [2023-12-21 01:44:57,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:44:57,999 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 294 transitions. [2023-12-21 01:44:57,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-21 01:44:57,999 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 294 transitions. [2023-12-21 01:44:57,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-21 01:44:57,999 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:44:58,000 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:44:58,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-21 01:44:58,000 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:44:58,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:44:58,000 INFO L85 PathProgramCache]: Analyzing trace with hash -50937121, now seen corresponding path program 1 times [2023-12-21 01:44:58,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:44:58,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818856897] [2023-12-21 01:44:58,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:44:58,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:44:58,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:58,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 01:44:58,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:58,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-21 01:44:58,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:58,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:44:58,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:58,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 01:44:58,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:58,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:44:58,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:58,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:44:58,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:58,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:44:58,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:58,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:44:58,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:58,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:44:58,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:58,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:44:58,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:58,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 01:44:58,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:58,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:44:58,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:58,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:44:58,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:58,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 01:44:58,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:58,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 01:44:58,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:58,309 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-21 01:44:58,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:44:58,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818856897] [2023-12-21 01:44:58,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818856897] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:44:58,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:44:58,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 01:44:58,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150947903] [2023-12-21 01:44:58,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:44:58,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 01:44:58,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:44:58,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 01:44:58,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 01:44:58,311 INFO L87 Difference]: Start difference. First operand 215 states and 294 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-21 01:44:58,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:44:58,453 INFO L93 Difference]: Finished difference Result 509 states and 693 transitions. [2023-12-21 01:44:58,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 01:44:58,454 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 120 [2023-12-21 01:44:58,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:44:58,455 INFO L225 Difference]: With dead ends: 509 [2023-12-21 01:44:58,455 INFO L226 Difference]: Without dead ends: 314 [2023-12-21 01:44:58,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-12-21 01:44:58,456 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 202 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 01:44:58,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 657 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 01:44:58,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2023-12-21 01:44:58,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 288. [2023-12-21 01:44:58,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 239 states have (on average 1.3096234309623431) internal successors, (313), 242 states have internal predecessors, (313), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-21 01:44:58,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 393 transitions. [2023-12-21 01:44:58,475 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 393 transitions. Word has length 120 [2023-12-21 01:44:58,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:44:58,476 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 393 transitions. [2023-12-21 01:44:58,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-21 01:44:58,476 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 393 transitions. [2023-12-21 01:44:58,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-21 01:44:58,477 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:44:58,477 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:44:58,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-21 01:44:58,477 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:44:58,477 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:44:58,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1083091429, now seen corresponding path program 1 times [2023-12-21 01:44:58,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:44:58,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535874178] [2023-12-21 01:44:58,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:44:58,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:44:58,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:58,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 01:44:58,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:58,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-21 01:44:58,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:58,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:44:58,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:58,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 01:44:58,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:58,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:44:58,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:58,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:44:58,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:58,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:44:58,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:58,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:44:58,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:58,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:44:58,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:58,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:44:58,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:58,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 01:44:58,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:58,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:44:58,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:58,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:44:58,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:58,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 01:44:58,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:58,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 01:44:58,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:58,792 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-12-21 01:44:58,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:44:58,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535874178] [2023-12-21 01:44:58,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535874178] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 01:44:58,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287883984] [2023-12-21 01:44:58,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:44:58,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 01:44:58,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 01:44:58,794 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 01:44:58,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-21 01:44:58,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:58,961 INFO L262 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-21 01:44:58,969 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 01:44:59,048 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 23 treesize of output 11 [2023-12-21 01:44:59,236 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 19 treesize of output 11 [2023-12-21 01:44:59,240 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-21 01:44:59,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-21 01:44:59,273 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-21 01:44:59,288 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 219 proven. 33 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2023-12-21 01:44:59,288 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 01:44:59,460 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 31 treesize of output 19 [2023-12-21 01:44:59,581 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2023-12-21 01:44:59,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287883984] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 01:44:59,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 01:44:59,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13, 13] total 30 [2023-12-21 01:44:59,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887617315] [2023-12-21 01:44:59,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 01:44:59,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-12-21 01:44:59,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:44:59,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-12-21 01:44:59,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=732, Unknown=0, NotChecked=0, Total=870 [2023-12-21 01:44:59,583 INFO L87 Difference]: Start difference. First operand 288 states and 393 transitions. Second operand has 30 states, 25 states have (on average 4.44) internal successors, (111), 30 states have internal predecessors, (111), 12 states have call successors, (42), 4 states have call predecessors, (42), 9 states have return successors, (42), 7 states have call predecessors, (42), 12 states have call successors, (42) [2023-12-21 01:45:00,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:45:00,554 INFO L93 Difference]: Finished difference Result 428 states and 566 transitions. [2023-12-21 01:45:00,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-12-21 01:45:00,555 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 25 states have (on average 4.44) internal successors, (111), 30 states have internal predecessors, (111), 12 states have call successors, (42), 4 states have call predecessors, (42), 9 states have return successors, (42), 7 states have call predecessors, (42), 12 states have call successors, (42) Word has length 120 [2023-12-21 01:45:00,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:45:00,555 INFO L225 Difference]: With dead ends: 428 [2023-12-21 01:45:00,555 INFO L226 Difference]: Without dead ends: 160 [2023-12-21 01:45:00,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 601 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=677, Invalid=2403, Unknown=0, NotChecked=0, Total=3080 [2023-12-21 01:45:00,557 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 500 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 1151 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 1312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 1151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-21 01:45:00,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 693 Invalid, 1312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 1151 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-21 01:45:00,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2023-12-21 01:45:00,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 155. [2023-12-21 01:45:00,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 117 states have (on average 1.205128205128205) internal successors, (141), 118 states have internal predecessors, (141), 28 states have call successors, (28), 9 states have call predecessors, (28), 9 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-21 01:45:00,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 197 transitions. [2023-12-21 01:45:00,593 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 197 transitions. Word has length 120 [2023-12-21 01:45:00,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:45:00,594 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 197 transitions. [2023-12-21 01:45:00,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 25 states have (on average 4.44) internal successors, (111), 30 states have internal predecessors, (111), 12 states have call successors, (42), 4 states have call predecessors, (42), 9 states have return successors, (42), 7 states have call predecessors, (42), 12 states have call successors, (42) [2023-12-21 01:45:00,594 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 197 transitions. [2023-12-21 01:45:00,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-12-21 01:45:00,594 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:45:00,595 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:45:00,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-21 01:45:00,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-21 01:45:00,802 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:45:00,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:45:00,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1964410250, now seen corresponding path program 1 times [2023-12-21 01:45:00,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:45:00,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087991736] [2023-12-21 01:45:00,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:45:00,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:45:00,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:01,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 01:45:01,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:01,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-21 01:45:01,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:01,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:45:01,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:01,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 01:45:01,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:01,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:45:01,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:01,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:45:01,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:01,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:45:01,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:01,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:45:01,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:01,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:45:01,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:01,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:45:01,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:01,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 01:45:01,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:01,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:45:01,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:01,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:45:01,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:01,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 01:45:01,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:01,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 01:45:01,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:01,507 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-21 01:45:01,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:45:01,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087991736] [2023-12-21 01:45:01,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087991736] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:45:01,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:45:01,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-21 01:45:01,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998664183] [2023-12-21 01:45:01,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:45:01,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 01:45:01,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:45:01,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 01:45:01,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-21 01:45:01,509 INFO L87 Difference]: Start difference. First operand 155 states and 197 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-21 01:45:01,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:45:01,792 INFO L93 Difference]: Finished difference Result 172 states and 214 transitions. [2023-12-21 01:45:01,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 01:45:01,793 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 122 [2023-12-21 01:45:01,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:45:01,794 INFO L225 Difference]: With dead ends: 172 [2023-12-21 01:45:01,794 INFO L226 Difference]: Without dead ends: 170 [2023-12-21 01:45:01,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2023-12-21 01:45:01,794 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 178 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 01:45:01,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 612 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 01:45:01,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2023-12-21 01:45:01,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 157. [2023-12-21 01:45:01,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 119 states have (on average 1.2016806722689075) internal successors, (143), 120 states have internal predecessors, (143), 28 states have call successors, (28), 9 states have call predecessors, (28), 9 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-21 01:45:01,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 199 transitions. [2023-12-21 01:45:01,809 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 199 transitions. Word has length 122 [2023-12-21 01:45:01,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:45:01,809 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 199 transitions. [2023-12-21 01:45:01,809 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-21 01:45:01,810 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 199 transitions. [2023-12-21 01:45:01,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-12-21 01:45:01,810 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:45:01,810 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:45:01,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-21 01:45:01,810 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:45:01,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:45:01,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1964469832, now seen corresponding path program 1 times [2023-12-21 01:45:01,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:45:01,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196123848] [2023-12-21 01:45:01,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:45:01,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:45:01,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:01,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 01:45:01,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:01,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-21 01:45:01,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:01,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:45:01,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:01,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 01:45:01,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:01,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:45:01,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:01,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:45:01,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:01,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:45:01,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:01,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:45:01,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:01,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:45:01,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:01,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:45:01,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:01,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 01:45:01,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:01,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:45:01,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:01,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:45:01,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:01,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 01:45:01,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:01,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 01:45:01,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:01,945 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-21 01:45:01,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:45:01,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196123848] [2023-12-21 01:45:01,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196123848] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:45:01,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:45:01,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 01:45:01,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388386437] [2023-12-21 01:45:01,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:45:01,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 01:45:01,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:45:01,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 01:45:01,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 01:45:01,946 INFO L87 Difference]: Start difference. First operand 157 states and 199 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-21 01:45:01,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:45:01,998 INFO L93 Difference]: Finished difference Result 283 states and 354 transitions. [2023-12-21 01:45:01,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 01:45:01,998 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2023-12-21 01:45:01,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:45:01,999 INFO L225 Difference]: With dead ends: 283 [2023-12-21 01:45:01,999 INFO L226 Difference]: Without dead ends: 170 [2023-12-21 01:45:01,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 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-21 01:45:02,000 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 103 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:45:02,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 540 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:45:02,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2023-12-21 01:45:02,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 157. [2023-12-21 01:45:02,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 119 states have (on average 1.1932773109243697) internal successors, (142), 120 states have internal predecessors, (142), 28 states have call successors, (28), 9 states have call predecessors, (28), 9 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-21 01:45:02,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 198 transitions. [2023-12-21 01:45:02,015 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 198 transitions. Word has length 122 [2023-12-21 01:45:02,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:45:02,015 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 198 transitions. [2023-12-21 01:45:02,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-21 01:45:02,015 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 198 transitions. [2023-12-21 01:45:02,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-12-21 01:45:02,016 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:45:02,016 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:45:02,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-21 01:45:02,016 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:45:02,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:45:02,016 INFO L85 PathProgramCache]: Analyzing trace with hash 2021728134, now seen corresponding path program 1 times [2023-12-21 01:45:02,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:45:02,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490931334] [2023-12-21 01:45:02,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:45:02,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:45:02,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:02,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 01:45:02,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:02,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-21 01:45:02,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:02,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:45:02,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:02,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 01:45:02,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:02,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:45:02,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:02,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:45:02,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:02,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:45:02,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:02,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:45:02,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:02,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:45:02,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:02,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:45:02,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:02,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 01:45:02,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:02,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:45:02,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:02,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:45:02,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:02,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 01:45:02,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:02,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 01:45:02,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:02,325 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-21 01:45:02,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:45:02,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490931334] [2023-12-21 01:45:02,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490931334] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:45:02,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:45:02,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 01:45:02,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919530962] [2023-12-21 01:45:02,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:45:02,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 01:45:02,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:45:02,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 01:45:02,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 01:45:02,326 INFO L87 Difference]: Start difference. First operand 157 states and 198 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-21 01:45:02,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:45:02,417 INFO L93 Difference]: Finished difference Result 274 states and 342 transitions. [2023-12-21 01:45:02,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 01:45:02,417 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2023-12-21 01:45:02,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:45:02,418 INFO L225 Difference]: With dead ends: 274 [2023-12-21 01:45:02,418 INFO L226 Difference]: Without dead ends: 161 [2023-12-21 01:45:02,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 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-21 01:45:02,419 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 70 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 01:45:02,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 354 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 01:45:02,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2023-12-21 01:45:02,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2023-12-21 01:45:02,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 122 states have (on average 1.180327868852459) internal successors, (144), 123 states have internal predecessors, (144), 28 states have call successors, (28), 10 states have call predecessors, (28), 10 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-21 01:45:02,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 200 transitions. [2023-12-21 01:45:02,435 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 200 transitions. Word has length 122 [2023-12-21 01:45:02,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:45:02,435 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 200 transitions. [2023-12-21 01:45:02,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-21 01:45:02,436 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 200 transitions. [2023-12-21 01:45:02,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-12-21 01:45:02,437 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:45:02,437 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:45:02,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-21 01:45:02,437 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:45:02,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:45:02,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1212381508, now seen corresponding path program 1 times [2023-12-21 01:45:02,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:45:02,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246862740] [2023-12-21 01:45:02,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:45:02,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:45:02,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:03,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 01:45:03,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:03,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-21 01:45:03,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:03,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:45:03,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:03,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 01:45:03,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:03,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:45:03,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:03,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:45:03,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:03,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:45:03,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:03,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:45:03,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:03,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:45:03,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:03,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:45:03,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:03,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 01:45:03,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:03,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:45:03,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:03,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:45:03,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:03,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 01:45:03,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:03,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 01:45:03,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:03,204 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-21 01:45:03,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:45:03,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246862740] [2023-12-21 01:45:03,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246862740] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:45:03,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:45:03,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-21 01:45:03,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963279807] [2023-12-21 01:45:03,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:45:03,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 01:45:03,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:45:03,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 01:45:03,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-21 01:45:03,207 INFO L87 Difference]: Start difference. First operand 161 states and 200 transitions. Second operand has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-21 01:45:03,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:45:03,423 INFO L93 Difference]: Finished difference Result 340 states and 419 transitions. [2023-12-21 01:45:03,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 01:45:03,423 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 122 [2023-12-21 01:45:03,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:45:03,425 INFO L225 Difference]: With dead ends: 340 [2023-12-21 01:45:03,425 INFO L226 Difference]: Without dead ends: 223 [2023-12-21 01:45:03,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-12-21 01:45:03,426 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 108 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 01:45:03,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 782 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 01:45:03,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2023-12-21 01:45:03,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 174. [2023-12-21 01:45:03,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 135 states have (on average 1.1777777777777778) internal successors, (159), 136 states have internal predecessors, (159), 28 states have call successors, (28), 10 states have call predecessors, (28), 10 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-21 01:45:03,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 215 transitions. [2023-12-21 01:45:03,445 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 215 transitions. Word has length 122 [2023-12-21 01:45:03,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:45:03,445 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 215 transitions. [2023-12-21 01:45:03,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-21 01:45:03,445 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 215 transitions. [2023-12-21 01:45:03,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-21 01:45:03,446 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:45:03,446 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:45:03,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-21 01:45:03,446 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:45:03,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:45:03,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1861416925, now seen corresponding path program 1 times [2023-12-21 01:45:03,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:45:03,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603921447] [2023-12-21 01:45:03,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:45:03,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:45:03,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:03,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 01:45:03,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:03,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-21 01:45:03,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:03,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:45:03,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:03,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 01:45:03,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:03,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:45:03,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:03,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:45:03,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:03,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:45:03,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:03,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:45:03,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:03,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:45:03,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:03,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:45:03,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:03,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 01:45:03,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:03,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:45:03,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:03,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:45:03,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:03,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 01:45:03,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:03,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 01:45:03,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:03,692 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-21 01:45:03,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:45:03,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603921447] [2023-12-21 01:45:03,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603921447] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:45:03,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:45:03,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 01:45:03,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204975] [2023-12-21 01:45:03,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:45:03,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 01:45:03,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:45:03,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 01:45:03,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-21 01:45:03,694 INFO L87 Difference]: Start difference. First operand 174 states and 215 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-21 01:45:03,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:45:03,784 INFO L93 Difference]: Finished difference Result 304 states and 373 transitions. [2023-12-21 01:45:03,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 01:45:03,785 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2023-12-21 01:45:03,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:45:03,786 INFO L225 Difference]: With dead ends: 304 [2023-12-21 01:45:03,786 INFO L226 Difference]: Without dead ends: 174 [2023-12-21 01:45:03,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-21 01:45:03,788 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 76 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 01:45:03,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 276 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 01:45:03,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-12-21 01:45:03,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2023-12-21 01:45:03,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 135 states have (on average 1.1703703703703703) internal successors, (158), 136 states have internal predecessors, (158), 28 states have call successors, (28), 10 states have call predecessors, (28), 10 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-21 01:45:03,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 214 transitions. [2023-12-21 01:45:03,806 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 214 transitions. Word has length 124 [2023-12-21 01:45:03,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:45:03,806 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 214 transitions. [2023-12-21 01:45:03,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-21 01:45:03,806 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 214 transitions. [2023-12-21 01:45:03,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-21 01:45:03,807 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:45:03,807 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:45:03,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-21 01:45:03,807 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:45:03,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:45:03,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1642562207, now seen corresponding path program 1 times [2023-12-21 01:45:03,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:45:03,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893379974] [2023-12-21 01:45:03,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:45:03,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:45:03,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:04,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 01:45:04,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:04,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-21 01:45:04,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:04,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:45:04,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:04,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 01:45:04,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:04,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:45:04,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:04,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:45:04,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:04,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:45:04,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:04,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:45:04,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:04,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:45:04,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:04,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:45:04,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:04,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 01:45:04,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:04,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:45:04,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:04,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:45:04,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:04,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 01:45:04,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:04,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 01:45:04,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:04,616 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 36 proven. 42 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2023-12-21 01:45:04,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:45:04,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893379974] [2023-12-21 01:45:04,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893379974] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 01:45:04,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70442565] [2023-12-21 01:45:04,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:45:04,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 01:45:04,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 01:45:04,618 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 01:45:04,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-21 01:45:05,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:05,449 INFO L262 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 73 conjunts are in the unsatisfiable core [2023-12-21 01:45:05,454 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 01:45:05,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-12-21 01:45:05,569 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 01:45:05,569 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 30 treesize of output 21 [2023-12-21 01:45:05,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2023-12-21 01:45:06,120 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 01:45:06,120 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 37 treesize of output 24 [2023-12-21 01:45:07,466 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 73 treesize of output 59 [2023-12-21 01:45:07,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 69 [2023-12-21 01:45:07,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 [2023-12-21 01:45:07,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 15 treesize of output 11 [2023-12-21 01:45:10,529 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 01:45:10,530 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 3 case distinctions, treesize of input 48 treesize of output 45 [2023-12-21 01:45:10,788 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 13 treesize of output 9 [2023-12-21 01:45:10,792 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 11 treesize of output 7 [2023-12-21 01:45:10,857 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 27 treesize of output 22 [2023-12-21 01:45:10,939 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 01:45:10,939 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 32 treesize of output 12 [2023-12-21 01:45:11,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-21 01:45:11,080 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 01:45:11,080 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 40 treesize of output 16 [2023-12-21 01:45:12,935 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 131 proven. 222 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2023-12-21 01:45:12,935 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 01:45:13,360 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 35 treesize of output 27 [2023-12-21 01:45:13,744 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 31 treesize of output 23 [2023-12-21 01:45:14,284 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 57 proven. 93 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2023-12-21 01:45:14,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70442565] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 01:45:14,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 01:45:14,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 26, 23] total 63 [2023-12-21 01:45:14,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448167460] [2023-12-21 01:45:14,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 01:45:14,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2023-12-21 01:45:14,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:45:14,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2023-12-21 01:45:14,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=636, Invalid=3270, Unknown=0, NotChecked=0, Total=3906 [2023-12-21 01:45:14,288 INFO L87 Difference]: Start difference. First operand 174 states and 214 transitions. Second operand has 63 states, 51 states have (on average 2.7254901960784315) internal successors, (139), 57 states have internal predecessors, (139), 21 states have call successors, (42), 7 states have call predecessors, (42), 13 states have return successors, (42), 14 states have call predecessors, (42), 21 states have call successors, (42) [2023-12-21 01:45:31,579 WARN L293 SmtUtils]: Spent 5.30s on a formula simplification. DAG size of input: 49 DAG size of output: 36 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 01:45:40,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 01:45:42,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:45:42,543 INFO L93 Difference]: Finished difference Result 360 states and 428 transitions. [2023-12-21 01:45:42,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2023-12-21 01:45:42,543 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 51 states have (on average 2.7254901960784315) internal successors, (139), 57 states have internal predecessors, (139), 21 states have call successors, (42), 7 states have call predecessors, (42), 13 states have return successors, (42), 14 states have call predecessors, (42), 21 states have call successors, (42) Word has length 124 [2023-12-21 01:45:42,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:45:42,544 INFO L225 Difference]: With dead ends: 360 [2023-12-21 01:45:42,544 INFO L226 Difference]: Without dead ends: 230 [2023-12-21 01:45:42,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3786 ImplicationChecksByTransitivity, 24.8s TimeCoverageRelationStatistics Valid=2197, Invalid=10234, Unknown=1, NotChecked=0, Total=12432 [2023-12-21 01:45:42,548 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 1281 mSDsluCounter, 978 mSDsCounter, 0 mSdLazyCounter, 1755 mSolverCounterSat, 420 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1286 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 2176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 420 IncrementalHoareTripleChecker+Valid, 1755 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2023-12-21 01:45:42,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1286 Valid, 1041 Invalid, 2176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [420 Valid, 1755 Invalid, 1 Unknown, 0 Unchecked, 10.3s Time] [2023-12-21 01:45:42,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2023-12-21 01:45:42,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 178. [2023-12-21 01:45:42,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 140 states have (on average 1.1571428571428573) internal successors, (162), 141 states have internal predecessors, (162), 24 states have call successors, (24), 13 states have call predecessors, (24), 13 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-21 01:45:42,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 210 transitions. [2023-12-21 01:45:42,569 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 210 transitions. Word has length 124 [2023-12-21 01:45:42,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:45:42,569 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 210 transitions. [2023-12-21 01:45:42,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 51 states have (on average 2.7254901960784315) internal successors, (139), 57 states have internal predecessors, (139), 21 states have call successors, (42), 7 states have call predecessors, (42), 13 states have return successors, (42), 14 states have call predecessors, (42), 21 states have call successors, (42) [2023-12-21 01:45:42,570 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 210 transitions. [2023-12-21 01:45:42,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-21 01:45:42,570 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:45:42,570 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:45:42,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-21 01:45:42,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 01:45:42,771 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:45:42,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:45:42,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1687732812, now seen corresponding path program 1 times [2023-12-21 01:45:42,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:45:42,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957539889] [2023-12-21 01:45:42,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:45:42,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:45:42,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:42,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 01:45:42,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:42,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-21 01:45:42,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:42,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:45:42,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:42,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 01:45:42,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:42,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:45:42,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:42,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:45:42,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:42,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:45:42,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:42,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:45:42,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:42,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:45:42,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:42,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:45:42,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:42,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 01:45:42,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:42,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:45:42,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:42,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:45:42,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:42,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 01:45:42,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:42,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 01:45:42,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:45:42,920 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-21 01:45:42,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:45:42,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957539889] [2023-12-21 01:45:42,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957539889] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:45:42,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:45:42,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 01:45:42,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061154905] [2023-12-21 01:45:42,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:45:42,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 01:45:42,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:45:42,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 01:45:42,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 01:45:42,923 INFO L87 Difference]: Start difference. First operand 178 states and 210 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-21 01:45:42,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:45:42,982 INFO L93 Difference]: Finished difference Result 325 states and 382 transitions. [2023-12-21 01:45:42,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 01:45:42,982 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2023-12-21 01:45:42,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:45:42,983 INFO L225 Difference]: With dead ends: 325 [2023-12-21 01:45:42,983 INFO L226 Difference]: Without dead ends: 187 [2023-12-21 01:45:42,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-21 01:45:42,984 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 39 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:45:42,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 550 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:45:42,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2023-12-21 01:45:43,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 179. [2023-12-21 01:45:43,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 141 states have (on average 1.1560283687943262) internal successors, (163), 142 states have internal predecessors, (163), 24 states have call successors, (24), 13 states have call predecessors, (24), 13 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-21 01:45:43,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 211 transitions. [2023-12-21 01:45:43,008 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 211 transitions. Word has length 126 [2023-12-21 01:45:43,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:45:43,008 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 211 transitions. [2023-12-21 01:45:43,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-21 01:45:43,008 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 211 transitions. [2023-12-21 01:45:43,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-21 01:45:43,009 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:45:43,009 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:45:43,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-21 01:45:43,010 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:45:43,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:45:43,010 INFO L85 PathProgramCache]: Analyzing trace with hash 816910736, now seen corresponding path program 1 times [2023-12-21 01:45:43,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:45:43,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337252173] [2023-12-21 01:45:43,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:45:43,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:45:43,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 01:45:43,085 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-21 01:45:43,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 01:45:43,189 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-21 01:45:43,190 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-21 01:45:43,190 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 01:45:43,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-21 01:45:43,195 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:45:43,198 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 01:45:43,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 01:45:43 BoogieIcfgContainer [2023-12-21 01:45:43,289 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 01:45:43,290 INFO L158 Benchmark]: Toolchain (without parser) took 51799.49ms. Allocated memory was 306.2MB in the beginning and 742.4MB in the end (delta: 436.2MB). Free memory was 259.6MB in the beginning and 683.0MB in the end (delta: -423.4MB). Peak memory consumption was 439.8MB. Max. memory is 8.0GB. [2023-12-21 01:45:43,290 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 227.5MB. Free memory is still 176.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 01:45:43,290 INFO L158 Benchmark]: CACSL2BoogieTranslator took 281.62ms. Allocated memory is still 306.2MB. Free memory was 259.3MB in the beginning and 244.8MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-21 01:45:43,290 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.98ms. Allocated memory is still 306.2MB. Free memory was 244.8MB in the beginning and 241.2MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-21 01:45:43,290 INFO L158 Benchmark]: Boogie Preprocessor took 78.68ms. Allocated memory is still 306.2MB. Free memory was 240.9MB in the beginning and 236.3MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-21 01:45:43,290 INFO L158 Benchmark]: RCFGBuilder took 582.09ms. Allocated memory is still 306.2MB. Free memory was 236.0MB in the beginning and 252.9MB in the end (delta: -16.9MB). Peak memory consumption was 23.8MB. Max. memory is 8.0GB. [2023-12-21 01:45:43,290 INFO L158 Benchmark]: TraceAbstraction took 50777.88ms. Allocated memory was 306.2MB in the beginning and 742.4MB in the end (delta: 436.2MB). Free memory was 251.8MB in the beginning and 683.0MB in the end (delta: -431.2MB). Peak memory consumption was 430.7MB. Max. memory is 8.0GB. [2023-12-21 01:45:43,295 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 227.5MB. Free memory is still 176.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 281.62ms. Allocated memory is still 306.2MB. Free memory was 259.3MB in the beginning and 244.8MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 74.98ms. Allocated memory is still 306.2MB. Free memory was 244.8MB in the beginning and 241.2MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 78.68ms. Allocated memory is still 306.2MB. Free memory was 240.9MB in the beginning and 236.3MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 582.09ms. Allocated memory is still 306.2MB. Free memory was 236.0MB in the beginning and 252.9MB in the end (delta: -16.9MB). Peak memory consumption was 23.8MB. Max. memory is 8.0GB. * TraceAbstraction took 50777.88ms. Allocated memory was 306.2MB in the beginning and 742.4MB in the end (delta: 436.2MB). Free memory was 251.8MB in the beginning and 683.0MB in the end (delta: -431.2MB). Peak memory consumption was 430.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 97, overapproximation of bitwise operation at line 97. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] float float_Array_0[1] = { 25.1 }; [L22-L24] float float_Array_0[1] = { 25.1 }; [L25-L27] signed char signed_char_Array_0[5] = { 25, 16, -10, -25, 0 }; [L25-L27] signed char signed_char_Array_0[5] = { 25, 16, -10, -25, 0 }; [L25-L27] signed char signed_char_Array_0[5] = { 25, 16, -10, -25, 0 }; [L25-L27] signed char signed_char_Array_0[5] = { 25, 16, -10, -25, 0 }; [L25-L27] signed char signed_char_Array_0[5] = { 25, 16, -10, -25, 0 }; [L25-L27] signed char signed_char_Array_0[5] = { 25, 16, -10, -25, 0 }; [L28-L30] signed long int signed_long_int_Array_0[2] = { -128, 256 }; [L28-L30] signed long int signed_long_int_Array_0[2] = { -128, 256 }; [L28-L30] signed long int signed_long_int_Array_0[2] = { -128, 256 }; [L31-L33] signed short int signed_short_int_Array_0[1] = { -16 }; [L31-L33] signed short int signed_short_int_Array_0[1] = { -16 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 16, 8 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 16, 8 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 16, 8 }; [L37-L39] unsigned long int unsigned_long_int_Array_0[1] = { 2531521428 }; [L37-L39] unsigned long int unsigned_long_int_Array_0[1] = { 2531521428 }; [L40-L42] unsigned short int unsigned_short_int_Array_0[2] = { 100, 59049 }; [L40-L42] unsigned short int unsigned_short_int_Array_0[2] = { 100, 59049 }; [L40-L42] unsigned short int unsigned_short_int_Array_0[2] = { 100, 59049 }; [L101] isInitial = 1 [L102] FCALL initially() [L103] COND TRUE 1 [L104] FCALL updateLastVariables() [L105] CALL updateVariables() [L70] float_Array_0[0] = __VERIFIER_nondet_float() [L71] EXPR float_Array_0[0] [L71] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L71] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F [L71] EXPR float_Array_0[0] [L71] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L71] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L71] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L71] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L71] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L72] signed_char_Array_0[0] = __VERIFIER_nondet_char() [L73] EXPR signed_char_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L73] CALL assume_abort_if_not(signed_char_Array_0[0] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L73] RET assume_abort_if_not(signed_char_Array_0[0] >= 0) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L74] EXPR signed_char_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L74] CALL assume_abort_if_not(signed_char_Array_0[0] <= 31) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L74] RET assume_abort_if_not(signed_char_Array_0[0] <= 31) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L75] signed_char_Array_0[1] = __VERIFIER_nondet_char() [L76] EXPR signed_char_Array_0[1] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L76] CALL assume_abort_if_not(signed_char_Array_0[1] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L76] RET assume_abort_if_not(signed_char_Array_0[1] >= 0) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L77] EXPR signed_char_Array_0[1] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L77] CALL assume_abort_if_not(signed_char_Array_0[1] <= 63) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L77] RET assume_abort_if_not(signed_char_Array_0[1] <= 63) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L78] signed_char_Array_0[2] = __VERIFIER_nondet_char() [L79] EXPR signed_char_Array_0[2] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L79] CALL assume_abort_if_not(signed_char_Array_0[2] >= -63) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L79] RET assume_abort_if_not(signed_char_Array_0[2] >= -63) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L80] EXPR signed_char_Array_0[2] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L80] CALL assume_abort_if_not(signed_char_Array_0[2] <= 63) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L80] RET assume_abort_if_not(signed_char_Array_0[2] <= 63) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L81] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L82] EXPR unsigned_char_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L82] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L82] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L83] EXPR unsigned_char_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L83] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L83] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L84] unsigned_long_int_Array_0[0] = __VERIFIER_nondet_ulong() [L85] EXPR unsigned_long_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L85] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] >= 2147483647) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L85] RET assume_abort_if_not(unsigned_long_int_Array_0[0] >= 2147483647) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L86] EXPR unsigned_long_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L86] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] <= 4294967295) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L86] RET assume_abort_if_not(unsigned_long_int_Array_0[0] <= 4294967295) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L87] unsigned_short_int_Array_0[0] = __VERIFIER_nondet_ushort() [L88] EXPR unsigned_short_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L88] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L88] RET assume_abort_if_not(unsigned_short_int_Array_0[0] >= 0) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L89] EXPR unsigned_short_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L89] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] <= 32767) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L89] RET assume_abort_if_not(unsigned_short_int_Array_0[0] <= 32767) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L90] unsigned_short_int_Array_0[1] = __VERIFIER_nondet_ushort() [L91] EXPR unsigned_short_int_Array_0[1] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L91] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] >= 32767) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L91] RET assume_abort_if_not(unsigned_short_int_Array_0[1] >= 32767) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L92] EXPR unsigned_short_int_Array_0[1] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L92] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] <= 65535) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L92] RET assume_abort_if_not(unsigned_short_int_Array_0[1] <= 65535) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L105] RET updateVariables() [L106] CALL step() [L46] EXPR signed_char_Array_0[1] [L46] signed_long_int_Array_0[0] = signed_char_Array_0[1] [L47] EXPR signed_long_int_Array_0[0] [L47] signed_short_int_Array_0[0] = signed_long_int_Array_0[0] [L48] EXPR signed_long_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L48] EXPR ((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]) [L48] EXPR signed_long_int_Array_0[0] [L48] EXPR ((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L48] signed long int stepLocal_0 = (((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0])); [L49] EXPR unsigned_short_int_Array_0[1] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L49] COND FALSE !(unsigned_short_int_Array_0[1] <= stepLocal_0) [L52] EXPR signed_char_Array_0[2] [L52] signed_char_Array_0[3] = signed_char_Array_0[2] [L54] EXPR signed_short_int_Array_0[0] [L54] signed_long_int_Array_0[1] = signed_short_int_Array_0[0] [L55] EXPR unsigned_short_int_Array_0[1] [L55] EXPR unsigned_short_int_Array_0[0] [L55] EXPR signed_long_int_Array_0[1] [L55] EXPR signed_short_int_Array_0[0] [L55] EXPR (unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) ^ (signed_long_int_Array_0[1] * signed_short_int_Array_0[0]) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, stepLocal_0=1, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L55] COND TRUE ((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) ^ (signed_long_int_Array_0[1] * signed_short_int_Array_0[0])) <= -64 [L56] EXPR unsigned_char_Array_0[0] [L56] unsigned_char_Array_0[1] = unsigned_char_Array_0[0] [L60] EXPR unsigned_char_Array_0[1] [L60] unsigned char stepLocal_1 = unsigned_char_Array_0[1]; [L61] EXPR float_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L61] COND FALSE !(2.75f > float_Array_0[0]) [L64] EXPR unsigned_long_int_Array_0[0] [L64] EXPR signed_long_int_Array_0[0] [L64] EXPR signed_char_Array_0[1] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L64] EXPR ((signed_long_int_Array_0[0]) > (signed_char_Array_0[1])) ? (signed_long_int_Array_0[0]) : (signed_char_Array_0[1]) [L64] EXPR signed_char_Array_0[1] [L64] EXPR ((signed_long_int_Array_0[0]) > (signed_char_Array_0[1])) ? (signed_long_int_Array_0[0]) : (signed_char_Array_0[1]) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, stepLocal_0=1, stepLocal_1=254, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L64] COND TRUE (unsigned_long_int_Array_0[0] - ((((signed_long_int_Array_0[0]) > (signed_char_Array_0[1])) ? (signed_long_int_Array_0[0]) : (signed_char_Array_0[1])))) > stepLocal_1 [L65] EXPR signed_char_Array_0[1] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L65] EXPR ((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5)) [L65] EXPR signed_char_Array_0[1] [L65] EXPR ((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5)) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, stepLocal_0=1, stepLocal_1=254, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L65] EXPR signed_char_Array_0[2] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L65] EXPR ((((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) < (signed_char_Array_0[2])) ? (((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) : (signed_char_Array_0[2]) [L65] EXPR signed_char_Array_0[2] [L65] EXPR ((((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) < (signed_char_Array_0[2])) ? (((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) : (signed_char_Array_0[2]) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, stepLocal_0=1, stepLocal_1=254, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L65] signed_char_Array_0[4] = ((((((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) < (signed_char_Array_0[2])) ? (((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) : (signed_char_Array_0[2]))) [L106] RET step() [L107] CALL, EXPR property() [L97] EXPR unsigned_short_int_Array_0[1] [L97] EXPR unsigned_short_int_Array_0[0] [L97] EXPR signed_long_int_Array_0[1] [L97] EXPR signed_short_int_Array_0[0] [L97] EXPR (unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) ^ (signed_long_int_Array_0[1] * signed_short_int_Array_0[0]) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] EXPR (((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) ^ (signed_long_int_Array_0[1] * signed_short_int_Array_0[0])) <= -64) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) [L97] EXPR unsigned_char_Array_0[1] [L97] EXPR unsigned_char_Array_0[0] [L97] EXPR (((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) ^ (signed_long_int_Array_0[1] * signed_short_int_Array_0[0])) <= -64) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] EXPR ((((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) ^ (signed_long_int_Array_0[1] * signed_short_int_Array_0[0])) <= -64) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) && ((unsigned_short_int_Array_0[1] <= ((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (signed_char_Array_0[3] == ((signed char) ((signed_char_Array_0[1] - (1 + signed_char_Array_0[0])) + signed_char_Array_0[2]))) : (signed_char_Array_0[3] == ((signed char) signed_char_Array_0[2]))) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] EXPR ((((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) ^ (signed_long_int_Array_0[1] * signed_short_int_Array_0[0])) <= -64) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) && ((unsigned_short_int_Array_0[1] <= ((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (signed_char_Array_0[3] == ((signed char) ((signed_char_Array_0[1] - (1 + signed_char_Array_0[0])) + signed_char_Array_0[2]))) : (signed_char_Array_0[3] == ((signed char) signed_char_Array_0[2]))) [L97] EXPR unsigned_short_int_Array_0[1] [L97] EXPR signed_long_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] EXPR ((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]) [L97] EXPR signed_long_int_Array_0[0] [L97] EXPR ((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] EXPR (unsigned_short_int_Array_0[1] <= ((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (signed_char_Array_0[3] == ((signed char) ((signed_char_Array_0[1] - (1 + signed_char_Array_0[0])) + signed_char_Array_0[2]))) : (signed_char_Array_0[3] == ((signed char) signed_char_Array_0[2])) [L97] EXPR signed_char_Array_0[3] [L97] EXPR signed_char_Array_0[2] [L97] EXPR (unsigned_short_int_Array_0[1] <= ((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (signed_char_Array_0[3] == ((signed char) ((signed_char_Array_0[1] - (1 + signed_char_Array_0[0])) + signed_char_Array_0[2]))) : (signed_char_Array_0[3] == ((signed char) signed_char_Array_0[2])) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] EXPR ((((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) ^ (signed_long_int_Array_0[1] * signed_short_int_Array_0[0])) <= -64) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) && ((unsigned_short_int_Array_0[1] <= ((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (signed_char_Array_0[3] == ((signed char) ((signed_char_Array_0[1] - (1 + signed_char_Array_0[0])) + signed_char_Array_0[2]))) : (signed_char_Array_0[3] == ((signed char) signed_char_Array_0[2]))) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] EXPR (((((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) ^ (signed_long_int_Array_0[1] * signed_short_int_Array_0[0])) <= -64) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) && ((unsigned_short_int_Array_0[1] <= ((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (signed_char_Array_0[3] == ((signed char) ((signed_char_Array_0[1] - (1 + signed_char_Array_0[0])) + signed_char_Array_0[2]))) : (signed_char_Array_0[3] == ((signed char) signed_char_Array_0[2])))) && ((2.75f > float_Array_0[0]) ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[2] + signed_char_Array_0[1]))) : (((unsigned_long_int_Array_0[0] - ((((signed_long_int_Array_0[0]) > (signed_char_Array_0[1])) ? (signed_long_int_Array_0[0]) : (signed_char_Array_0[1])))) > unsigned_char_Array_0[1]) ? (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) < (signed_char_Array_0[2])) ? (((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) : (signed_char_Array_0[2]))))) : 1)) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] EXPR (((((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) ^ (signed_long_int_Array_0[1] * signed_short_int_Array_0[0])) <= -64) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) && ((unsigned_short_int_Array_0[1] <= ((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (signed_char_Array_0[3] == ((signed char) ((signed_char_Array_0[1] - (1 + signed_char_Array_0[0])) + signed_char_Array_0[2]))) : (signed_char_Array_0[3] == ((signed char) signed_char_Array_0[2])))) && ((2.75f > float_Array_0[0]) ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[2] + signed_char_Array_0[1]))) : (((unsigned_long_int_Array_0[0] - ((((signed_long_int_Array_0[0]) > (signed_char_Array_0[1])) ? (signed_long_int_Array_0[0]) : (signed_char_Array_0[1])))) > unsigned_char_Array_0[1]) ? (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) < (signed_char_Array_0[2])) ? (((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) : (signed_char_Array_0[2]))))) : 1)) [L97] EXPR float_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] EXPR (2.75f > float_Array_0[0]) ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[2] + signed_char_Array_0[1]))) : (((unsigned_long_int_Array_0[0] - ((((signed_long_int_Array_0[0]) > (signed_char_Array_0[1])) ? (signed_long_int_Array_0[0]) : (signed_char_Array_0[1])))) > unsigned_char_Array_0[1]) ? (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) < (signed_char_Array_0[2])) ? (((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) : (signed_char_Array_0[2]))))) : 1) [L97] EXPR signed_char_Array_0[4] [L97] EXPR signed_char_Array_0[2] [L97] EXPR signed_char_Array_0[1] [L97] EXPR (2.75f > float_Array_0[0]) ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[2] + signed_char_Array_0[1]))) : (((unsigned_long_int_Array_0[0] - ((((signed_long_int_Array_0[0]) > (signed_char_Array_0[1])) ? (signed_long_int_Array_0[0]) : (signed_char_Array_0[1])))) > unsigned_char_Array_0[1]) ? (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) < (signed_char_Array_0[2])) ? (((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) : (signed_char_Array_0[2]))))) : 1) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] EXPR (((((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) ^ (signed_long_int_Array_0[1] * signed_short_int_Array_0[0])) <= -64) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) && ((unsigned_short_int_Array_0[1] <= ((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (signed_char_Array_0[3] == ((signed char) ((signed_char_Array_0[1] - (1 + signed_char_Array_0[0])) + signed_char_Array_0[2]))) : (signed_char_Array_0[3] == ((signed char) signed_char_Array_0[2])))) && ((2.75f > float_Array_0[0]) ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[2] + signed_char_Array_0[1]))) : (((unsigned_long_int_Array_0[0] - ((((signed_long_int_Array_0[0]) > (signed_char_Array_0[1])) ? (signed_long_int_Array_0[0]) : (signed_char_Array_0[1])))) > unsigned_char_Array_0[1]) ? (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) < (signed_char_Array_0[2])) ? (((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) : (signed_char_Array_0[2]))))) : 1)) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] EXPR ((((((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) ^ (signed_long_int_Array_0[1] * signed_short_int_Array_0[0])) <= -64) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) && ((unsigned_short_int_Array_0[1] <= ((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (signed_char_Array_0[3] == ((signed char) ((signed_char_Array_0[1] - (1 + signed_char_Array_0[0])) + signed_char_Array_0[2]))) : (signed_char_Array_0[3] == ((signed char) signed_char_Array_0[2])))) && ((2.75f > float_Array_0[0]) ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[2] + signed_char_Array_0[1]))) : (((unsigned_long_int_Array_0[0] - ((((signed_long_int_Array_0[0]) > (signed_char_Array_0[1])) ? (signed_long_int_Array_0[0]) : (signed_char_Array_0[1])))) > unsigned_char_Array_0[1]) ? (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) < (signed_char_Array_0[2])) ? (((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) : (signed_char_Array_0[2]))))) : 1))) && (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] EXPR ((((((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) ^ (signed_long_int_Array_0[1] * signed_short_int_Array_0[0])) <= -64) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) && ((unsigned_short_int_Array_0[1] <= ((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (signed_char_Array_0[3] == ((signed char) ((signed_char_Array_0[1] - (1 + signed_char_Array_0[0])) + signed_char_Array_0[2]))) : (signed_char_Array_0[3] == ((signed char) signed_char_Array_0[2])))) && ((2.75f > float_Array_0[0]) ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[2] + signed_char_Array_0[1]))) : (((unsigned_long_int_Array_0[0] - ((((signed_long_int_Array_0[0]) > (signed_char_Array_0[1])) ? (signed_long_int_Array_0[0]) : (signed_char_Array_0[1])))) > unsigned_char_Array_0[1]) ? (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) < (signed_char_Array_0[2])) ? (((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) : (signed_char_Array_0[2]))))) : 1))) && (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] EXPR (((((((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) ^ (signed_long_int_Array_0[1] * signed_short_int_Array_0[0])) <= -64) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) && ((unsigned_short_int_Array_0[1] <= ((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (signed_char_Array_0[3] == ((signed char) ((signed_char_Array_0[1] - (1 + signed_char_Array_0[0])) + signed_char_Array_0[2]))) : (signed_char_Array_0[3] == ((signed char) signed_char_Array_0[2])))) && ((2.75f > float_Array_0[0]) ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[2] + signed_char_Array_0[1]))) : (((unsigned_long_int_Array_0[0] - ((((signed_long_int_Array_0[0]) > (signed_char_Array_0[1])) ? (signed_long_int_Array_0[0]) : (signed_char_Array_0[1])))) > unsigned_char_Array_0[1]) ? (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) < (signed_char_Array_0[2])) ? (((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) : (signed_char_Array_0[2]))))) : 1))) && (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1]))) && (signed_long_int_Array_0[1] == ((signed long int) signed_short_int_Array_0[0])) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] EXPR (((((((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) ^ (signed_long_int_Array_0[1] * signed_short_int_Array_0[0])) <= -64) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) && ((unsigned_short_int_Array_0[1] <= ((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (signed_char_Array_0[3] == ((signed char) ((signed_char_Array_0[1] - (1 + signed_char_Array_0[0])) + signed_char_Array_0[2]))) : (signed_char_Array_0[3] == ((signed char) signed_char_Array_0[2])))) && ((2.75f > float_Array_0[0]) ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[2] + signed_char_Array_0[1]))) : (((unsigned_long_int_Array_0[0] - ((((signed_long_int_Array_0[0]) > (signed_char_Array_0[1])) ? (signed_long_int_Array_0[0]) : (signed_char_Array_0[1])))) > unsigned_char_Array_0[1]) ? (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) < (signed_char_Array_0[2])) ? (((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) : (signed_char_Array_0[2]))))) : 1))) && (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1]))) && (signed_long_int_Array_0[1] == ((signed long int) signed_short_int_Array_0[0])) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] EXPR ((((((((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) ^ (signed_long_int_Array_0[1] * signed_short_int_Array_0[0])) <= -64) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) && ((unsigned_short_int_Array_0[1] <= ((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (signed_char_Array_0[3] == ((signed char) ((signed_char_Array_0[1] - (1 + signed_char_Array_0[0])) + signed_char_Array_0[2]))) : (signed_char_Array_0[3] == ((signed char) signed_char_Array_0[2])))) && ((2.75f > float_Array_0[0]) ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[2] + signed_char_Array_0[1]))) : (((unsigned_long_int_Array_0[0] - ((((signed_long_int_Array_0[0]) > (signed_char_Array_0[1])) ? (signed_long_int_Array_0[0]) : (signed_char_Array_0[1])))) > unsigned_char_Array_0[1]) ? (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) < (signed_char_Array_0[2])) ? (((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) : (signed_char_Array_0[2]))))) : 1))) && (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1]))) && (signed_long_int_Array_0[1] == ((signed long int) signed_short_int_Array_0[0]))) && (signed_short_int_Array_0[0] == ((signed short int) signed_long_int_Array_0[0])) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] EXPR ((((((((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) ^ (signed_long_int_Array_0[1] * signed_short_int_Array_0[0])) <= -64) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) && ((unsigned_short_int_Array_0[1] <= ((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (signed_char_Array_0[3] == ((signed char) ((signed_char_Array_0[1] - (1 + signed_char_Array_0[0])) + signed_char_Array_0[2]))) : (signed_char_Array_0[3] == ((signed char) signed_char_Array_0[2])))) && ((2.75f > float_Array_0[0]) ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[2] + signed_char_Array_0[1]))) : (((unsigned_long_int_Array_0[0] - ((((signed_long_int_Array_0[0]) > (signed_char_Array_0[1])) ? (signed_long_int_Array_0[0]) : (signed_char_Array_0[1])))) > unsigned_char_Array_0[1]) ? (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) < (signed_char_Array_0[2])) ? (((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) : (signed_char_Array_0[2]))))) : 1))) && (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1]))) && (signed_long_int_Array_0[1] == ((signed long int) signed_short_int_Array_0[0]))) && (signed_short_int_Array_0[0] == ((signed short int) signed_long_int_Array_0[0])) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97-L98] return ((((((((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) ^ (signed_long_int_Array_0[1] * signed_short_int_Array_0[0])) <= -64) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) && ((unsigned_short_int_Array_0[1] <= ((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (signed_char_Array_0[3] == ((signed char) ((signed_char_Array_0[1] - (1 + signed_char_Array_0[0])) + signed_char_Array_0[2]))) : (signed_char_Array_0[3] == ((signed char) signed_char_Array_0[2])))) && ((2.75f > float_Array_0[0]) ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[2] + signed_char_Array_0[1]))) : (((unsigned_long_int_Array_0[0] - ((((signed_long_int_Array_0[0]) > (signed_char_Array_0[1])) ? (signed_long_int_Array_0[0]) : (signed_char_Array_0[1])))) > unsigned_char_Array_0[1]) ? (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) < (signed_char_Array_0[2])) ? (((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) : (signed_char_Array_0[2]))))) : 1))) && (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1]))) && (signed_long_int_Array_0[1] == ((signed long int) signed_short_int_Array_0[0]))) && (signed_short_int_Array_0[0] == ((signed short int) signed_long_int_Array_0[0])) ; [L107] RET, EXPR property() [L107] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L19] reach_error() VAL [\old(cond)=0, cond=0, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 90 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 50.6s, OverallIterations: 18, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 31.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 3511 SdHoareTripleChecker+Valid, 12.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3501 mSDsluCounter, 8806 SdHoareTripleChecker+Invalid, 11.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6834 mSDsCounter, 767 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5098 IncrementalHoareTripleChecker+Invalid, 5866 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 767 mSolverCounterUnsat, 1972 mSDtfsCounter, 5098 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1508 GetRequests, 1225 SyntacticMatches, 1 SemanticMatches, 282 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4638 ImplicationChecksByTransitivity, 26.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=288occurred in iteration=9, InterpolantAutomatonStates: 208, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 261 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 16.0s InterpolantComputationTime, 2539 NumberOfCodeBlocks, 2539 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 2752 ConstructedInterpolants, 0 QuantifiedInterpolants, 16702 SizeOfPredicates, 61 NumberOfNonLiveVariables, 1464 ConjunctsInSsa, 123 ConjunctsInUnsatCore, 23 InterpolantComputations, 14 PerfectInterpolantSequences, 9192/9660 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-12-21 01:45:43,333 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...