/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-14.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 01:39:46,705 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 01:39:46,769 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:39:46,772 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 01:39:46,773 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 01:39:46,792 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 01:39:46,792 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 01:39:46,793 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 01:39:46,793 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 01:39:46,795 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 01:39:46,795 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 01:39:46,797 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 01:39:46,797 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 01:39:46,797 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 01:39:46,797 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 01:39:46,798 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 01:39:46,798 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 01:39:46,798 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 01:39:46,798 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 01:39:46,798 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 01:39:46,798 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 01:39:46,800 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 01:39:46,800 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 01:39:46,800 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 01:39:46,800 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 01:39:46,800 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 01:39:46,801 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 01:39:46,801 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 01:39:46,801 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 01:39:46,801 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 01:39:46,801 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 01:39:46,801 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 01:39:46,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 01:39:46,802 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 01:39:46,802 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 01:39:46,802 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 01:39:46,802 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 01:39:46,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 01:39:46,803 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 01:39:46,803 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 01:39:46,803 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 01:39:46,804 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 01:39:46,804 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 01:39:46,804 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:39:46,993 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 01:39:47,011 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 01:39:47,013 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 01:39:47,014 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 01:39:47,014 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 01:39:47,015 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-14.i [2023-12-21 01:39:48,100 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 01:39:48,272 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 01:39:48,272 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-14.i [2023-12-21 01:39:48,283 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43377183b/1aeb4da911914f1ea2e22531c3914562/FLAG99469a662 [2023-12-21 01:39:48,296 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43377183b/1aeb4da911914f1ea2e22531c3914562 [2023-12-21 01:39:48,298 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 01:39:48,299 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 01:39:48,301 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 01:39:48,301 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 01:39:48,304 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 01:39:48,305 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 01:39:48" (1/1) ... [2023-12-21 01:39:48,306 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5386c2cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:39:48, skipping insertion in model container [2023-12-21 01:39:48,306 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 01:39:48" (1/1) ... [2023-12-21 01:39:48,336 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 01:39:48,459 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-14.i[916,929] [2023-12-21 01:39:48,536 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 01:39:48,553 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 01:39:48,562 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-14.i[916,929] [2023-12-21 01:39:48,589 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 01:39:48,601 INFO L206 MainTranslator]: Completed translation [2023-12-21 01:39:48,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:39:48 WrapperNode [2023-12-21 01:39:48,601 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 01:39:48,602 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 01:39:48,602 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 01:39:48,602 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 01:39:48,607 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:39:48" (1/1) ... [2023-12-21 01:39:48,633 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:39:48" (1/1) ... [2023-12-21 01:39:48,665 INFO L138 Inliner]: procedures = 29, calls = 188, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 569 [2023-12-21 01:39:48,666 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 01:39:48,666 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 01:39:48,666 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 01:39:48,666 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 01:39:48,675 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:39:48" (1/1) ... [2023-12-21 01:39:48,675 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:39:48" (1/1) ... [2023-12-21 01:39:48,684 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:39:48" (1/1) ... [2023-12-21 01:39:48,699 INFO L175 MemorySlicer]: Split 150 memory accesses to 7 slices as follows [2, 36, 8, 27, 3, 47, 27]. 31 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 5, 1, 3, 1, 4, 2]. The 20 writes are split as follows [0, 6, 1, 3, 1, 5, 4]. [2023-12-21 01:39:48,700 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:39:48" (1/1) ... [2023-12-21 01:39:48,700 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:39:48" (1/1) ... [2023-12-21 01:39:48,715 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:39:48" (1/1) ... [2023-12-21 01:39:48,735 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:39:48" (1/1) ... [2023-12-21 01:39:48,737 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:39:48" (1/1) ... [2023-12-21 01:39:48,739 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:39:48" (1/1) ... [2023-12-21 01:39:48,743 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 01:39:48,744 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 01:39:48,744 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 01:39:48,744 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 01:39:48,745 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:39:48" (1/1) ... [2023-12-21 01:39:48,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 01:39:48,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 01:39:48,779 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:39:48,799 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:39:48,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 01:39:48,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-21 01:39:48,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-21 01:39:48,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-12-21 01:39:48,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2023-12-21 01:39:48,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2023-12-21 01:39:48,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2023-12-21 01:39:48,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2023-12-21 01:39:48,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-21 01:39:48,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-21 01:39:48,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-21 01:39:48,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-21 01:39:48,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-21 01:39:48,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-12-21 01:39:48,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2023-12-21 01:39:48,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-21 01:39:48,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-21 01:39:48,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-12-21 01:39:48,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2023-12-21 01:39:48,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2023-12-21 01:39:48,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2023-12-21 01:39:48,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2023-12-21 01:39:48,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-21 01:39:48,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-21 01:39:48,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-21 01:39:48,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-21 01:39:48,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-21 01:39:48,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-12-21 01:39:48,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2023-12-21 01:39:48,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-21 01:39:48,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-21 01:39:48,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-12-21 01:39:48,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2023-12-21 01:39:48,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2023-12-21 01:39:48,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2023-12-21 01:39:48,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2023-12-21 01:39:48,812 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-21 01:39:48,812 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-21 01:39:48,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 01:39:48,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-21 01:39:48,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-21 01:39:48,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-21 01:39:48,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-21 01:39:48,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-12-21 01:39:48,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-12-21 01:39:48,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 01:39:48,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 01:39:48,928 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 01:39:48,930 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 01:39:49,324 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 01:39:49,350 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 01:39:49,350 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-21 01:39:49,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 01:39:49 BoogieIcfgContainer [2023-12-21 01:39:49,351 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 01:39:49,356 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 01:39:49,357 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 01:39:49,358 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 01:39:49,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 01:39:48" (1/3) ... [2023-12-21 01:39:49,359 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b8520da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 01:39:49, skipping insertion in model container [2023-12-21 01:39:49,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:39:48" (2/3) ... [2023-12-21 01:39:49,360 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b8520da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 01:39:49, skipping insertion in model container [2023-12-21 01:39:49,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 01:39:49" (3/3) ... [2023-12-21 01:39:49,360 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-14.i [2023-12-21 01:39:49,371 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 01:39:49,372 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 01:39:49,412 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 01:39:49,417 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;@77c871f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 01:39:49,417 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 01:39:49,420 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 97 states have (on average 1.4536082474226804) internal successors, (141), 98 states have internal predecessors, (141), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-21 01:39:49,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-12-21 01:39:49,433 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:39:49,434 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:49,434 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:39:49,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:39:49,438 INFO L85 PathProgramCache]: Analyzing trace with hash -827617158, now seen corresponding path program 1 times [2023-12-21 01:39:49,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:39:49,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648550951] [2023-12-21 01:39:49,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:39:49,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:39:49,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:49,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:39:49,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:49,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:39:49,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:49,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:39:49,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:49,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:39:49,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:49,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:39:49,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:49,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:39:49,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:49,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:39:49,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:49,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:39:49,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:49,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:39:49,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:49,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:39:49,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:49,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:39:49,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:49,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:39:49,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:49,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:39:49,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:49,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:39:49,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:49,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:39:49,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:49,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 01:39:49,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:49,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-21 01:39:49,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:49,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-21 01:39:49,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:49,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-21 01:39:49,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:49,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-21 01:39:49,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:49,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 01:39:49,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:49,800 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-12-21 01:39:49,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:39:49,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648550951] [2023-12-21 01:39:49,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648550951] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:39:49,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:39:49,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 01:39:49,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332303883] [2023-12-21 01:39:49,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:39:49,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 01:39:49,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:39:49,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 01:39:49,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 01:39:49,835 INFO L87 Difference]: Start difference. First operand has 121 states, 97 states have (on average 1.4536082474226804) internal successors, (141), 98 states have internal predecessors, (141), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2023-12-21 01:39:49,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:39:49,882 INFO L93 Difference]: Finished difference Result 239 states and 385 transitions. [2023-12-21 01:39:49,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 01:39:49,884 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 163 [2023-12-21 01:39:49,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:39:49,891 INFO L225 Difference]: With dead ends: 239 [2023-12-21 01:39:49,891 INFO L226 Difference]: Without dead ends: 119 [2023-12-21 01:39:49,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 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:39:49,897 INFO L413 NwaCegarLoop]: 174 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, 174 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:39:49,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 174 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:39:49,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-12-21 01:39:49,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2023-12-21 01:39:49,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 96 states have (on average 1.4166666666666667) internal successors, (136), 96 states have internal predecessors, (136), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-21 01:39:49,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 178 transitions. [2023-12-21 01:39:49,941 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 178 transitions. Word has length 163 [2023-12-21 01:39:49,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:39:49,941 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 178 transitions. [2023-12-21 01:39:49,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2023-12-21 01:39:49,942 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 178 transitions. [2023-12-21 01:39:49,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-12-21 01:39:49,944 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:39:49,944 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:49,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 01:39:49,944 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:39:49,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:39:49,945 INFO L85 PathProgramCache]: Analyzing trace with hash -188368040, now seen corresponding path program 1 times [2023-12-21 01:39:49,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:39:49,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672514393] [2023-12-21 01:39:49,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:39:49,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:39:50,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:39:50,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:39:50,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:39:50,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:39:50,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:39:50,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:39:50,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:39:50,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:39:50,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:39:50,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:39:50,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:39:50,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:39:50,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:39:50,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:39:50,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:39:50,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 01:39:50,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-21 01:39:50,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-21 01:39:50,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-21 01:39:50,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-21 01:39:50,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 01:39:50,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,261 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-12-21 01:39:50,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:39:50,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672514393] [2023-12-21 01:39:50,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672514393] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:39:50,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:39:50,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 01:39:50,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478956880] [2023-12-21 01:39:50,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:39:50,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 01:39:50,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:39:50,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 01:39:50,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 01:39:50,268 INFO L87 Difference]: Start difference. First operand 119 states and 178 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-12-21 01:39:50,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:39:50,331 INFO L93 Difference]: Finished difference Result 243 states and 364 transitions. [2023-12-21 01:39:50,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 01:39:50,334 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 163 [2023-12-21 01:39:50,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:39:50,335 INFO L225 Difference]: With dead ends: 243 [2023-12-21 01:39:50,335 INFO L226 Difference]: Without dead ends: 125 [2023-12-21 01:39:50,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 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:39:50,337 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 10 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 514 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:39:50,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 514 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:39:50,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-12-21 01:39:50,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 121. [2023-12-21 01:39:50,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 98 states have (on average 1.4081632653061225) internal successors, (138), 98 states have internal predecessors, (138), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-21 01:39:50,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 180 transitions. [2023-12-21 01:39:50,346 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 180 transitions. Word has length 163 [2023-12-21 01:39:50,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:39:50,347 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 180 transitions. [2023-12-21 01:39:50,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-12-21 01:39:50,347 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 180 transitions. [2023-12-21 01:39:50,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-12-21 01:39:50,348 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:39:50,348 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:50,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 01:39:50,349 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:39:50,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:39:50,349 INFO L85 PathProgramCache]: Analyzing trace with hash 954134426, now seen corresponding path program 1 times [2023-12-21 01:39:50,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:39:50,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109501234] [2023-12-21 01:39:50,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:39:50,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:39:50,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:39:50,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:39:50,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:39:50,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:39:50,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:39:50,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:39:50,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:39:50,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:39:50,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:39:50,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:39:50,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:39:50,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:39:50,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:39:50,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:39:50,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:39:50,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 01:39:50,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-21 01:39:50,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-21 01:39:50,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-21 01:39:50,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-21 01:39:50,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 01:39:50,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,553 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-12-21 01:39:50,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:39:50,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109501234] [2023-12-21 01:39:50,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109501234] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:39:50,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:39:50,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 01:39:50,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279244166] [2023-12-21 01:39:50,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:39:50,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 01:39:50,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:39:50,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 01:39:50,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 01:39:50,555 INFO L87 Difference]: Start difference. First operand 121 states and 180 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-21 01:39:50,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:39:50,591 INFO L93 Difference]: Finished difference Result 245 states and 366 transitions. [2023-12-21 01:39:50,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 01:39:50,591 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2023-12-21 01:39:50,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:39:50,595 INFO L225 Difference]: With dead ends: 245 [2023-12-21 01:39:50,595 INFO L226 Difference]: Without dead ends: 125 [2023-12-21 01:39:50,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 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:39:50,600 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 3 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:39:50,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 506 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:39:50,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-12-21 01:39:50,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2023-12-21 01:39:50,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 101 states have (on average 1.396039603960396) internal successors, (141), 101 states have internal predecessors, (141), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-21 01:39:50,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 183 transitions. [2023-12-21 01:39:50,606 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 183 transitions. Word has length 163 [2023-12-21 01:39:50,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:39:50,606 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 183 transitions. [2023-12-21 01:39:50,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-21 01:39:50,606 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 183 transitions. [2023-12-21 01:39:50,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-12-21 01:39:50,608 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:39:50,611 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:50,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-21 01:39:50,612 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:39:50,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:39:50,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1651889128, now seen corresponding path program 1 times [2023-12-21 01:39:50,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:39:50,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317301461] [2023-12-21 01:39:50,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:39:50,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:39:50,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:39:50,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:39:50,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:39:50,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:39:50,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:39:50,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:39:50,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:39:50,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:39:50,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:39:50,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:39:50,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:39:50,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:39:50,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:39:50,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:39:50,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:39:50,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 01:39:50,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-21 01:39:50,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-21 01:39:50,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-21 01:39:50,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-21 01:39:50,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 01:39:50,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:50,914 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-12-21 01:39:50,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:39:50,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317301461] [2023-12-21 01:39:50,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317301461] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:39:50,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:39:50,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 01:39:50,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010789496] [2023-12-21 01:39:50,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:39:50,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 01:39:50,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:39:50,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 01:39:50,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 01:39:50,917 INFO L87 Difference]: Start difference. First operand 124 states and 183 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-21 01:39:51,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:39:51,055 INFO L93 Difference]: Finished difference Result 371 states and 548 transitions. [2023-12-21 01:39:51,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 01:39:51,056 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2023-12-21 01:39:51,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:39:51,059 INFO L225 Difference]: With dead ends: 371 [2023-12-21 01:39:51,059 INFO L226 Difference]: Without dead ends: 248 [2023-12-21 01:39:51,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 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:39:51,064 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 175 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 01:39:51,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 480 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 01:39:51,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2023-12-21 01:39:51,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 221. [2023-12-21 01:39:51,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 176 states have (on average 1.375) internal successors, (242), 176 states have internal predecessors, (242), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-21 01:39:51,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 326 transitions. [2023-12-21 01:39:51,092 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 326 transitions. Word has length 163 [2023-12-21 01:39:51,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:39:51,093 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 326 transitions. [2023-12-21 01:39:51,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-21 01:39:51,093 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 326 transitions. [2023-12-21 01:39:51,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-12-21 01:39:51,094 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:39:51,095 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:51,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-21 01:39:51,095 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:39:51,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:39:51,095 INFO L85 PathProgramCache]: Analyzing trace with hash 837639834, now seen corresponding path program 1 times [2023-12-21 01:39:51,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:39:51,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91544469] [2023-12-21 01:39:51,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:39:51,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:39:51,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:51,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:39:51,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:51,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:39:51,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:51,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:39:51,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:51,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:39:51,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:51,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:39:51,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:51,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:39:51,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:51,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:39:51,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:51,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:39:51,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:51,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:39:51,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:51,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:39:51,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:51,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:39:51,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:51,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:39:51,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:51,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:39:51,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:51,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:39:51,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:51,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:39:51,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:51,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 01:39:51,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:51,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-21 01:39:51,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:51,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-21 01:39:51,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:51,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-21 01:39:51,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:51,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-21 01:39:51,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:51,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 01:39:51,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:51,636 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-12-21 01:39:51,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:39:51,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91544469] [2023-12-21 01:39:51,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91544469] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:39:51,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:39:51,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 01:39:51,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781220639] [2023-12-21 01:39:51,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:39:51,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 01:39:51,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:39:51,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 01:39:51,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 01:39:51,638 INFO L87 Difference]: Start difference. First operand 221 states and 326 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-21 01:39:51,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:39:51,772 INFO L93 Difference]: Finished difference Result 354 states and 523 transitions. [2023-12-21 01:39:51,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 01:39:51,773 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2023-12-21 01:39:51,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:39:51,775 INFO L225 Difference]: With dead ends: 354 [2023-12-21 01:39:51,775 INFO L226 Difference]: Without dead ends: 225 [2023-12-21 01:39:51,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 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:39:51,776 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 174 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 01:39:51,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 405 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 01:39:51,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2023-12-21 01:39:51,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 223. [2023-12-21 01:39:51,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 178 states have (on average 1.3707865168539326) internal successors, (244), 178 states have internal predecessors, (244), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-21 01:39:51,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 328 transitions. [2023-12-21 01:39:51,795 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 328 transitions. Word has length 163 [2023-12-21 01:39:51,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:39:51,796 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 328 transitions. [2023-12-21 01:39:51,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-21 01:39:51,796 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 328 transitions. [2023-12-21 01:39:51,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-12-21 01:39:51,798 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:39:51,798 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:51,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-21 01:39:51,798 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:39:51,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:39:51,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1424445848, now seen corresponding path program 1 times [2023-12-21 01:39:51,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:39:51,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878071669] [2023-12-21 01:39:51,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:39:51,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:39:51,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:52,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:39:52,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:52,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:39:52,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:52,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:39:52,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:52,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:39:52,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:52,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:39:52,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:52,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:39:52,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:52,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:39:52,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:52,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:39:52,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:52,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:39:52,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:52,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:39:52,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:52,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:39:52,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:52,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:39:52,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:52,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:39:52,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:52,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:39:52,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:52,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:39:52,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:52,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 01:39:52,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:52,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-21 01:39:52,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:52,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-21 01:39:52,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:52,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-21 01:39:52,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:52,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-21 01:39:52,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:52,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 01:39:52,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:52,142 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-12-21 01:39:52,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:39:52,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878071669] [2023-12-21 01:39:52,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878071669] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:39:52,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:39:52,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 01:39:52,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170811865] [2023-12-21 01:39:52,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:39:52,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 01:39:52,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:39:52,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 01:39:52,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 01:39:52,144 INFO L87 Difference]: Start difference. First operand 223 states and 328 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-21 01:39:52,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:39:52,288 INFO L93 Difference]: Finished difference Result 483 states and 712 transitions. [2023-12-21 01:39:52,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-21 01:39:52,288 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2023-12-21 01:39:52,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:39:52,290 INFO L225 Difference]: With dead ends: 483 [2023-12-21 01:39:52,290 INFO L226 Difference]: Without dead ends: 359 [2023-12-21 01:39:52,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-21 01:39:52,291 INFO L413 NwaCegarLoop]: 285 mSDtfsCounter, 217 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 01:39:52,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 994 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 01:39:52,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2023-12-21 01:39:52,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 233. [2023-12-21 01:39:52,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 188 states have (on average 1.372340425531915) internal successors, (258), 188 states have internal predecessors, (258), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-21 01:39:52,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 342 transitions. [2023-12-21 01:39:52,304 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 342 transitions. Word has length 163 [2023-12-21 01:39:52,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:39:52,304 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 342 transitions. [2023-12-21 01:39:52,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-21 01:39:52,304 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 342 transitions. [2023-12-21 01:39:52,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-12-21 01:39:52,305 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:39:52,305 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:52,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-21 01:39:52,306 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:39:52,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:39:52,306 INFO L85 PathProgramCache]: Analyzing trace with hash -173477416, now seen corresponding path program 1 times [2023-12-21 01:39:52,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:39:52,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754709804] [2023-12-21 01:39:52,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:39:52,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:39:52,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:52,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:39:52,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:52,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:39:52,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:52,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:39:52,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:52,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:39:52,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:52,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:39:52,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:52,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:39:52,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:52,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:39:52,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:52,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:39:52,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:52,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:39:52,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:52,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:39:52,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:52,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:39:52,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:52,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:39:52,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:52,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:39:52,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:52,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:39:52,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:52,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:39:52,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:52,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 01:39:52,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:52,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-21 01:39:52,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:52,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-21 01:39:52,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:52,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-21 01:39:52,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:52,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-21 01:39:52,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:52,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 01:39:52,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:52,770 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-12-21 01:39:52,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:39:52,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754709804] [2023-12-21 01:39:52,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754709804] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:39:52,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:39:52,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 01:39:52,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285906807] [2023-12-21 01:39:52,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:39:52,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 01:39:52,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:39:52,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 01:39:52,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-21 01:39:52,773 INFO L87 Difference]: Start difference. First operand 233 states and 342 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-21 01:39:52,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:39:52,961 INFO L93 Difference]: Finished difference Result 521 states and 764 transitions. [2023-12-21 01:39:52,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 01:39:52,961 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2023-12-21 01:39:52,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:39:52,963 INFO L225 Difference]: With dead ends: 521 [2023-12-21 01:39:52,963 INFO L226 Difference]: Without dead ends: 385 [2023-12-21 01:39:52,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-12-21 01:39:52,964 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 368 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 01:39:52,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 643 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 01:39:52,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2023-12-21 01:39:52,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 229. [2023-12-21 01:39:52,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 184 states have (on average 1.3478260869565217) internal successors, (248), 184 states have internal predecessors, (248), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-21 01:39:52,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 332 transitions. [2023-12-21 01:39:52,975 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 332 transitions. Word has length 163 [2023-12-21 01:39:52,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:39:52,975 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 332 transitions. [2023-12-21 01:39:52,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-21 01:39:52,976 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 332 transitions. [2023-12-21 01:39:52,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-12-21 01:39:52,977 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:39:52,977 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:52,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-21 01:39:52,977 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:39:52,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:39:52,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1171585729, now seen corresponding path program 1 times [2023-12-21 01:39:52,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:39:52,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759804391] [2023-12-21 01:39:52,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:39:52,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:39:53,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:53,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:39:53,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:53,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:39:53,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:53,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:39:53,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:53,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:39:53,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:53,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:39:53,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:53,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:39:53,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:53,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:39:53,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:53,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:39:53,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:53,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:39:53,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:53,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:39:53,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:53,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:39:53,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:53,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:39:53,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:53,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:39:53,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:53,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:39:53,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:53,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:39:53,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:53,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 01:39:53,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:53,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-21 01:39:53,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:53,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-21 01:39:53,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:53,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-21 01:39:53,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:53,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-21 01:39:53,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:53,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 01:39:53,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:53,699 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2023-12-21 01:39:53,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:39:53,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759804391] [2023-12-21 01:39:53,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759804391] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 01:39:53,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479008807] [2023-12-21 01:39:53,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:39:53,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 01:39:53,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 01:39:53,724 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:39:53,769 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:39:53,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:54,008 INFO L262 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-21 01:39:54,025 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 01:39:54,079 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 7 treesize of output 3 [2023-12-21 01:39:54,262 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 25 treesize of output 13 [2023-12-21 01:39:54,324 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 25 treesize of output 13 [2023-12-21 01:39:54,406 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 25 treesize of output 13 [2023-12-21 01:39:54,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-12-21 01:39:54,994 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 20 proven. 60 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-21 01:39:54,994 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 01:39:55,449 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 17 [2023-12-21 01:39:55,451 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2023-12-21 01:39:55,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479008807] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 01:39:55,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 01:39:55,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 9] total 21 [2023-12-21 01:39:55,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724405527] [2023-12-21 01:39:55,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 01:39:55,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-21 01:39:55,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:39:55,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-21 01:39:55,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2023-12-21 01:39:55,454 INFO L87 Difference]: Start difference. First operand 229 states and 332 transitions. Second operand has 21 states, 18 states have (on average 8.833333333333334) internal successors, (159), 20 states have internal predecessors, (159), 6 states have call successors, (63), 3 states have call predecessors, (63), 5 states have return successors, (63), 3 states have call predecessors, (63), 6 states have call successors, (63) [2023-12-21 01:39:56,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:39:56,468 INFO L93 Difference]: Finished difference Result 685 states and 974 transitions. [2023-12-21 01:39:56,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-12-21 01:39:56,469 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 8.833333333333334) internal successors, (159), 20 states have internal predecessors, (159), 6 states have call successors, (63), 3 states have call predecessors, (63), 5 states have return successors, (63), 3 states have call predecessors, (63), 6 states have call successors, (63) Word has length 165 [2023-12-21 01:39:56,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:39:56,471 INFO L225 Difference]: With dead ends: 685 [2023-12-21 01:39:56,471 INFO L226 Difference]: Without dead ends: 548 [2023-12-21 01:39:56,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 361 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=432, Invalid=1730, Unknown=0, NotChecked=0, Total=2162 [2023-12-21 01:39:56,473 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 608 mSDsluCounter, 1593 mSDsCounter, 0 mSdLazyCounter, 1177 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 609 SdHoareTripleChecker+Valid, 1721 SdHoareTripleChecker+Invalid, 1291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 1177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-21 01:39:56,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [609 Valid, 1721 Invalid, 1291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 1177 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-21 01:39:56,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2023-12-21 01:39:56,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 272. [2023-12-21 01:39:56,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 225 states have (on average 1.3288888888888888) internal successors, (299), 225 states have internal predecessors, (299), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-21 01:39:56,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 383 transitions. [2023-12-21 01:39:56,494 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 383 transitions. Word has length 165 [2023-12-21 01:39:56,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:39:56,494 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 383 transitions. [2023-12-21 01:39:56,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 8.833333333333334) internal successors, (159), 20 states have internal predecessors, (159), 6 states have call successors, (63), 3 states have call predecessors, (63), 5 states have return successors, (63), 3 states have call predecessors, (63), 6 states have call successors, (63) [2023-12-21 01:39:56,494 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 383 transitions. [2023-12-21 01:39:56,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-12-21 01:39:56,495 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:39:56,495 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:56,521 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:39:56,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 01:39:56,703 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:39:56,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:39:56,704 INFO L85 PathProgramCache]: Analyzing trace with hash 493808959, now seen corresponding path program 1 times [2023-12-21 01:39:56,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:39:56,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476816818] [2023-12-21 01:39:56,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:39:56,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:39:56,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:57,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:39:57,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:57,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:39:57,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:57,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:39:57,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:57,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:39:57,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:57,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:39:57,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:57,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:39:57,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:57,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:39:57,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:57,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:39:57,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:57,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:39:57,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:57,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:39:57,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:57,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:39:57,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:57,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:39:57,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:57,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:39:57,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:57,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:39:57,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:57,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:39:57,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:57,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 01:39:57,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:57,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-21 01:39:57,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:57,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-21 01:39:57,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:57,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-21 01:39:57,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:57,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-21 01:39:57,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:57,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 01:39:57,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:57,878 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-12-21 01:39:57,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:39:57,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476816818] [2023-12-21 01:39:57,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476816818] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:39:57,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:39:57,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-21 01:39:57,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686036840] [2023-12-21 01:39:57,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:39:57,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 01:39:57,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:39:57,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 01:39:57,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-21 01:39:57,881 INFO L87 Difference]: Start difference. First operand 272 states and 383 transitions. Second operand has 7 states, 6 states have (on average 10.5) internal successors, (63), 7 states have internal predecessors, (63), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2023-12-21 01:39:58,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:39:58,269 INFO L93 Difference]: Finished difference Result 738 states and 1041 transitions. [2023-12-21 01:39:58,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 01:39:58,271 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.5) internal successors, (63), 7 states have internal predecessors, (63), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 165 [2023-12-21 01:39:58,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:39:58,273 INFO L225 Difference]: With dead ends: 738 [2023-12-21 01:39:58,274 INFO L226 Difference]: Without dead ends: 467 [2023-12-21 01:39:58,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2023-12-21 01:39:58,277 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 251 mSDsluCounter, 1026 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 1247 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 01:39:58,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 1247 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 01:39:58,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2023-12-21 01:39:58,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 444. [2023-12-21 01:39:58,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 367 states have (on average 1.332425068119891) internal successors, (489), 369 states have internal predecessors, (489), 68 states have call successors, (68), 8 states have call predecessors, (68), 8 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2023-12-21 01:39:58,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 625 transitions. [2023-12-21 01:39:58,330 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 625 transitions. Word has length 165 [2023-12-21 01:39:58,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:39:58,330 INFO L495 AbstractCegarLoop]: Abstraction has 444 states and 625 transitions. [2023-12-21 01:39:58,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.5) internal successors, (63), 7 states have internal predecessors, (63), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2023-12-21 01:39:58,330 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 625 transitions. [2023-12-21 01:39:58,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2023-12-21 01:39:58,332 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:39:58,332 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:58,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-21 01:39:58,333 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:39:58,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:39:58,333 INFO L85 PathProgramCache]: Analyzing trace with hash -660643686, now seen corresponding path program 1 times [2023-12-21 01:39:58,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:39:58,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169465419] [2023-12-21 01:39:58,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:39:58,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:39:58,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:59,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:39:59,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:59,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:39:59,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:59,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:39:59,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:59,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:39:59,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:59,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:39:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:59,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:39:59,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:59,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:39:59,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:59,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:39:59,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:59,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:39:59,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:59,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:39:59,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:59,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:39:59,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:59,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:39:59,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:59,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:39:59,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:59,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:39:59,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:59,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:39:59,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:59,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 01:39:59,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:59,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-21 01:39:59,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:59,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-21 01:39:59,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:59,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-21 01:39:59,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:59,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-21 01:39:59,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:59,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 01:39:59,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:59,343 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-12-21 01:39:59,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:39:59,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169465419] [2023-12-21 01:39:59,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169465419] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:39:59,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:39:59,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-21 01:39:59,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948608685] [2023-12-21 01:39:59,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:39:59,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-21 01:39:59,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:39:59,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-21 01:39:59,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-21 01:39:59,345 INFO L87 Difference]: Start difference. First operand 444 states and 625 transitions. Second operand has 9 states, 8 states have (on average 8.5) internal successors, (68), 9 states have internal predecessors, (68), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2023-12-21 01:39:59,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:39:59,525 INFO L93 Difference]: Finished difference Result 943 states and 1324 transitions. [2023-12-21 01:39:59,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-21 01:39:59,526 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 9 states have internal predecessors, (68), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 170 [2023-12-21 01:39:59,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:39:59,528 INFO L225 Difference]: With dead ends: 943 [2023-12-21 01:39:59,528 INFO L226 Difference]: Without dead ends: 552 [2023-12-21 01:39:59,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2023-12-21 01:39:59,530 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 231 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 1118 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 01:39:59,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 1118 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 01:39:59,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2023-12-21 01:39:59,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 484. [2023-12-21 01:39:59,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 407 states have (on average 1.3243243243243243) internal successors, (539), 409 states have internal predecessors, (539), 68 states have call successors, (68), 8 states have call predecessors, (68), 8 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2023-12-21 01:39:59,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 675 transitions. [2023-12-21 01:39:59,569 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 675 transitions. Word has length 170 [2023-12-21 01:39:59,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:39:59,569 INFO L495 AbstractCegarLoop]: Abstraction has 484 states and 675 transitions. [2023-12-21 01:39:59,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 9 states have internal predecessors, (68), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2023-12-21 01:39:59,569 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 675 transitions. [2023-12-21 01:39:59,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2023-12-21 01:39:59,571 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:39:59,571 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:59,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-21 01:39:59,571 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:39:59,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:39:59,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1136655836, now seen corresponding path program 1 times [2023-12-21 01:39:59,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:39:59,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319193440] [2023-12-21 01:39:59,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:39:59,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:39:59,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:59,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:39:59,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:59,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:39:59,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:59,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:39:59,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:59,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:39:59,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:59,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:39:59,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:59,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:39:59,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:59,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:39:59,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:59,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:39:59,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:59,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:39:59,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:59,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:39:59,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:59,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:39:59,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:59,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:39:59,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:59,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:39:59,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:59,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:39:59,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:59,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:39:59,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:59,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 01:39:59,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:59,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-21 01:39:59,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:59,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-21 01:39:59,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:59,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-21 01:39:59,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:59,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-21 01:39:59,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:59,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 01:39:59,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:39:59,849 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-12-21 01:39:59,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:39:59,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319193440] [2023-12-21 01:39:59,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319193440] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:39:59,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:39:59,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 01:39:59,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620479084] [2023-12-21 01:39:59,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:39:59,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 01:39:59,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:39:59,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 01:39:59,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 01:39:59,852 INFO L87 Difference]: Start difference. First operand 484 states and 675 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-21 01:39:59,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:39:59,995 INFO L93 Difference]: Finished difference Result 1070 states and 1494 transitions. [2023-12-21 01:39:59,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 01:39:59,995 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 172 [2023-12-21 01:39:59,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:40:00,000 INFO L225 Difference]: With dead ends: 1070 [2023-12-21 01:40:00,001 INFO L226 Difference]: Without dead ends: 776 [2023-12-21 01:40:00,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 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:40:00,003 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 166 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 01:40:00,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 716 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 01:40:00,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2023-12-21 01:40:00,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 513. [2023-12-21 01:40:00,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 427 states have (on average 1.3091334894613582) internal successors, (559), 429 states have internal predecessors, (559), 76 states have call successors, (76), 9 states have call predecessors, (76), 9 states have return successors, (76), 74 states have call predecessors, (76), 76 states have call successors, (76) [2023-12-21 01:40:00,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 711 transitions. [2023-12-21 01:40:00,052 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 711 transitions. Word has length 172 [2023-12-21 01:40:00,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:40:00,052 INFO L495 AbstractCegarLoop]: Abstraction has 513 states and 711 transitions. [2023-12-21 01:40:00,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-21 01:40:00,052 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 711 transitions. [2023-12-21 01:40:00,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2023-12-21 01:40:00,053 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:40:00,053 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:00,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-21 01:40:00,054 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:40:00,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:40:00,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1454183900, now seen corresponding path program 1 times [2023-12-21 01:40:00,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:40:00,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964525662] [2023-12-21 01:40:00,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:40:00,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:40:00,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:00,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:40:00,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:00,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:40:00,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:00,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:40:00,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:00,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:40:00,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:00,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:40:00,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:00,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:40:00,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:00,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:40:00,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:00,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:40:00,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:00,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:40:00,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:00,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:40:00,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:00,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:40:00,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:00,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:40:00,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:00,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:40:00,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:00,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:40:00,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:00,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:40:00,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:00,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 01:40:00,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:00,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-21 01:40:00,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:00,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-21 01:40:00,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:00,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-21 01:40:00,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:00,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-21 01:40:00,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:00,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 01:40:00,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:00,346 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-12-21 01:40:00,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:40:00,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964525662] [2023-12-21 01:40:00,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964525662] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:40:00,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:40:00,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 01:40:00,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520580661] [2023-12-21 01:40:00,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:40:00,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 01:40:00,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:40:00,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 01:40:00,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-21 01:40:00,348 INFO L87 Difference]: Start difference. First operand 513 states and 711 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-21 01:40:00,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:40:00,539 INFO L93 Difference]: Finished difference Result 1140 states and 1587 transitions. [2023-12-21 01:40:00,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 01:40:00,539 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 172 [2023-12-21 01:40:00,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:40:00,543 INFO L225 Difference]: With dead ends: 1140 [2023-12-21 01:40:00,543 INFO L226 Difference]: Without dead ends: 848 [2023-12-21 01:40:00,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-21 01:40:00,545 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 180 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 01:40:00,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 681 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 01:40:00,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2023-12-21 01:40:00,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 581. [2023-12-21 01:40:00,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 495 states have (on average 1.298989898989899) internal successors, (643), 497 states have internal predecessors, (643), 76 states have call successors, (76), 9 states have call predecessors, (76), 9 states have return successors, (76), 74 states have call predecessors, (76), 76 states have call successors, (76) [2023-12-21 01:40:00,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 795 transitions. [2023-12-21 01:40:00,588 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 795 transitions. Word has length 172 [2023-12-21 01:40:00,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:40:00,588 INFO L495 AbstractCegarLoop]: Abstraction has 581 states and 795 transitions. [2023-12-21 01:40:00,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-21 01:40:00,588 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 795 transitions. [2023-12-21 01:40:00,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2023-12-21 01:40:00,590 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:40:00,590 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:00,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-21 01:40:00,591 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:40:00,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:40:00,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1061156890, now seen corresponding path program 1 times [2023-12-21 01:40:00,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:40:00,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461346244] [2023-12-21 01:40:00,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:40:00,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:40:00,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:00,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:40:00,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:00,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:40:00,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:00,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:40:00,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:00,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:40:00,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:00,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:40:00,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:00,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:40:00,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:00,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:40:00,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:00,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:40:00,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:00,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:40:00,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:00,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:40:00,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:00,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:40:00,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:00,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:40:00,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:00,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:40:00,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:00,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:40:00,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:00,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:40:00,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:00,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 01:40:00,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:00,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-21 01:40:00,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:00,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-21 01:40:00,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:00,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-21 01:40:00,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:00,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-21 01:40:00,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:00,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 01:40:00,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:00,678 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-12-21 01:40:00,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:40:00,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461346244] [2023-12-21 01:40:00,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461346244] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:40:00,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:40:00,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 01:40:00,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288323993] [2023-12-21 01:40:00,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:40:00,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 01:40:00,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:40:00,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 01:40:00,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 01:40:00,679 INFO L87 Difference]: Start difference. First operand 581 states and 795 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-21 01:40:00,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:40:00,745 INFO L93 Difference]: Finished difference Result 1190 states and 1640 transitions. [2023-12-21 01:40:00,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 01:40:00,745 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 172 [2023-12-21 01:40:00,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:40:00,748 INFO L225 Difference]: With dead ends: 1190 [2023-12-21 01:40:00,748 INFO L226 Difference]: Without dead ends: 682 [2023-12-21 01:40:00,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 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:40:00,750 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 45 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:40:00,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 560 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:40:00,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2023-12-21 01:40:00,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 590. [2023-12-21 01:40:00,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 504 states have (on average 1.2936507936507937) internal successors, (652), 506 states have internal predecessors, (652), 76 states have call successors, (76), 9 states have call predecessors, (76), 9 states have return successors, (76), 74 states have call predecessors, (76), 76 states have call successors, (76) [2023-12-21 01:40:00,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 804 transitions. [2023-12-21 01:40:00,793 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 804 transitions. Word has length 172 [2023-12-21 01:40:00,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:40:00,793 INFO L495 AbstractCegarLoop]: Abstraction has 590 states and 804 transitions. [2023-12-21 01:40:00,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-21 01:40:00,793 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 804 transitions. [2023-12-21 01:40:00,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2023-12-21 01:40:00,794 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:40:00,794 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:00,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-21 01:40:00,794 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:40:00,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:40:00,795 INFO L85 PathProgramCache]: Analyzing trace with hash -318920996, now seen corresponding path program 1 times [2023-12-21 01:40:00,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:40:00,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821772494] [2023-12-21 01:40:00,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:40:00,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:40:00,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:01,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:40:01,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:01,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:40:01,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:01,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:40:01,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:01,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:40:01,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:01,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:40:01,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:01,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:40:01,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:01,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:40:01,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:01,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:40:01,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:01,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:40:01,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:01,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:40:01,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:01,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:40:01,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:01,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:40:01,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:01,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:40:01,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:01,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:40:01,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:01,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:40:01,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:01,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 01:40:01,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:01,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-21 01:40:01,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:01,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-21 01:40:01,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:01,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-21 01:40:01,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:01,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-21 01:40:01,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:01,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 01:40:01,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:01,233 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-12-21 01:40:01,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:40:01,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821772494] [2023-12-21 01:40:01,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821772494] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:40:01,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:40:01,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 01:40:01,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976592811] [2023-12-21 01:40:01,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:40:01,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 01:40:01,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:40:01,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 01:40:01,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 01:40:01,235 INFO L87 Difference]: Start difference. First operand 590 states and 804 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-21 01:40:01,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:40:01,396 INFO L93 Difference]: Finished difference Result 1056 states and 1424 transitions. [2023-12-21 01:40:01,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-21 01:40:01,396 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 172 [2023-12-21 01:40:01,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:40:01,400 INFO L225 Difference]: With dead ends: 1056 [2023-12-21 01:40:01,400 INFO L226 Difference]: Without dead ends: 1054 [2023-12-21 01:40:01,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-12-21 01:40:01,401 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 143 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 01:40:01,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1042 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 01:40:01,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2023-12-21 01:40:01,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 816. [2023-12-21 01:40:01,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 730 states have (on average 1.2808219178082192) internal successors, (935), 732 states have internal predecessors, (935), 76 states have call successors, (76), 9 states have call predecessors, (76), 9 states have return successors, (76), 74 states have call predecessors, (76), 76 states have call successors, (76) [2023-12-21 01:40:01,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1087 transitions. [2023-12-21 01:40:01,456 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1087 transitions. Word has length 172 [2023-12-21 01:40:01,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:40:01,457 INFO L495 AbstractCegarLoop]: Abstraction has 816 states and 1087 transitions. [2023-12-21 01:40:01,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-21 01:40:01,457 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1087 transitions. [2023-12-21 01:40:01,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2023-12-21 01:40:01,458 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:40:01,459 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:01,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-21 01:40:01,459 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:40:01,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:40:01,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1526454752, now seen corresponding path program 1 times [2023-12-21 01:40:01,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:40:01,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840443356] [2023-12-21 01:40:01,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:40:01,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:40:01,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:01,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:40:01,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:01,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:40:01,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:01,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:40:01,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:01,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:40:01,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:01,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:40:01,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:01,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:40:01,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:01,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:40:01,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:01,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:40:01,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:01,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:40:01,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:01,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:40:01,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:01,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:40:01,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:01,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:40:01,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:01,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:40:01,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:01,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:40:01,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:01,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:40:01,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:01,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 01:40:01,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:01,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-21 01:40:01,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:01,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-21 01:40:01,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:01,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-21 01:40:02,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:02,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-21 01:40:02,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:02,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 01:40:02,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:02,004 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-12-21 01:40:02,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:40:02,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840443356] [2023-12-21 01:40:02,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840443356] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:40:02,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:40:02,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 01:40:02,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283268607] [2023-12-21 01:40:02,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:40:02,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 01:40:02,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:40:02,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 01:40:02,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-21 01:40:02,007 INFO L87 Difference]: Start difference. First operand 816 states and 1087 transitions. Second operand has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2023-12-21 01:40:02,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:40:02,166 INFO L93 Difference]: Finished difference Result 1723 states and 2285 transitions. [2023-12-21 01:40:02,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 01:40:02,166 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 172 [2023-12-21 01:40:02,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:40:02,169 INFO L225 Difference]: With dead ends: 1723 [2023-12-21 01:40:02,169 INFO L226 Difference]: Without dead ends: 980 [2023-12-21 01:40:02,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 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:40:02,172 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 156 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 01:40:02,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 607 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 01:40:02,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2023-12-21 01:40:02,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 908. [2023-12-21 01:40:02,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 808 states have (on average 1.271039603960396) internal successors, (1027), 812 states have internal predecessors, (1027), 84 states have call successors, (84), 15 states have call predecessors, (84), 15 states have return successors, (84), 80 states have call predecessors, (84), 84 states have call successors, (84) [2023-12-21 01:40:02,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1195 transitions. [2023-12-21 01:40:02,231 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1195 transitions. Word has length 172 [2023-12-21 01:40:02,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:40:02,232 INFO L495 AbstractCegarLoop]: Abstraction has 908 states and 1195 transitions. [2023-12-21 01:40:02,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2023-12-21 01:40:02,232 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1195 transitions. [2023-12-21 01:40:02,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2023-12-21 01:40:02,233 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:40:02,233 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:02,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-21 01:40:02,233 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:40:02,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:40:02,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1133427742, now seen corresponding path program 1 times [2023-12-21 01:40:02,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:40:02,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220834131] [2023-12-21 01:40:02,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:40:02,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:40:02,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:02,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:40:02,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:02,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:40:02,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:02,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:40:02,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:02,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:40:02,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:02,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:40:02,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:02,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:40:02,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:02,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:40:02,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:02,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:40:02,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:02,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:40:02,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:02,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:40:02,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:02,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:40:02,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:02,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:40:02,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:02,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:40:02,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:02,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:40:02,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:02,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:40:02,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:02,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 01:40:02,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:02,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-21 01:40:02,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:02,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-21 01:40:02,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:02,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-21 01:40:02,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:02,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-21 01:40:02,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:02,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 01:40:02,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:02,677 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-12-21 01:40:02,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:40:02,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220834131] [2023-12-21 01:40:02,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220834131] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:40:02,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:40:02,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-21 01:40:02,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146128510] [2023-12-21 01:40:02,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:40:02,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 01:40:02,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:40:02,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 01:40:02,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-21 01:40:02,679 INFO L87 Difference]: Start difference. First operand 908 states and 1195 transitions. Second operand has 8 states, 7 states have (on average 10.0) internal successors, (70), 8 states have internal predecessors, (70), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2023-12-21 01:40:02,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:40:02,889 INFO L93 Difference]: Finished difference Result 2112 states and 2783 transitions. [2023-12-21 01:40:02,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 01:40:02,889 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.0) internal successors, (70), 8 states have internal predecessors, (70), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 172 [2023-12-21 01:40:02,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:40:02,893 INFO L225 Difference]: With dead ends: 2112 [2023-12-21 01:40:02,893 INFO L226 Difference]: Without dead ends: 1281 [2023-12-21 01:40:02,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-12-21 01:40:02,895 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 228 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 1020 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 01:40:02,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 1020 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 01:40:02,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2023-12-21 01:40:02,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 1139. [2023-12-21 01:40:02,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1139 states, 1022 states have (on average 1.264187866927593) internal successors, (1292), 1028 states have internal predecessors, (1292), 96 states have call successors, (96), 20 states have call predecessors, (96), 20 states have return successors, (96), 90 states have call predecessors, (96), 96 states have call successors, (96) [2023-12-21 01:40:02,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1484 transitions. [2023-12-21 01:40:02,969 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1484 transitions. Word has length 172 [2023-12-21 01:40:02,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:40:02,969 INFO L495 AbstractCegarLoop]: Abstraction has 1139 states and 1484 transitions. [2023-12-21 01:40:02,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.0) internal successors, (70), 8 states have internal predecessors, (70), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2023-12-21 01:40:02,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1484 transitions. [2023-12-21 01:40:02,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2023-12-21 01:40:02,971 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:40:02,971 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:02,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-21 01:40:02,971 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:40:02,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:40:02,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1391593180, now seen corresponding path program 1 times [2023-12-21 01:40:02,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:40:02,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307228743] [2023-12-21 01:40:02,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:40:02,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:40:03,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:03,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:40:03,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:03,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:40:03,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:03,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:40:03,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:03,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:40:03,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:03,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:40:03,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:03,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:40:03,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:03,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:40:03,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:03,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:40:03,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:03,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:40:03,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:03,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:40:03,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:03,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:40:03,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:03,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:40:03,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:03,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:40:03,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:03,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:40:03,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:03,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:40:03,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:03,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 01:40:03,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:03,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-21 01:40:03,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:03,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-21 01:40:03,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:03,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-21 01:40:03,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:03,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-21 01:40:03,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:03,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 01:40:03,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:03,194 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-12-21 01:40:03,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:40:03,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307228743] [2023-12-21 01:40:03,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307228743] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:40:03,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:40:03,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 01:40:03,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115835891] [2023-12-21 01:40:03,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:40:03,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 01:40:03,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:40:03,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 01:40:03,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-21 01:40:03,196 INFO L87 Difference]: Start difference. First operand 1139 states and 1484 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-21 01:40:03,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:40:03,400 INFO L93 Difference]: Finished difference Result 2338 states and 3064 transitions. [2023-12-21 01:40:03,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 01:40:03,400 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 172 [2023-12-21 01:40:03,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:40:03,405 INFO L225 Difference]: With dead ends: 2338 [2023-12-21 01:40:03,405 INFO L226 Difference]: Without dead ends: 1276 [2023-12-21 01:40:03,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-21 01:40:03,407 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 142 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 01:40:03,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 770 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 01:40:03,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2023-12-21 01:40:03,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 1096. [2023-12-21 01:40:03,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1096 states, 979 states have (on average 1.2574055158324822) internal successors, (1231), 985 states have internal predecessors, (1231), 96 states have call successors, (96), 20 states have call predecessors, (96), 20 states have return successors, (96), 90 states have call predecessors, (96), 96 states have call successors, (96) [2023-12-21 01:40:03,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 1096 states and 1423 transitions. [2023-12-21 01:40:03,483 INFO L78 Accepts]: Start accepts. Automaton has 1096 states and 1423 transitions. Word has length 172 [2023-12-21 01:40:03,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:40:03,483 INFO L495 AbstractCegarLoop]: Abstraction has 1096 states and 1423 transitions. [2023-12-21 01:40:03,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-21 01:40:03,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1423 transitions. [2023-12-21 01:40:03,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2023-12-21 01:40:03,485 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:40:03,485 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:03,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-21 01:40:03,485 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:40:03,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:40:03,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1901617376, now seen corresponding path program 1 times [2023-12-21 01:40:03,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:40:03,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298753043] [2023-12-21 01:40:03,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:40:03,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:40:03,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:03,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:40:03,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:03,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:40:03,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:03,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:40:03,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:03,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:40:03,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:03,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:40:03,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:03,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:40:03,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:03,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:40:03,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:03,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:40:03,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:03,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:40:03,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:03,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:40:03,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:03,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:40:03,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:03,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:40:03,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:03,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:40:03,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:03,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:40:03,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:03,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:40:03,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:03,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 01:40:03,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:03,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-21 01:40:03,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:03,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-21 01:40:03,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:03,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-21 01:40:03,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:03,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-21 01:40:03,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:03,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 01:40:03,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:03,987 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-12-21 01:40:03,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:40:03,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298753043] [2023-12-21 01:40:03,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298753043] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:40:03,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:40:03,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 01:40:03,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822098322] [2023-12-21 01:40:03,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:40:03,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 01:40:03,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:40:03,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 01:40:03,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-21 01:40:03,989 INFO L87 Difference]: Start difference. First operand 1096 states and 1423 transitions. Second operand has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2023-12-21 01:40:04,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:40:04,171 INFO L93 Difference]: Finished difference Result 1914 states and 2493 transitions. [2023-12-21 01:40:04,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 01:40:04,172 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 172 [2023-12-21 01:40:04,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:40:04,176 INFO L225 Difference]: With dead ends: 1914 [2023-12-21 01:40:04,176 INFO L226 Difference]: Without dead ends: 1169 [2023-12-21 01:40:04,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 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:40:04,178 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 146 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 01:40:04,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 823 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 01:40:04,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2023-12-21 01:40:04,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 1038. [2023-12-21 01:40:04,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1038 states, 931 states have (on average 1.2502685284640171) internal successors, (1164), 935 states have internal predecessors, (1164), 88 states have call successors, (88), 18 states have call predecessors, (88), 18 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2023-12-21 01:40:04,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 1340 transitions. [2023-12-21 01:40:04,258 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 1340 transitions. Word has length 172 [2023-12-21 01:40:04,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:40:04,258 INFO L495 AbstractCegarLoop]: Abstraction has 1038 states and 1340 transitions. [2023-12-21 01:40:04,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2023-12-21 01:40:04,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1340 transitions. [2023-12-21 01:40:04,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2023-12-21 01:40:04,260 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:40:04,260 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:04,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-21 01:40:04,260 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:40:04,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:40:04,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1963656990, now seen corresponding path program 1 times [2023-12-21 01:40:04,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:40:04,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718419517] [2023-12-21 01:40:04,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:40:04,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:40:04,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:04,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:40:04,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:04,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:40:04,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:04,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:40:04,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:04,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:40:04,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:04,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:40:04,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:04,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:40:04,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:04,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:40:04,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:04,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:40:04,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:04,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:40:04,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:04,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:40:04,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:04,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:40:04,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:04,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:40:04,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:04,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:40:04,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:04,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:40:04,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:04,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:40:04,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:04,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 01:40:04,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:04,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-21 01:40:04,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:04,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-21 01:40:04,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:04,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-21 01:40:04,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:04,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-21 01:40:04,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:04,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 01:40:04,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:40:04,743 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-12-21 01:40:04,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:40:04,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718419517] [2023-12-21 01:40:04,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718419517] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:40:04,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:40:04,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-21 01:40:04,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569937171] [2023-12-21 01:40:04,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:40:04,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 01:40:04,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:40:04,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 01:40:04,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-21 01:40:04,745 INFO L87 Difference]: Start difference. First operand 1038 states and 1340 transitions. Second operand has 8 states, 7 states have (on average 10.0) internal successors, (70), 8 states have internal predecessors, (70), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2023-12-21 01:40:04,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:40:04,985 INFO L93 Difference]: Finished difference Result 1903 states and 2471 transitions. [2023-12-21 01:40:04,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-21 01:40:04,986 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.0) internal successors, (70), 8 states have internal predecessors, (70), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 172 [2023-12-21 01:40:04,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:40:04,989 INFO L225 Difference]: With dead ends: 1903 [2023-12-21 01:40:04,989 INFO L226 Difference]: Without dead ends: 1216 [2023-12-21 01:40:04,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-12-21 01:40:04,990 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 204 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 01:40:04,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 1138 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 01:40:04,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2023-12-21 01:40:05,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 1125. [2023-12-21 01:40:05,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 1001 states have (on average 1.2457542457542456) internal successors, (1247), 1007 states have internal predecessors, (1247), 100 states have call successors, (100), 23 states have call predecessors, (100), 23 states have return successors, (100), 94 states have call predecessors, (100), 100 states have call successors, (100) [2023-12-21 01:40:05,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1447 transitions. [2023-12-21 01:40:05,070 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1447 transitions. Word has length 172 [2023-12-21 01:40:05,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:40:05,070 INFO L495 AbstractCegarLoop]: Abstraction has 1125 states and 1447 transitions. [2023-12-21 01:40:05,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.0) internal successors, (70), 8 states have internal predecessors, (70), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2023-12-21 01:40:05,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1447 transitions. [2023-12-21 01:40:05,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2023-12-21 01:40:05,071 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:40:05,071 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:05,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-21 01:40:05,072 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:40:05,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:40:05,072 INFO L85 PathProgramCache]: Analyzing trace with hash -864425340, now seen corresponding path program 1 times [2023-12-21 01:40:05,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:40:05,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532607126] [2023-12-21 01:40:05,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:40:05,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:40:05,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 01:40:05,146 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-21 01:40:05,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 01:40:05,302 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-21 01:40:05,302 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-21 01:40:05,303 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 01:40:05,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-21 01:40:05,306 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:40:05,310 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 01:40:05,411 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 01:40:05 BoogieIcfgContainer [2023-12-21 01:40:05,411 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 01:40:05,411 INFO L158 Benchmark]: Toolchain (without parser) took 17111.99ms. Allocated memory was 169.9MB in the beginning and 682.6MB in the end (delta: 512.8MB). Free memory was 125.7MB in the beginning and 291.4MB in the end (delta: -165.7MB). Peak memory consumption was 348.6MB. Max. memory is 8.0GB. [2023-12-21 01:40:05,412 INFO L158 Benchmark]: CDTParser took 0.47ms. Allocated memory is still 169.9MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 01:40:05,412 INFO L158 Benchmark]: CACSL2BoogieTranslator took 300.72ms. Allocated memory is still 169.9MB. Free memory was 125.3MB in the beginning and 109.4MB in the end (delta: 15.9MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-21 01:40:05,412 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.45ms. Allocated memory is still 169.9MB. Free memory was 109.4MB in the beginning and 105.0MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-21 01:40:05,412 INFO L158 Benchmark]: Boogie Preprocessor took 77.21ms. Allocated memory is still 169.9MB. Free memory was 105.0MB in the beginning and 99.1MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2023-12-21 01:40:05,412 INFO L158 Benchmark]: RCFGBuilder took 606.99ms. Allocated memory is still 169.9MB. Free memory was 99.1MB in the beginning and 134.7MB in the end (delta: -35.6MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2023-12-21 01:40:05,415 INFO L158 Benchmark]: TraceAbstraction took 16054.46ms. Allocated memory was 169.9MB in the beginning and 682.6MB in the end (delta: 512.8MB). Free memory was 133.6MB in the beginning and 291.4MB in the end (delta: -157.8MB). Peak memory consumption was 355.0MB. Max. memory is 8.0GB. [2023-12-21 01:40:05,418 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.47ms. Allocated memory is still 169.9MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 300.72ms. Allocated memory is still 169.9MB. Free memory was 125.3MB in the beginning and 109.4MB in the end (delta: 15.9MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 63.45ms. Allocated memory is still 169.9MB. Free memory was 109.4MB in the beginning and 105.0MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 77.21ms. Allocated memory is still 169.9MB. Free memory was 105.0MB in the beginning and 99.1MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * RCFGBuilder took 606.99ms. Allocated memory is still 169.9MB. Free memory was 99.1MB in the beginning and 134.7MB in the end (delta: -35.6MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 16054.46ms. Allocated memory was 169.9MB in the beginning and 682.6MB in the end (delta: 512.8MB). Free memory was 133.6MB in the beginning and 291.4MB in the end (delta: -157.8MB). Peak memory consumption was 355.0MB. 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 someBinaryDOUBLEComparisonOperation at line 50, overapproximation of someBinaryFLOATComparisonOperation at line 107. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 1, 0, 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 1, 0, 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 1, 0, 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 1, 0, 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 1, 0, 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 1, 0, 1, 0 }; [L25-L27] double double_Array_0[1] = { 8.6 }; [L25-L27] double double_Array_0[1] = { 8.6 }; [L28-L30] float float_Array_0[3] = { 32.25, 15.5, 256.25 }; [L28-L30] float float_Array_0[3] = { 32.25, 15.5, 256.25 }; [L28-L30] float float_Array_0[3] = { 32.25, 15.5, 256.25 }; [L28-L30] float float_Array_0[3] = { 32.25, 15.5, 256.25 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { 1000000 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { 1000000 }; [L34-L36] signed short int signed_short_int_Array_0[2][2] = { {8, -64}, {10, -64} }; [L34-L36] signed short int signed_short_int_Array_0[2][2] = { {8, -64}, {10, -64} }; [L34-L36] signed short int signed_short_int_Array_0[2][2] = { {8, -64}, {10, -64} }; [L34-L36] signed short int signed_short_int_Array_0[2][2] = { {8, -64}, {10, -64} }; [L34-L36] signed short int signed_short_int_Array_0[2][2] = { {8, -64}, {10, -64} }; [L37-L39] unsigned short int unsigned_short_int_Array_0[2] = { 2, 57581 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[2] = { 2, 57581 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[2] = { 2, 57581 }; [L40] unsigned char last_1_BOOL_unsigned_char_Array_0_0_ = 0; [L111] isInitial = 1 [L112] FCALL initially() [L113] COND TRUE 1 [L114] CALL updateLastVariables() [L104] EXPR BOOL_unsigned_char_Array_0[0] [L104] last_1_BOOL_unsigned_char_Array_0_0_ = BOOL_unsigned_char_Array_0[0] [L114] RET updateLastVariables() [L115] CALL updateVariables() [L69] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L70] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L70] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L71] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L71] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L71] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] BOOL_unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L73] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L73] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L73] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] BOOL_unsigned_char_Array_0[3] = __VERIFIER_nondet_uchar() [L76] EXPR BOOL_unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] EXPR BOOL_unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[3] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[3] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] BOOL_unsigned_char_Array_0[4] = __VERIFIER_nondet_uchar() [L79] EXPR BOOL_unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[4] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[4] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] EXPR BOOL_unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[4] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[4] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] double_Array_0[0] = __VERIFIER_nondet_double() [L82] EXPR double_Array_0[0] [L82] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F [L82] EXPR double_Array_0[0] [L82] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] CALL assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] RET assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] float_Array_0[0] = __VERIFIER_nondet_float() [L84] EXPR float_Array_0[0] [L84] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F [L84] EXPR float_Array_0[0] [L84] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] 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 [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] 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 [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] 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 [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] 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 [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] float_Array_0[1] = __VERIFIER_nondet_float() [L86] EXPR float_Array_0[1] [L86] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F [L86] EXPR float_Array_0[1] [L86] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] EXPR (float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] EXPR (float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] EXPR float_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] CALL assume_abort_if_not(float_Array_0[1] != 0.0F) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] RET assume_abort_if_not(float_Array_0[1] != 0.0F) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L88] float_Array_0[2] = __VERIFIER_nondet_float() [L89] EXPR float_Array_0[2] [L89] EXPR float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F [L89] EXPR float_Array_0[2] [L89] EXPR float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR (float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR (float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] CALL assume_abort_if_not((float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] RET assume_abort_if_not((float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L90] signed_short_int_Array_0[0][0] = __VERIFIER_nondet_short() [L91] EXPR signed_short_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L91] CALL assume_abort_if_not(signed_short_int_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L91] RET assume_abort_if_not(signed_short_int_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] EXPR signed_short_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] CALL assume_abort_if_not(signed_short_int_Array_0[0][0] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] RET assume_abort_if_not(signed_short_int_Array_0[0][0] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L93] signed_short_int_Array_0[1][0] = __VERIFIER_nondet_short() [L94] EXPR signed_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L94] CALL assume_abort_if_not(signed_short_int_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L94] RET assume_abort_if_not(signed_short_int_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR signed_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] CALL assume_abort_if_not(signed_short_int_Array_0[1][0] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] RET assume_abort_if_not(signed_short_int_Array_0[1][0] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] signed_short_int_Array_0[0][1] = __VERIFIER_nondet_short() [L97] EXPR signed_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] CALL assume_abort_if_not(signed_short_int_Array_0[0][1] >= -32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] RET assume_abort_if_not(signed_short_int_Array_0[0][1] >= -32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L98] EXPR signed_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L98] CALL assume_abort_if_not(signed_short_int_Array_0[0][1] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L98] RET assume_abort_if_not(signed_short_int_Array_0[0][1] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L99] unsigned_short_int_Array_0[1] = __VERIFIER_nondet_ushort() [L100] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] RET assume_abort_if_not(unsigned_short_int_Array_0[1] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] RET assume_abort_if_not(unsigned_short_int_Array_0[1] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L115] RET updateVariables() [L116] CALL step() [L44] COND FALSE !(\read(last_1_BOOL_unsigned_char_Array_0_0_)) [L47] EXPR signed_short_int_Array_0[1][0] [L47] EXPR signed_short_int_Array_0[0][0] [L47] signed_short_int_Array_0[1][1] = ((signed_short_int_Array_0[1][0] + 16) - signed_short_int_Array_0[0][0]) [L49] EXPR float_Array_0[0] [L49] EXPR float_Array_0[1] [L49] EXPR float_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L49] COND TRUE (float_Array_0[0] / float_Array_0[1]) <= float_Array_0[2] [L50] EXPR double_Array_0[0] [L50] EXPR float_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L50] COND TRUE (double_Array_0[0] - 2.3) > float_Array_0[1] [L51] EXPR unsigned_short_int_Array_0[1] [L51] EXPR signed_short_int_Array_0[1][0] [L51] unsigned_short_int_Array_0[0] = (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[1][0]) [L58] EXPR signed_short_int_Array_0[1][1] [L58] EXPR unsigned_short_int_Array_0[0] [L58] EXPR (signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L58] EXPR (signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4] [L58] EXPR BOOL_unsigned_char_Array_0[4] [L58] EXPR (signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L58] ((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L58] ((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3] [L58] EXPR BOOL_unsigned_char_Array_0[3] [L58] ((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L58] COND TRUE ((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3] [L59] EXPR BOOL_unsigned_char_Array_0[1] [L59] BOOL_unsigned_char_Array_0[0] = (! BOOL_unsigned_char_Array_0[1]) [L63] EXPR BOOL_unsigned_char_Array_0[0] [L63] unsigned char stepLocal_0 = BOOL_unsigned_char_Array_0[0]; [L64] stepLocal_0 && BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, stepLocal_0=0, unsigned_short_int_Array_0={9:0}] [L64] stepLocal_0 && BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L64] COND FALSE !(stepLocal_0 && BOOL_unsigned_char_Array_0[0]) [L116] RET step() [L117] CALL, EXPR property() [L107] EXPR BOOL_unsigned_char_Array_0[0] [L107] EXPR BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[1][1])) : 1 [L107] EXPR (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[1][1])) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR ((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[1][1])) : 1) && (last_1_BOOL_unsigned_char_Array_0_0_ ? (signed_short_int_Array_0[1][1] == ((signed short int) signed_short_int_Array_0[0][1])) : (signed_short_int_Array_0[1][1] == ((signed short int) ((signed_short_int_Array_0[1][0] + 16) - signed_short_int_Array_0[0][0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR ((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[1][1])) : 1) && (last_1_BOOL_unsigned_char_Array_0_0_ ? (signed_short_int_Array_0[1][1] == ((signed short int) signed_short_int_Array_0[0][1])) : (signed_short_int_Array_0[1][1] == ((signed short int) ((signed_short_int_Array_0[1][0] + 16) - signed_short_int_Array_0[0][0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR last_1_BOOL_unsigned_char_Array_0_0_ ? (signed_short_int_Array_0[1][1] == ((signed short int) signed_short_int_Array_0[0][1])) : (signed_short_int_Array_0[1][1] == ((signed short int) ((signed_short_int_Array_0[1][0] + 16) - signed_short_int_Array_0[0][0]))) [L107] EXPR signed_short_int_Array_0[1][1] [L107] EXPR signed_short_int_Array_0[1][0] [L107] EXPR signed_short_int_Array_0[0][0] [L107] EXPR last_1_BOOL_unsigned_char_Array_0_0_ ? (signed_short_int_Array_0[1][1] == ((signed short int) signed_short_int_Array_0[0][1])) : (signed_short_int_Array_0[1][1] == ((signed short int) ((signed_short_int_Array_0[1][0] + 16) - signed_short_int_Array_0[0][0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR ((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[1][1])) : 1) && (last_1_BOOL_unsigned_char_Array_0_0_ ? (signed_short_int_Array_0[1][1] == ((signed short int) signed_short_int_Array_0[0][1])) : (signed_short_int_Array_0[1][1] == ((signed short int) ((signed_short_int_Array_0[1][0] + 16) - signed_short_int_Array_0[0][0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR (((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[1][1])) : 1) && (last_1_BOOL_unsigned_char_Array_0_0_ ? (signed_short_int_Array_0[1][1] == ((signed short int) signed_short_int_Array_0[0][1])) : (signed_short_int_Array_0[1][1] == ((signed short int) ((signed_short_int_Array_0[1][0] + 16) - signed_short_int_Array_0[0][0]))))) && ((((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR (((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[1][1])) : 1) && (last_1_BOOL_unsigned_char_Array_0_0_ ? (signed_short_int_Array_0[1][1] == ((signed short int) signed_short_int_Array_0[0][1])) : (signed_short_int_Array_0[1][1] == ((signed short int) ((signed_short_int_Array_0[1][0] + 16) - signed_short_int_Array_0[0][0]))))) && ((((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]))))) [L107] EXPR signed_short_int_Array_0[1][1] [L107] EXPR unsigned_short_int_Array_0[0] [L107] EXPR (signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR (signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4] [L107] EXPR BOOL_unsigned_char_Array_0[4] [L107] EXPR (signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR ((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR ((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3] [L107] EXPR BOOL_unsigned_char_Array_0[3] [L107] EXPR ((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR (((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1])))) [L107] EXPR BOOL_unsigned_char_Array_0[0] [L107] EXPR BOOL_unsigned_char_Array_0[1] [L107] EXPR (((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR (((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[1][1])) : 1) && (last_1_BOOL_unsigned_char_Array_0_0_ ? (signed_short_int_Array_0[1][1] == ((signed short int) signed_short_int_Array_0[0][1])) : (signed_short_int_Array_0[1][1] == ((signed short int) ((signed_short_int_Array_0[1][0] + 16) - signed_short_int_Array_0[0][0]))))) && ((((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR ((((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[1][1])) : 1) && (last_1_BOOL_unsigned_char_Array_0_0_ ? (signed_short_int_Array_0[1][1] == ((signed short int) signed_short_int_Array_0[0][1])) : (signed_short_int_Array_0[1][1] == ((signed short int) ((signed_short_int_Array_0[1][0] + 16) - signed_short_int_Array_0[0][0]))))) && ((((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1])))))) && (((float_Array_0[0] / float_Array_0[1]) <= float_Array_0[2]) ? (((double_Array_0[0] - 2.3) > float_Array_0[1]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[1][0]))) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_short_int_Array_0[1][0]) > (((((unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) < 0 ) ? -(unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) : (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]))))) ? (signed_short_int_Array_0[1][0]) : (((((unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) < 0 ) ? -(unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) : (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]))))))))) : (unsigned_short_int_Array_0[0] == ((unsigned short int) signed_short_int_Array_0[0][0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR ((((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[1][1])) : 1) && (last_1_BOOL_unsigned_char_Array_0_0_ ? (signed_short_int_Array_0[1][1] == ((signed short int) signed_short_int_Array_0[0][1])) : (signed_short_int_Array_0[1][1] == ((signed short int) ((signed_short_int_Array_0[1][0] + 16) - signed_short_int_Array_0[0][0]))))) && ((((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1])))))) && (((float_Array_0[0] / float_Array_0[1]) <= float_Array_0[2]) ? (((double_Array_0[0] - 2.3) > float_Array_0[1]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[1][0]))) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_short_int_Array_0[1][0]) > (((((unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) < 0 ) ? -(unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) : (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]))))) ? (signed_short_int_Array_0[1][0]) : (((((unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) < 0 ) ? -(unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) : (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]))))))))) : (unsigned_short_int_Array_0[0] == ((unsigned short int) signed_short_int_Array_0[0][0]))) [L107] EXPR float_Array_0[0] [L107] EXPR float_Array_0[1] [L107] EXPR float_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR ((float_Array_0[0] / float_Array_0[1]) <= float_Array_0[2]) ? (((double_Array_0[0] - 2.3) > float_Array_0[1]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[1][0]))) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_short_int_Array_0[1][0]) > (((((unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) < 0 ) ? -(unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) : (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]))))) ? (signed_short_int_Array_0[1][0]) : (((((unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) < 0 ) ? -(unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) : (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]))))))))) : (unsigned_short_int_Array_0[0] == ((unsigned short int) signed_short_int_Array_0[0][0])) [L107] EXPR unsigned_short_int_Array_0[0] [L107] EXPR signed_short_int_Array_0[0][0] [L107] EXPR ((float_Array_0[0] / float_Array_0[1]) <= float_Array_0[2]) ? (((double_Array_0[0] - 2.3) > float_Array_0[1]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[1][0]))) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_short_int_Array_0[1][0]) > (((((unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) < 0 ) ? -(unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) : (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]))))) ? (signed_short_int_Array_0[1][0]) : (((((unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) < 0 ) ? -(unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) : (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]))))))))) : (unsigned_short_int_Array_0[0] == ((unsigned short int) signed_short_int_Array_0[0][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107] EXPR ((((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[1][1])) : 1) && (last_1_BOOL_unsigned_char_Array_0_0_ ? (signed_short_int_Array_0[1][1] == ((signed short int) signed_short_int_Array_0[0][1])) : (signed_short_int_Array_0[1][1] == ((signed short int) ((signed_short_int_Array_0[1][0] + 16) - signed_short_int_Array_0[0][0]))))) && ((((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1])))))) && (((float_Array_0[0] / float_Array_0[1]) <= float_Array_0[2]) ? (((double_Array_0[0] - 2.3) > float_Array_0[1]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[1][0]))) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_short_int_Array_0[1][0]) > (((((unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) < 0 ) ? -(unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) : (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]))))) ? (signed_short_int_Array_0[1][0]) : (((((unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) < 0 ) ? -(unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) : (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]))))))))) : (unsigned_short_int_Array_0[0] == ((unsigned short int) signed_short_int_Array_0[0][0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L107-L108] return ((((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[1][1])) : 1) && (last_1_BOOL_unsigned_char_Array_0_0_ ? (signed_short_int_Array_0[1][1] == ((signed short int) signed_short_int_Array_0[0][1])) : (signed_short_int_Array_0[1][1] == ((signed short int) ((signed_short_int_Array_0[1][0] + 16) - signed_short_int_Array_0[0][0]))))) && ((((signed_short_int_Array_0[1][1] >= unsigned_short_int_Array_0[0]) && BOOL_unsigned_char_Array_0[4]) && BOOL_unsigned_char_Array_0[3]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1])))))) && (((float_Array_0[0] / float_Array_0[1]) <= float_Array_0[2]) ? (((double_Array_0[0] - 2.3) > float_Array_0[1]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[1][0]))) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_short_int_Array_0[1][0]) > (((((unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) < 0 ) ? -(unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) : (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]))))) ? (signed_short_int_Array_0[1][0]) : (((((unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) < 0 ) ? -(unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]) : (unsigned_short_int_Array_0[1] - signed_short_int_Array_0[0][0]))))))))) : (unsigned_short_int_Array_0[0] == ((unsigned short int) signed_short_int_Array_0[0][0]))) ; [L117] RET, EXPR property() [L117] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0_=0, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 121 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.9s, OverallIterations: 20, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3455 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3447 mSDsluCounter, 15159 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11417 mSDsCounter, 324 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3412 IncrementalHoareTripleChecker+Invalid, 3736 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 324 mSolverCounterUnsat, 3742 mSDtfsCounter, 3412 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1343 GetRequests, 1196 SyntacticMatches, 2 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1139occurred in iteration=16, InterpolantAutomatonStates: 156, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 19 MinimizatonAttempts, 2159 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 3527 NumberOfCodeBlocks, 3527 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 3498 ConstructedInterpolants, 0 QuantifiedInterpolants, 14668 SizeOfPredicates, 7 NumberOfNonLiveVariables, 569 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 21 InterpolantComputations, 18 PerfectInterpolantSequences, 17460/17640 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:40:05,446 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...