/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-63.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 01:47:48,009 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 01:47:48,075 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:47:48,078 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 01:47:48,078 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 01:47:48,105 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 01:47:48,106 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 01:47:48,106 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 01:47:48,107 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 01:47:48,109 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 01:47:48,110 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 01:47:48,110 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 01:47:48,110 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 01:47:48,111 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 01:47:48,111 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 01:47:48,111 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 01:47:48,111 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 01:47:48,112 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 01:47:48,112 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 01:47:48,112 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 01:47:48,112 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 01:47:48,112 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 01:47:48,112 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 01:47:48,113 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 01:47:48,113 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 01:47:48,113 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 01:47:48,113 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 01:47:48,113 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 01:47:48,114 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 01:47:48,114 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 01:47:48,114 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 01:47:48,115 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 01:47:48,115 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 01:47:48,115 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 01:47:48,115 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 01:47:48,115 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 01:47:48,115 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 01:47:48,115 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 01:47:48,115 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 01:47:48,115 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 01:47:48,116 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 01:47:48,116 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 01:47:48,116 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 01:47:48,117 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:47:48,288 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 01:47:48,301 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 01:47:48,303 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 01:47:48,303 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 01:47:48,304 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 01:47:48,304 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-63.i [2023-12-21 01:47:49,250 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 01:47:49,410 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 01:47:49,411 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-63.i [2023-12-21 01:47:49,420 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4728f60e/df515895e7bc4afc9814caa9320bca63/FLAG16523ec08 [2023-12-21 01:47:49,430 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4728f60e/df515895e7bc4afc9814caa9320bca63 [2023-12-21 01:47:49,431 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 01:47:49,432 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 01:47:49,433 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 01:47:49,433 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 01:47:49,437 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 01:47:49,437 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 01:47:49" (1/1) ... [2023-12-21 01:47:49,438 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73095b95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:47:49, skipping insertion in model container [2023-12-21 01:47:49,438 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 01:47:49" (1/1) ... [2023-12-21 01:47:49,463 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 01:47:49,571 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-63.i[916,929] [2023-12-21 01:47:49,621 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 01:47:49,630 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 01:47:49,637 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-63.i[916,929] [2023-12-21 01:47:49,667 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 01:47:49,680 INFO L206 MainTranslator]: Completed translation [2023-12-21 01:47:49,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:47:49 WrapperNode [2023-12-21 01:47:49,680 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 01:47:49,681 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 01:47:49,681 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 01:47:49,681 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 01:47:49,685 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:47:49" (1/1) ... [2023-12-21 01:47:49,702 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:47:49" (1/1) ... [2023-12-21 01:47:49,741 INFO L138 Inliner]: procedures = 29, calls = 209, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 669 [2023-12-21 01:47:49,742 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 01:47:49,742 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 01:47:49,742 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 01:47:49,742 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 01:47:49,754 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:47:49" (1/1) ... [2023-12-21 01:47:49,754 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:47:49" (1/1) ... [2023-12-21 01:47:49,759 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:47:49" (1/1) ... [2023-12-21 01:47:49,790 INFO L175 MemorySlicer]: Split 174 memory accesses to 7 slices as follows [2, 16, 44, 90, 5, 8, 9]. 52 percent of accesses are in the largest equivalence class. The 20 initializations are split as follows [2, 3, 4, 7, 1, 1, 2]. The 19 writes are split as follows [0, 3, 4, 7, 2, 1, 2]. [2023-12-21 01:47:49,790 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:47:49" (1/1) ... [2023-12-21 01:47:49,790 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:47:49" (1/1) ... [2023-12-21 01:47:49,807 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:47:49" (1/1) ... [2023-12-21 01:47:49,811 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:47:49" (1/1) ... [2023-12-21 01:47:49,813 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:47:49" (1/1) ... [2023-12-21 01:47:49,815 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:47:49" (1/1) ... [2023-12-21 01:47:49,819 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 01:47:49,819 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 01:47:49,820 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 01:47:49,820 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 01:47:49,820 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:47:49" (1/1) ... [2023-12-21 01:47:49,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 01:47:49,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 01:47:49,871 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:47:49,888 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:47:49,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 01:47:49,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-21 01:47:49,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-21 01:47:49,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-12-21 01:47:49,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2023-12-21 01:47:49,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2023-12-21 01:47:49,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2023-12-21 01:47:49,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2023-12-21 01:47:49,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-21 01:47:49,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-21 01:47:49,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-21 01:47:49,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-21 01:47:49,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-21 01:47:49,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-12-21 01:47:49,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2023-12-21 01:47:49,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-21 01:47:49,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-21 01:47:49,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-12-21 01:47:49,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2023-12-21 01:47:49,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2023-12-21 01:47:49,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2023-12-21 01:47:49,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2023-12-21 01:47:49,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-21 01:47:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-21 01:47:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-21 01:47:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-21 01:47:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-21 01:47:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-12-21 01:47:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2023-12-21 01:47:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-21 01:47:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-21 01:47:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-12-21 01:47:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2023-12-21 01:47:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2023-12-21 01:47:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2023-12-21 01:47:49,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2023-12-21 01:47:49,896 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-21 01:47:49,896 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-21 01:47:49,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 01:47:49,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-21 01:47:49,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-21 01:47:49,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-21 01:47:49,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-21 01:47:49,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-12-21 01:47:49,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-12-21 01:47:49,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 01:47:49,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 01:47:50,019 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 01:47:50,021 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 01:47:50,449 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 01:47:50,471 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 01:47:50,471 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-21 01:47:50,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 01:47:50 BoogieIcfgContainer [2023-12-21 01:47:50,471 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 01:47:50,473 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 01:47:50,473 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 01:47:50,475 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 01:47:50,475 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 01:47:49" (1/3) ... [2023-12-21 01:47:50,476 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75d0632c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 01:47:50, skipping insertion in model container [2023-12-21 01:47:50,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:47:49" (2/3) ... [2023-12-21 01:47:50,481 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75d0632c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 01:47:50, skipping insertion in model container [2023-12-21 01:47:50,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 01:47:50" (3/3) ... [2023-12-21 01:47:50,482 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-63.i [2023-12-21 01:47:50,494 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 01:47:50,494 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 01:47:50,527 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 01:47:50,531 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;@6221f4a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 01:47:50,531 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 01:47:50,534 INFO L276 IsEmpty]: Start isEmpty. Operand has 132 states, 111 states have (on average 1.4594594594594594) internal successors, (162), 112 states have internal predecessors, (162), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-21 01:47:50,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-12-21 01:47:50,547 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:47:50,547 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:50,547 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:47:50,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:47:50,551 INFO L85 PathProgramCache]: Analyzing trace with hash 844108038, now seen corresponding path program 1 times [2023-12-21 01:47:50,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:47:50,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353936178] [2023-12-21 01:47:50,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:50,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:47:50,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:50,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:47:50,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:50,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:47:50,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:50,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:47:50,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:50,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:47:50,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:50,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:47:50,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:50,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:47:50,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:50,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:47:50,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:50,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:47:50,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:50,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:47:50,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:50,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:47:50,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:50,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:47:50,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:50,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:47:50,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:50,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:47:50,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:50,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:47:50,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:50,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:47:50,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:50,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 01:47:50,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:50,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-21 01:47:50,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:50,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-21 01:47:50,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:50,900 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-21 01:47:50,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:47:50,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353936178] [2023-12-21 01:47:50,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353936178] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:47:50,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:47:50,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 01:47:50,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610838964] [2023-12-21 01:47:50,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:47:50,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 01:47:50,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:47:50,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 01:47:50,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 01:47:50,936 INFO L87 Difference]: Start difference. First operand has 132 states, 111 states have (on average 1.4594594594594594) internal successors, (162), 112 states have internal predecessors, (162), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-21 01:47:50,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:47:50,976 INFO L93 Difference]: Finished difference Result 261 states and 412 transitions. [2023-12-21 01:47:50,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 01:47:50,978 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 151 [2023-12-21 01:47:50,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:47:50,984 INFO L225 Difference]: With dead ends: 261 [2023-12-21 01:47:50,984 INFO L226 Difference]: Without dead ends: 130 [2023-12-21 01:47:50,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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:47:50,989 INFO L413 NwaCegarLoop]: 189 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, 189 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:47:50,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 189 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:47:51,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-12-21 01:47:51,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2023-12-21 01:47:51,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 110 states have (on average 1.4272727272727272) internal successors, (157), 110 states have internal predecessors, (157), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-21 01:47:51,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 193 transitions. [2023-12-21 01:47:51,047 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 193 transitions. Word has length 151 [2023-12-21 01:47:51,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:47:51,047 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 193 transitions. [2023-12-21 01:47:51,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-21 01:47:51,047 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 193 transitions. [2023-12-21 01:47:51,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-12-21 01:47:51,050 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:47:51,050 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:51,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 01:47:51,050 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:47:51,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:47:51,051 INFO L85 PathProgramCache]: Analyzing trace with hash -869170398, now seen corresponding path program 1 times [2023-12-21 01:47:51,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:47:51,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659369464] [2023-12-21 01:47:51,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:51,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:47:51,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:47:51,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:47:51,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:47:51,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:47:51,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:47:51,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:47:51,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:47:51,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:47:51,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:47:51,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:47:51,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:47:51,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:47:51,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:47:51,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:47:51,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:47:51,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 01:47:51,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-21 01:47:51,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-21 01:47:51,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,315 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-21 01:47:51,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:47:51,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659369464] [2023-12-21 01:47:51,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659369464] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:47:51,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:47:51,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 01:47:51,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791452641] [2023-12-21 01:47:51,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:47:51,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 01:47:51,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:47:51,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 01:47:51,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 01:47:51,326 INFO L87 Difference]: Start difference. First operand 130 states and 193 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-21 01:47:51,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:47:51,404 INFO L93 Difference]: Finished difference Result 265 states and 394 transitions. [2023-12-21 01:47:51,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 01:47:51,405 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 151 [2023-12-21 01:47:51,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:47:51,406 INFO L225 Difference]: With dead ends: 265 [2023-12-21 01:47:51,406 INFO L226 Difference]: Without dead ends: 136 [2023-12-21 01:47:51,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 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:47:51,407 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 10 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 559 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.1s IncrementalHoareTripleChecker+Time [2023-12-21 01:47:51,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 559 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 01:47:51,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-12-21 01:47:51,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 132. [2023-12-21 01:47:51,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 112 states have (on average 1.4196428571428572) internal successors, (159), 112 states have internal predecessors, (159), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-21 01:47:51,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 195 transitions. [2023-12-21 01:47:51,415 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 195 transitions. Word has length 151 [2023-12-21 01:47:51,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:47:51,416 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 195 transitions. [2023-12-21 01:47:51,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-21 01:47:51,416 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 195 transitions. [2023-12-21 01:47:51,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-12-21 01:47:51,418 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:47:51,423 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:51,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 01:47:51,423 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:47:51,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:47:51,424 INFO L85 PathProgramCache]: Analyzing trace with hash -938818272, now seen corresponding path program 1 times [2023-12-21 01:47:51,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:47:51,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602177924] [2023-12-21 01:47:51,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:51,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:47:51,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:47:51,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:47:51,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:47:51,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:47:51,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:47:51,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:47:51,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:47:51,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:47:51,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:47:51,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:47:51,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:47:51,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:47:51,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:47:51,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:47:51,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:47:51,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 01:47:51,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-21 01:47:51,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-21 01:47:51,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,664 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-21 01:47:51,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:47:51,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602177924] [2023-12-21 01:47:51,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602177924] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:47:51,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:47:51,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 01:47:51,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691179031] [2023-12-21 01:47:51,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:47:51,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 01:47:51,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:47:51,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 01:47:51,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 01:47:51,675 INFO L87 Difference]: Start difference. First operand 132 states and 195 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-21 01:47:51,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:47:51,714 INFO L93 Difference]: Finished difference Result 296 states and 439 transitions. [2023-12-21 01:47:51,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 01:47:51,715 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 151 [2023-12-21 01:47:51,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:47:51,725 INFO L225 Difference]: With dead ends: 296 [2023-12-21 01:47:51,725 INFO L226 Difference]: Without dead ends: 165 [2023-12-21 01:47:51,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 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:47:51,731 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 87 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:47:51,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 587 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:47:51,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2023-12-21 01:47:51,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 134. [2023-12-21 01:47:51,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 114 states have (on average 1.412280701754386) internal successors, (161), 114 states have internal predecessors, (161), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-21 01:47:51,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 197 transitions. [2023-12-21 01:47:51,744 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 197 transitions. Word has length 151 [2023-12-21 01:47:51,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:47:51,744 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 197 transitions. [2023-12-21 01:47:51,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-21 01:47:51,745 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 197 transitions. [2023-12-21 01:47:51,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-12-21 01:47:51,746 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:47:51,746 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:51,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-21 01:47:51,746 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:47:51,747 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:47:51,747 INFO L85 PathProgramCache]: Analyzing trace with hash 64860805, now seen corresponding path program 1 times [2023-12-21 01:47:51,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:47:51,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80111603] [2023-12-21 01:47:51,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:51,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:47:51,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:47:51,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:47:51,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:47:51,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:47:51,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:47:51,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:47:51,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:47:51,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:47:51,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:47:51,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:47:51,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:47:51,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:47:51,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:47:51,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:47:51,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:47:51,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 01:47:51,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-21 01:47:51,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-21 01:47:51,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,914 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-21 01:47:51,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:47:51,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80111603] [2023-12-21 01:47:51,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80111603] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:47:51,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:47:51,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 01:47:51,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738148238] [2023-12-21 01:47:51,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:47:51,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 01:47:51,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:47:51,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 01:47:51,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 01:47:51,917 INFO L87 Difference]: Start difference. First operand 134 states and 197 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-21 01:47:51,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:47:51,953 INFO L93 Difference]: Finished difference Result 301 states and 444 transitions. [2023-12-21 01:47:51,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 01:47:51,953 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 153 [2023-12-21 01:47:51,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:47:51,956 INFO L225 Difference]: With dead ends: 301 [2023-12-21 01:47:51,956 INFO L226 Difference]: Without dead ends: 168 [2023-12-21 01:47:51,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 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:47:51,963 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 72 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:47:51,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 575 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:47:51,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2023-12-21 01:47:51,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 136. [2023-12-21 01:47:51,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 116 states have (on average 1.4051724137931034) internal successors, (163), 116 states have internal predecessors, (163), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-21 01:47:51,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 199 transitions. [2023-12-21 01:47:51,975 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 199 transitions. Word has length 153 [2023-12-21 01:47:51,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:47:51,976 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 199 transitions. [2023-12-21 01:47:51,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-21 01:47:51,976 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 199 transitions. [2023-12-21 01:47:51,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-12-21 01:47:51,977 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:47:51,977 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:51,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-21 01:47:51,978 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:47:51,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:47:51,978 INFO L85 PathProgramCache]: Analyzing trace with hash 323026243, now seen corresponding path program 1 times [2023-12-21 01:47:51,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:47:51,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184691218] [2023-12-21 01:47:51,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:51,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:47:52,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:47:52,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:47:52,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:47:52,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:47:52,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:47:52,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:47:52,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:47:52,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:47:52,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:47:52,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:47:52,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:47:52,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:47:52,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:47:52,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:47:52,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:47:52,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 01:47:52,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-21 01:47:52,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-21 01:47:52,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,131 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-21 01:47:52,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:47:52,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184691218] [2023-12-21 01:47:52,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184691218] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:47:52,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:47:52,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 01:47:52,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573764539] [2023-12-21 01:47:52,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:47:52,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 01:47:52,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:47:52,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 01:47:52,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 01:47:52,133 INFO L87 Difference]: Start difference. First operand 136 states and 199 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-21 01:47:52,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:47:52,166 INFO L93 Difference]: Finished difference Result 283 states and 414 transitions. [2023-12-21 01:47:52,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 01:47:52,166 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 153 [2023-12-21 01:47:52,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:47:52,167 INFO L225 Difference]: With dead ends: 283 [2023-12-21 01:47:52,167 INFO L226 Difference]: Without dead ends: 148 [2023-12-21 01:47:52,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 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:47:52,168 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 21 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:47:52,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 558 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:47:52,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2023-12-21 01:47:52,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 138. [2023-12-21 01:47:52,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 118 states have (on average 1.3983050847457628) internal successors, (165), 118 states have internal predecessors, (165), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-21 01:47:52,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 201 transitions. [2023-12-21 01:47:52,176 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 201 transitions. Word has length 153 [2023-12-21 01:47:52,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:47:52,177 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 201 transitions. [2023-12-21 01:47:52,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-21 01:47:52,177 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 201 transitions. [2023-12-21 01:47:52,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-12-21 01:47:52,179 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:47:52,179 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:52,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-21 01:47:52,180 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:47:52,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:47:52,180 INFO L85 PathProgramCache]: Analyzing trace with hash -486320383, now seen corresponding path program 1 times [2023-12-21 01:47:52,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:47:52,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148668790] [2023-12-21 01:47:52,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:52,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:47:52,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:47:52,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:47:52,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:47:52,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:47:52,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:47:52,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:47:52,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:47:52,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:47:52,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:47:52,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:47:52,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:47:52,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:47:52,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:47:52,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:47:52,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:47:52,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 01:47:52,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-21 01:47:52,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-21 01:47:52,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,299 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-21 01:47:52,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:47:52,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148668790] [2023-12-21 01:47:52,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148668790] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:47:52,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:47:52,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 01:47:52,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273443373] [2023-12-21 01:47:52,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:47:52,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 01:47:52,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:47:52,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 01:47:52,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 01:47:52,302 INFO L87 Difference]: Start difference. First operand 138 states and 201 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-21 01:47:52,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:47:52,332 INFO L93 Difference]: Finished difference Result 283 states and 412 transitions. [2023-12-21 01:47:52,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 01:47:52,333 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 153 [2023-12-21 01:47:52,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:47:52,334 INFO L225 Difference]: With dead ends: 283 [2023-12-21 01:47:52,334 INFO L226 Difference]: Without dead ends: 146 [2023-12-21 01:47:52,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 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:47:52,335 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 12 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 556 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:47:52,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 556 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:47:52,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-12-21 01:47:52,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 140. [2023-12-21 01:47:52,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 120 states have (on average 1.3916666666666666) internal successors, (167), 120 states have internal predecessors, (167), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-21 01:47:52,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 203 transitions. [2023-12-21 01:47:52,340 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 203 transitions. Word has length 153 [2023-12-21 01:47:52,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:47:52,341 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 203 transitions. [2023-12-21 01:47:52,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-21 01:47:52,341 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 203 transitions. [2023-12-21 01:47:52,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-12-21 01:47:52,342 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:47:52,342 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:52,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-21 01:47:52,342 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:47:52,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:47:52,342 INFO L85 PathProgramCache]: Analyzing trace with hash -429062081, now seen corresponding path program 1 times [2023-12-21 01:47:52,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:47:52,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814973581] [2023-12-21 01:47:52,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:52,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:47:52,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:47:52,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:47:52,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:47:52,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:47:52,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:47:52,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:47:52,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:47:52,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:47:52,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:47:52,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:47:52,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:47:52,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:47:52,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:47:52,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:47:52,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:47:52,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 01:47:52,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-21 01:47:52,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-21 01:47:52,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,469 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-21 01:47:52,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:47:52,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814973581] [2023-12-21 01:47:52,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814973581] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:47:52,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:47:52,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 01:47:52,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252823128] [2023-12-21 01:47:52,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:47:52,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 01:47:52,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:47:52,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 01:47:52,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 01:47:52,470 INFO L87 Difference]: Start difference. First operand 140 states and 203 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-21 01:47:52,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:47:52,495 INFO L93 Difference]: Finished difference Result 283 states and 410 transitions. [2023-12-21 01:47:52,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 01:47:52,495 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 153 [2023-12-21 01:47:52,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:47:52,496 INFO L225 Difference]: With dead ends: 283 [2023-12-21 01:47:52,496 INFO L226 Difference]: Without dead ends: 144 [2023-12-21 01:47:52,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 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:47:52,497 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 3 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:47:52,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 556 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:47:52,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-12-21 01:47:52,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2023-12-21 01:47:52,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 122 states have (on average 1.3852459016393444) internal successors, (169), 122 states have internal predecessors, (169), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-21 01:47:52,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 205 transitions. [2023-12-21 01:47:52,502 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 205 transitions. Word has length 153 [2023-12-21 01:47:52,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:47:52,503 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 205 transitions. [2023-12-21 01:47:52,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-21 01:47:52,503 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 205 transitions. [2023-12-21 01:47:52,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-12-21 01:47:52,504 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:47:52,504 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:52,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-21 01:47:52,505 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:47:52,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:47:52,505 INFO L85 PathProgramCache]: Analyzing trace with hash -429002499, now seen corresponding path program 1 times [2023-12-21 01:47:52,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:47:52,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40800381] [2023-12-21 01:47:52,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:52,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:47:52,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:53,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:47:53,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:53,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:47:53,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:53,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:47:53,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:53,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:47:53,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:53,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:47:53,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:53,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:47:53,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:53,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:47:53,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:53,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:47:53,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:53,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:47:53,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:53,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:47:53,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:53,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:47:53,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:53,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:47:53,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:53,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:47:53,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:53,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:47:53,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:53,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:47:53,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:53,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 01:47:53,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:53,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-21 01:47:53,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:53,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-21 01:47:53,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:53,248 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 3 proven. 48 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-12-21 01:47:53,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:47:53,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40800381] [2023-12-21 01:47:53,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40800381] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 01:47:53,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892751882] [2023-12-21 01:47:53,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:53,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 01:47:53,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 01:47:53,266 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:47:53,269 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:47:53,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:53,492 INFO L262 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-21 01:47:53,513 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 01:47:53,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2023-12-21 01:47:53,826 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 01:47:53,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 26 [2023-12-21 01:47:53,832 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 83 proven. 48 refuted. 0 times theorem prover too weak. 481 trivial. 0 not checked. [2023-12-21 01:47:53,832 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 01:47:54,076 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 3 proven. 48 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-12-21 01:47:54,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892751882] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 01:47:54,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 01:47:54,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 16 [2023-12-21 01:47:54,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917979265] [2023-12-21 01:47:54,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 01:47:54,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-21 01:47:54,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:47:54,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-21 01:47:54,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2023-12-21 01:47:54,078 INFO L87 Difference]: Start difference. First operand 142 states and 205 transitions. Second operand has 16 states, 13 states have (on average 10.23076923076923) internal successors, (133), 16 states have internal predecessors, (133), 7 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (53), 4 states have call predecessors, (53), 7 states have call successors, (53) [2023-12-21 01:47:54,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:47:54,596 INFO L93 Difference]: Finished difference Result 328 states and 469 transitions. [2023-12-21 01:47:54,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-21 01:47:54,596 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 10.23076923076923) internal successors, (133), 16 states have internal predecessors, (133), 7 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (53), 4 states have call predecessors, (53), 7 states have call successors, (53) Word has length 153 [2023-12-21 01:47:54,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:47:54,597 INFO L225 Difference]: With dead ends: 328 [2023-12-21 01:47:54,598 INFO L226 Difference]: Without dead ends: 187 [2023-12-21 01:47:54,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 334 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=179, Invalid=523, Unknown=0, NotChecked=0, Total=702 [2023-12-21 01:47:54,599 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 755 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 756 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 01:47:54,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [756 Valid, 657 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 01:47:54,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2023-12-21 01:47:54,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 146. [2023-12-21 01:47:54,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 125 states have (on average 1.368) internal successors, (171), 125 states have internal predecessors, (171), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-21 01:47:54,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 207 transitions. [2023-12-21 01:47:54,606 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 207 transitions. Word has length 153 [2023-12-21 01:47:54,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:47:54,606 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 207 transitions. [2023-12-21 01:47:54,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 10.23076923076923) internal successors, (133), 16 states have internal predecessors, (133), 7 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (53), 4 states have call predecessors, (53), 7 states have call successors, (53) [2023-12-21 01:47:54,607 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 207 transitions. [2023-12-21 01:47:54,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-12-21 01:47:54,608 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:47:54,608 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:54,619 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:47:54,816 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:47:54,816 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:47:54,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:47:54,817 INFO L85 PathProgramCache]: Analyzing trace with hash -2017350401, now seen corresponding path program 1 times [2023-12-21 01:47:54,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:47:54,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739604425] [2023-12-21 01:47:54,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:54,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:47:54,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:55,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:47:55,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:55,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:47:55,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:55,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:47:55,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:55,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:47:55,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:55,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:47:55,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:55,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:47:55,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:55,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:47:55,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:55,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:47:55,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:55,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:47:55,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:55,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:47:55,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:55,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:47:55,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:55,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:47:55,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:55,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:47:55,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:55,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:47:55,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:55,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:47:55,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:55,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 01:47:55,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:55,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-21 01:47:55,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:55,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-21 01:47:55,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:55,198 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-21 01:47:55,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:47:55,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739604425] [2023-12-21 01:47:55,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739604425] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:47:55,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:47:55,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-21 01:47:55,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806346009] [2023-12-21 01:47:55,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:47:55,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 01:47:55,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:47:55,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 01:47:55,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-21 01:47:55,200 INFO L87 Difference]: Start difference. First operand 146 states and 207 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-21 01:47:55,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:47:55,299 INFO L93 Difference]: Finished difference Result 508 states and 723 transitions. [2023-12-21 01:47:55,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-21 01:47:55,300 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 153 [2023-12-21 01:47:55,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:47:55,301 INFO L225 Difference]: With dead ends: 508 [2023-12-21 01:47:55,301 INFO L226 Difference]: Without dead ends: 363 [2023-12-21 01:47:55,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2023-12-21 01:47:55,302 INFO L413 NwaCegarLoop]: 224 mSDtfsCounter, 331 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 1142 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:47:55,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 1142 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:47:55,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2023-12-21 01:47:55,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 283. [2023-12-21 01:47:55,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 242 states have (on average 1.371900826446281) internal successors, (332), 242 states have internal predecessors, (332), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-21 01:47:55,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 404 transitions. [2023-12-21 01:47:55,317 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 404 transitions. Word has length 153 [2023-12-21 01:47:55,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:47:55,318 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 404 transitions. [2023-12-21 01:47:55,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-21 01:47:55,318 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 404 transitions. [2023-12-21 01:47:55,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-21 01:47:55,319 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:47:55,319 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:55,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-21 01:47:55,319 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:47:55,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:47:55,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1937871142, now seen corresponding path program 1 times [2023-12-21 01:47:55,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:47:55,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517274157] [2023-12-21 01:47:55,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:55,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:47:55,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:55,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:47:55,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:55,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:47:55,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:55,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:47:55,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:55,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:47:55,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:55,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:47:55,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:55,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:47:55,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:55,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:47:55,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:55,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:47:55,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:55,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:47:55,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:55,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:47:55,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:55,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:47:55,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:55,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:47:55,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:55,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:47:55,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:55,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:47:55,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:55,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:47:55,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:55,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 01:47:55,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:55,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-21 01:47:55,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:55,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-21 01:47:55,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:55,763 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-21 01:47:55,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:47:55,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517274157] [2023-12-21 01:47:55,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517274157] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:47:55,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:47:55,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 01:47:55,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126455823] [2023-12-21 01:47:55,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:47:55,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 01:47:55,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:47:55,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 01:47:55,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 01:47:55,765 INFO L87 Difference]: Start difference. First operand 283 states and 404 transitions. Second operand has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-21 01:47:55,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:47:55,886 INFO L93 Difference]: Finished difference Result 672 states and 955 transitions. [2023-12-21 01:47:55,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 01:47:55,887 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 155 [2023-12-21 01:47:55,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:47:55,891 INFO L225 Difference]: With dead ends: 672 [2023-12-21 01:47:55,891 INFO L226 Difference]: Without dead ends: 390 [2023-12-21 01:47:55,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-12-21 01:47:55,892 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 222 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 01:47:55,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 1117 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 01:47:55,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2023-12-21 01:47:55,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 353. [2023-12-21 01:47:55,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 293 states have (on average 1.348122866894198) internal successors, (395), 294 states have internal predecessors, (395), 52 states have call successors, (52), 7 states have call predecessors, (52), 7 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2023-12-21 01:47:55,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 499 transitions. [2023-12-21 01:47:55,919 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 499 transitions. Word has length 155 [2023-12-21 01:47:55,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:47:55,919 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 499 transitions. [2023-12-21 01:47:55,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-21 01:47:55,919 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 499 transitions. [2023-12-21 01:47:55,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-21 01:47:55,920 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:47:55,920 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:55,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-21 01:47:55,921 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:47:55,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:47:55,921 INFO L85 PathProgramCache]: Analyzing trace with hash -2098930716, now seen corresponding path program 1 times [2023-12-21 01:47:55,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:47:55,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765587094] [2023-12-21 01:47:55,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:55,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:47:55,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:56,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:47:56,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:56,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:47:56,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:56,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:47:56,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:56,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:47:56,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:56,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:47:56,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:56,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:47:56,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:56,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:47:56,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:56,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:47:56,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:56,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:47:56,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:56,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:47:56,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:56,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:47:56,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:56,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:47:56,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:56,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:47:56,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:56,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:47:56,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:56,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:47:56,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:56,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 01:47:56,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:56,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-21 01:47:56,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:56,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-21 01:47:56,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:56,168 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-21 01:47:56,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:47:56,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765587094] [2023-12-21 01:47:56,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765587094] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:47:56,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:47:56,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 01:47:56,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472360488] [2023-12-21 01:47:56,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:47:56,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 01:47:56,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:47:56,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 01:47:56,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 01:47:56,169 INFO L87 Difference]: Start difference. First operand 353 states and 499 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-21 01:47:56,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:47:56,347 INFO L93 Difference]: Finished difference Result 939 states and 1312 transitions. [2023-12-21 01:47:56,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 01:47:56,348 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 155 [2023-12-21 01:47:56,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:47:56,352 INFO L225 Difference]: With dead ends: 939 [2023-12-21 01:47:56,352 INFO L226 Difference]: Without dead ends: 645 [2023-12-21 01:47:56,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-21 01:47:56,353 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 244 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 1099 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 01:47:56,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 1099 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 01:47:56,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2023-12-21 01:47:56,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 491. [2023-12-21 01:47:56,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 410 states have (on average 1.3365853658536586) internal successors, (548), 412 states have internal predecessors, (548), 70 states have call successors, (70), 10 states have call predecessors, (70), 10 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2023-12-21 01:47:56,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 688 transitions. [2023-12-21 01:47:56,388 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 688 transitions. Word has length 155 [2023-12-21 01:47:56,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:47:56,388 INFO L495 AbstractCegarLoop]: Abstraction has 491 states and 688 transitions. [2023-12-21 01:47:56,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-21 01:47:56,388 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 688 transitions. [2023-12-21 01:47:56,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-21 01:47:56,390 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:47:56,390 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:56,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-21 01:47:56,390 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:47:56,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:47:56,390 INFO L85 PathProgramCache]: Analyzing trace with hash -537927686, now seen corresponding path program 1 times [2023-12-21 01:47:56,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:47:56,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622492081] [2023-12-21 01:47:56,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:56,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:47:56,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:56,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:47:56,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:56,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:47:56,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:56,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:47:56,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:56,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:47:56,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:56,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:47:56,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:56,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:47:56,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:56,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:47:56,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:56,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:47:56,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:56,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:47:56,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:56,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:47:56,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:56,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:47:56,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:56,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:47:56,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:56,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:47:56,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:56,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:47:56,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:56,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:47:56,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:56,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 01:47:56,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:56,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-21 01:47:56,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:56,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-21 01:47:56,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:56,946 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-21 01:47:56,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:47:56,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622492081] [2023-12-21 01:47:56,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622492081] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:47:56,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:47:56,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 01:47:56,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797026667] [2023-12-21 01:47:56,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:47:56,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 01:47:56,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:47:56,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 01:47:56,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-21 01:47:56,948 INFO L87 Difference]: Start difference. First operand 491 states and 688 transitions. Second operand has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-21 01:47:57,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:47:57,100 INFO L93 Difference]: Finished difference Result 813 states and 1135 transitions. [2023-12-21 01:47:57,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 01:47:57,101 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 155 [2023-12-21 01:47:57,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:47:57,103 INFO L225 Difference]: With dead ends: 813 [2023-12-21 01:47:57,103 INFO L226 Difference]: Without dead ends: 644 [2023-12-21 01:47:57,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-12-21 01:47:57,105 INFO L413 NwaCegarLoop]: 358 mSDtfsCounter, 168 mSDsluCounter, 1025 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 1383 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 01:47:57,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 1383 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 01:47:57,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2023-12-21 01:47:57,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 520. [2023-12-21 01:47:57,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 439 states have (on average 1.3439635535307517) internal successors, (590), 441 states have internal predecessors, (590), 70 states have call successors, (70), 10 states have call predecessors, (70), 10 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2023-12-21 01:47:57,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 730 transitions. [2023-12-21 01:47:57,138 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 730 transitions. Word has length 155 [2023-12-21 01:47:57,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:47:57,138 INFO L495 AbstractCegarLoop]: Abstraction has 520 states and 730 transitions. [2023-12-21 01:47:57,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-21 01:47:57,138 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 730 transitions. [2023-12-21 01:47:57,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-21 01:47:57,140 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:47:57,140 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:57,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-21 01:47:57,140 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:47:57,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:47:57,141 INFO L85 PathProgramCache]: Analyzing trace with hash -515295432, now seen corresponding path program 1 times [2023-12-21 01:47:57,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:47:57,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039372552] [2023-12-21 01:47:57,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:57,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:47:57,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:57,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:47:57,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:57,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:47:57,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:57,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:47:57,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:57,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:47:57,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:57,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:47:57,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:57,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:47:57,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:57,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:47:57,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:57,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:47:57,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:57,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:47:57,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:57,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:47:57,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:57,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:47:57,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:57,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:47:57,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:57,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:47:57,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:57,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:47:57,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:57,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:47:57,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:57,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 01:47:57,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:57,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-21 01:47:57,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:57,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-21 01:47:57,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:57,575 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-21 01:47:57,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:47:57,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039372552] [2023-12-21 01:47:57,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039372552] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:47:57,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:47:57,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-21 01:47:57,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53201617] [2023-12-21 01:47:57,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:47:57,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 01:47:57,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:47:57,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 01:47:57,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-21 01:47:57,576 INFO L87 Difference]: Start difference. First operand 520 states and 730 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-21 01:47:57,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:47:57,754 INFO L93 Difference]: Finished difference Result 1057 states and 1478 transitions. [2023-12-21 01:47:57,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-21 01:47:57,755 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 155 [2023-12-21 01:47:57,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:47:57,758 INFO L225 Difference]: With dead ends: 1057 [2023-12-21 01:47:57,758 INFO L226 Difference]: Without dead ends: 861 [2023-12-21 01:47:57,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2023-12-21 01:47:57,759 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 381 mSDsluCounter, 1112 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 1335 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 01:47:57,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 1335 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 01:47:57,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2023-12-21 01:47:57,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 677. [2023-12-21 01:47:57,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 575 states have (on average 1.346086956521739) internal successors, (774), 577 states have internal predecessors, (774), 88 states have call successors, (88), 13 states have call predecessors, (88), 13 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2023-12-21 01:47:57,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 950 transitions. [2023-12-21 01:47:57,801 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 950 transitions. Word has length 155 [2023-12-21 01:47:57,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:47:57,802 INFO L495 AbstractCegarLoop]: Abstraction has 677 states and 950 transitions. [2023-12-21 01:47:57,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-21 01:47:57,802 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 950 transitions. [2023-12-21 01:47:57,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-12-21 01:47:57,803 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:47:57,803 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:57,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-21 01:47:57,803 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:47:57,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:47:57,804 INFO L85 PathProgramCache]: Analyzing trace with hash 2017111969, now seen corresponding path program 1 times [2023-12-21 01:47:57,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:47:57,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744032191] [2023-12-21 01:47:57,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:57,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:47:57,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:58,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:47:58,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:58,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:47:58,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:58,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:47:58,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:58,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:47:58,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:58,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:47:58,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:58,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:47:58,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:58,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:47:58,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:58,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:47:58,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:58,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:47:58,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:58,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:47:58,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:58,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:47:58,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:58,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:47:58,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:58,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:47:58,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:58,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:47:58,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:58,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:47:58,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:58,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 01:47:58,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:58,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-21 01:47:58,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:58,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-21 01:47:58,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:58,339 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-21 01:47:58,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:47:58,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744032191] [2023-12-21 01:47:58,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744032191] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:47:58,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:47:58,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 01:47:58,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824420868] [2023-12-21 01:47:58,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:47:58,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 01:47:58,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:47:58,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 01:47:58,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 01:47:58,341 INFO L87 Difference]: Start difference. First operand 677 states and 950 transitions. Second operand has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-21 01:47:58,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:47:58,407 INFO L93 Difference]: Finished difference Result 687 states and 963 transitions. [2023-12-21 01:47:58,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 01:47:58,408 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 158 [2023-12-21 01:47:58,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:47:58,412 INFO L225 Difference]: With dead ends: 687 [2023-12-21 01:47:58,413 INFO L226 Difference]: Without dead ends: 685 [2023-12-21 01:47:58,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-21 01:47:58,414 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 71 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:47:58,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 804 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:47:58,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2023-12-21 01:47:58,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 685. [2023-12-21 01:47:58,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 583 states have (on average 1.3413379073756433) internal successors, (782), 585 states have internal predecessors, (782), 88 states have call successors, (88), 13 states have call predecessors, (88), 13 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2023-12-21 01:47:58,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 958 transitions. [2023-12-21 01:47:58,457 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 958 transitions. Word has length 158 [2023-12-21 01:47:58,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:47:58,457 INFO L495 AbstractCegarLoop]: Abstraction has 685 states and 958 transitions. [2023-12-21 01:47:58,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-21 01:47:58,457 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 958 transitions. [2023-12-21 01:47:58,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-12-21 01:47:58,459 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:47:58,459 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:58,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-21 01:47:58,459 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:47:58,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:47:58,460 INFO L85 PathProgramCache]: Analyzing trace with hash 2017171551, now seen corresponding path program 1 times [2023-12-21 01:47:58,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:47:58,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568996883] [2023-12-21 01:47:58,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:58,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:47:58,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:58,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:47:58,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:58,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:47:58,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:58,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:47:58,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:58,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:47:58,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:58,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:47:58,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:58,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:47:58,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:58,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:47:58,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:58,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:47:58,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:58,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:47:58,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:58,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:47:58,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:58,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:47:58,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:58,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:47:58,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:58,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:47:58,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:58,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:47:58,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:58,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:47:58,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:58,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 01:47:58,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:58,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-21 01:47:58,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:58,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-21 01:47:58,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:58,662 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-21 01:47:58,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:47:58,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568996883] [2023-12-21 01:47:58,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568996883] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:47:58,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:47:58,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 01:47:58,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579795828] [2023-12-21 01:47:58,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:47:58,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 01:47:58,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:47:58,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 01:47:58,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 01:47:58,663 INFO L87 Difference]: Start difference. First operand 685 states and 958 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-21 01:47:58,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:47:58,806 INFO L93 Difference]: Finished difference Result 1331 states and 1845 transitions. [2023-12-21 01:47:58,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 01:47:58,807 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2023-12-21 01:47:58,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:47:58,809 INFO L225 Difference]: With dead ends: 1331 [2023-12-21 01:47:58,809 INFO L226 Difference]: Without dead ends: 705 [2023-12-21 01:47:58,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 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:47:58,812 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 132 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 01:47:58,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 437 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 01:47:58,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2023-12-21 01:47:58,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 705. [2023-12-21 01:47:58,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 598 states have (on average 1.326086956521739) internal successors, (793), 600 states have internal predecessors, (793), 88 states have call successors, (88), 18 states have call predecessors, (88), 18 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2023-12-21 01:47:58,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 969 transitions. [2023-12-21 01:47:58,875 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 969 transitions. Word has length 158 [2023-12-21 01:47:58,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:47:58,876 INFO L495 AbstractCegarLoop]: Abstraction has 705 states and 969 transitions. [2023-12-21 01:47:58,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-21 01:47:58,876 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 969 transitions. [2023-12-21 01:47:58,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-12-21 01:47:58,877 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:47:58,877 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:58,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-21 01:47:58,878 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:47:58,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:47:58,878 INFO L85 PathProgramCache]: Analyzing trace with hash 2074429853, now seen corresponding path program 1 times [2023-12-21 01:47:58,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:47:58,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322661707] [2023-12-21 01:47:58,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:58,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:47:58,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:59,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:47:59,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:59,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:47:59,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:59,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:47:59,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:59,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:47:59,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:59,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:47:59,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:59,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:47:59,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:59,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:47:59,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:59,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:47:59,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:59,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:47:59,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:59,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:47:59,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:59,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:47:59,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:59,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:47:59,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:59,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:47:59,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:59,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:47:59,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:59,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:47:59,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:59,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 01:47:59,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:59,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-21 01:47:59,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:59,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-21 01:47:59,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:59,055 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-21 01:47:59,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:47:59,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322661707] [2023-12-21 01:47:59,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322661707] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:47:59,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:47:59,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 01:47:59,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581970680] [2023-12-21 01:47:59,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:47:59,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 01:47:59,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:47:59,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 01:47:59,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 01:47:59,056 INFO L87 Difference]: Start difference. First operand 705 states and 969 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-21 01:47:59,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:47:59,130 INFO L93 Difference]: Finished difference Result 1347 states and 1849 transitions. [2023-12-21 01:47:59,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 01:47:59,131 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2023-12-21 01:47:59,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:47:59,134 INFO L225 Difference]: With dead ends: 1347 [2023-12-21 01:47:59,134 INFO L226 Difference]: Without dead ends: 705 [2023-12-21 01:47:59,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 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:47:59,137 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 168 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:47:59,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 536 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:47:59,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2023-12-21 01:47:59,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 705. [2023-12-21 01:47:59,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 598 states have (on average 1.3193979933110367) internal successors, (789), 600 states have internal predecessors, (789), 88 states have call successors, (88), 18 states have call predecessors, (88), 18 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2023-12-21 01:47:59,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 965 transitions. [2023-12-21 01:47:59,184 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 965 transitions. Word has length 158 [2023-12-21 01:47:59,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:47:59,184 INFO L495 AbstractCegarLoop]: Abstraction has 705 states and 965 transitions. [2023-12-21 01:47:59,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-21 01:47:59,184 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 965 transitions. [2023-12-21 01:47:59,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-12-21 01:47:59,186 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:47:59,186 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:59,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-21 01:47:59,186 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:47:59,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:47:59,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1265083227, now seen corresponding path program 1 times [2023-12-21 01:47:59,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:47:59,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886958959] [2023-12-21 01:47:59,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:59,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:47:59,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:59,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:47:59,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:59,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:47:59,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:59,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:47:59,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:59,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:47:59,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:59,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:47:59,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:59,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:47:59,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:59,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:47:59,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:59,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:47:59,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:59,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:47:59,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:59,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:47:59,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:59,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:47:59,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:59,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:47:59,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:59,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:47:59,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:59,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:47:59,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:59,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:47:59,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:59,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 01:47:59,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:59,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-21 01:47:59,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:59,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-21 01:47:59,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:59,337 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-21 01:47:59,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:47:59,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886958959] [2023-12-21 01:47:59,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886958959] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:47:59,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:47:59,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 01:47:59,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907789380] [2023-12-21 01:47:59,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:47:59,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 01:47:59,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:47:59,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 01:47:59,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 01:47:59,339 INFO L87 Difference]: Start difference. First operand 705 states and 965 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-21 01:47:59,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:47:59,411 INFO L93 Difference]: Finished difference Result 1379 states and 1877 transitions. [2023-12-21 01:47:59,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 01:47:59,411 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2023-12-21 01:47:59,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:47:59,414 INFO L225 Difference]: With dead ends: 1379 [2023-12-21 01:47:59,414 INFO L226 Difference]: Without dead ends: 737 [2023-12-21 01:47:59,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 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:47:59,415 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 23 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:47:59,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 723 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:47:59,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2023-12-21 01:47:59,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 717. [2023-12-21 01:47:59,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 610 states have (on average 1.3131147540983608) internal successors, (801), 612 states have internal predecessors, (801), 88 states have call successors, (88), 18 states have call predecessors, (88), 18 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2023-12-21 01:47:59,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 977 transitions. [2023-12-21 01:47:59,470 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 977 transitions. Word has length 158 [2023-12-21 01:47:59,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:47:59,471 INFO L495 AbstractCegarLoop]: Abstraction has 717 states and 977 transitions. [2023-12-21 01:47:59,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-21 01:47:59,471 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 977 transitions. [2023-12-21 01:47:59,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-12-21 01:47:59,472 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:47:59,473 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:59,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-21 01:47:59,473 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:47:59,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:47:59,473 INFO L85 PathProgramCache]: Analyzing trace with hash 371209234, now seen corresponding path program 1 times [2023-12-21 01:47:59,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:47:59,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157100063] [2023-12-21 01:47:59,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:59,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:47:59,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 01:47:59,534 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-21 01:47:59,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 01:47:59,656 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-21 01:47:59,657 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-21 01:47:59,658 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 01:47:59,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-21 01:47:59,663 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:47:59,666 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 01:47:59,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 01:47:59 BoogieIcfgContainer [2023-12-21 01:47:59,757 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 01:47:59,758 INFO L158 Benchmark]: Toolchain (without parser) took 10324.71ms. Allocated memory was 379.6MB in the beginning and 729.8MB in the end (delta: 350.2MB). Free memory was 337.6MB in the beginning and 656.4MB in the end (delta: -318.8MB). Peak memory consumption was 32.7MB. Max. memory is 8.0GB. [2023-12-21 01:47:59,758 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 252.7MB. Free memory is still 203.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 01:47:59,758 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.19ms. Allocated memory is still 379.6MB. Free memory was 337.3MB in the beginning and 321.2MB in the end (delta: 16.1MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-21 01:47:59,758 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.73ms. Allocated memory is still 379.6MB. Free memory was 321.2MB in the beginning and 316.6MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-21 01:47:59,759 INFO L158 Benchmark]: Boogie Preprocessor took 76.88ms. Allocated memory is still 379.6MB. Free memory was 316.6MB in the beginning and 310.6MB in the end (delta: 6.1MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2023-12-21 01:47:59,759 INFO L158 Benchmark]: RCFGBuilder took 652.05ms. Allocated memory is still 379.6MB. Free memory was 310.6MB in the beginning and 322.9MB in the end (delta: -12.3MB). Peak memory consumption was 24.7MB. Max. memory is 8.0GB. [2023-12-21 01:47:59,759 INFO L158 Benchmark]: TraceAbstraction took 9283.64ms. Allocated memory was 379.6MB in the beginning and 729.8MB in the end (delta: 350.2MB). Free memory was 321.8MB in the beginning and 656.4MB in the end (delta: -334.5MB). Peak memory consumption was 15.3MB. Max. memory is 8.0GB. [2023-12-21 01:47:59,762 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 252.7MB. Free memory is still 203.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 247.19ms. Allocated memory is still 379.6MB. Free memory was 337.3MB in the beginning and 321.2MB in the end (delta: 16.1MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 60.73ms. Allocated memory is still 379.6MB. Free memory was 321.2MB in the beginning and 316.6MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 76.88ms. Allocated memory is still 379.6MB. Free memory was 316.6MB in the beginning and 310.6MB in the end (delta: 6.1MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * RCFGBuilder took 652.05ms. Allocated memory is still 379.6MB. Free memory was 310.6MB in the beginning and 322.9MB in the end (delta: -12.3MB). Peak memory consumption was 24.7MB. Max. memory is 8.0GB. * TraceAbstraction took 9283.64ms. Allocated memory was 379.6MB in the beginning and 729.8MB in the end (delta: 350.2MB). Free memory was 321.8MB in the beginning and 656.4MB in the end (delta: -334.5MB). Peak memory consumption was 15.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 96. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 0 }; [L25-L27] float float_Array_0[2][2] = { {9.8, 2.25}, {10.3, 8.3} }; [L25-L27] float float_Array_0[2][2] = { {9.8, 2.25}, {10.3, 8.3} }; [L25-L27] float float_Array_0[2][2] = { {9.8, 2.25}, {10.3, 8.3} }; [L25-L27] float float_Array_0[2][2] = { {9.8, 2.25}, {10.3, 8.3} }; [L25-L27] float float_Array_0[2][2] = { {9.8, 2.25}, {10.3, 8.3} }; [L28-L30] signed char signed_char_Array_0[7] = { 32, 16, 16, 25, -10, 1, 0 }; [L28-L30] signed char signed_char_Array_0[7] = { 32, 16, 16, 25, -10, 1, 0 }; [L28-L30] signed char signed_char_Array_0[7] = { 32, 16, 16, 25, -10, 1, 0 }; [L28-L30] signed char signed_char_Array_0[7] = { 32, 16, 16, 25, -10, 1, 0 }; [L28-L30] signed char signed_char_Array_0[7] = { 32, 16, 16, 25, -10, 1, 0 }; [L28-L30] signed char signed_char_Array_0[7] = { 32, 16, 16, 25, -10, 1, 0 }; [L28-L30] signed char signed_char_Array_0[7] = { 32, 16, 16, 25, -10, 1, 0 }; [L28-L30] signed char signed_char_Array_0[7] = { 32, 16, 16, 25, -10, 1, 0 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { 128 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { 128 }; [L34-L36] signed short int signed_short_int_Array_0[1] = { 256 }; [L34-L36] signed short int signed_short_int_Array_0[1] = { 256 }; [L37-L39] unsigned long int unsigned_long_int_Array_0[2] = { 1, 32 }; [L37-L39] unsigned long int unsigned_long_int_Array_0[2] = { 1, 32 }; [L37-L39] unsigned long int unsigned_long_int_Array_0[2] = { 1, 32 }; [L40] signed short int last_1_signed_short_int_Array_0_0_ = 256; [L100] isInitial = 1 [L101] FCALL initially() [L102] COND TRUE 1 [L103] CALL updateLastVariables() [L93] EXPR signed_short_int_Array_0[0] [L93] last_1_signed_short_int_Array_0_0_ = signed_short_int_Array_0[0] [L103] RET updateLastVariables() [L104] CALL updateVariables() [L62] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L63] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L63] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L63] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L64] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L64] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L64] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L65] float_Array_0[0][0] = __VERIFIER_nondet_float() [L66] EXPR float_Array_0[0][0] [L66] EXPR float_Array_0[0][0] >= -922337.2036854776000e+13F && float_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L66] EXPR float_Array_0[0][0] >= -922337.2036854776000e+13F && float_Array_0[0][0] <= -1.0e-20F [L66] EXPR float_Array_0[0][0] [L66] EXPR float_Array_0[0][0] >= -922337.2036854776000e+13F && float_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L66] EXPR (float_Array_0[0][0] >= -922337.2036854776000e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854776000e+12F && float_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L66] EXPR (float_Array_0[0][0] >= -922337.2036854776000e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854776000e+12F && float_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L66] CALL assume_abort_if_not((float_Array_0[0][0] >= -922337.2036854776000e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854776000e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L66] RET assume_abort_if_not((float_Array_0[0][0] >= -922337.2036854776000e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854776000e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L67] float_Array_0[1][0] = __VERIFIER_nondet_float() [L68] EXPR float_Array_0[1][0] [L68] EXPR float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L68] EXPR float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F [L68] EXPR float_Array_0[1][0] [L68] EXPR float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L68] EXPR (float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L68] EXPR (float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L68] CALL assume_abort_if_not((float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L68] RET assume_abort_if_not((float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L69] float_Array_0[0][1] = __VERIFIER_nondet_float() [L70] EXPR float_Array_0[0][1] [L70] EXPR float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L70] EXPR float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F [L70] EXPR float_Array_0[0][1] [L70] EXPR float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L70] EXPR (float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L70] EXPR (float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L70] CALL assume_abort_if_not((float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L70] RET assume_abort_if_not((float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L71] float_Array_0[1][1] = __VERIFIER_nondet_float() [L72] EXPR float_Array_0[1][1] [L72] EXPR float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L72] EXPR float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F [L72] EXPR float_Array_0[1][1] [L72] EXPR float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L72] EXPR (float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 9223372.036854776000e+12F && float_Array_0[1][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L72] EXPR (float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 9223372.036854776000e+12F && float_Array_0[1][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L72] CALL assume_abort_if_not((float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 9223372.036854776000e+12F && float_Array_0[1][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L72] RET assume_abort_if_not((float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 9223372.036854776000e+12F && float_Array_0[1][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L73] signed_char_Array_0[0] = __VERIFIER_nondet_char() [L74] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L74] CALL assume_abort_if_not(signed_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L74] RET assume_abort_if_not(signed_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L75] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L75] CALL assume_abort_if_not(signed_char_Array_0[0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L75] RET assume_abort_if_not(signed_char_Array_0[0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L76] signed_char_Array_0[2] = __VERIFIER_nondet_char() [L77] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L77] CALL assume_abort_if_not(signed_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L77] RET assume_abort_if_not(signed_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L78] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L78] CALL assume_abort_if_not(signed_char_Array_0[2] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L78] RET assume_abort_if_not(signed_char_Array_0[2] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L79] signed_char_Array_0[3] = __VERIFIER_nondet_char() [L80] EXPR signed_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L80] CALL assume_abort_if_not(signed_char_Array_0[3] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L80] RET assume_abort_if_not(signed_char_Array_0[3] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L81] EXPR signed_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L81] CALL assume_abort_if_not(signed_char_Array_0[3] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L81] RET assume_abort_if_not(signed_char_Array_0[3] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L82] signed_char_Array_0[5] = __VERIFIER_nondet_char() [L83] EXPR signed_char_Array_0[5] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L83] CALL assume_abort_if_not(signed_char_Array_0[5] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L83] RET assume_abort_if_not(signed_char_Array_0[5] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L84] EXPR signed_char_Array_0[5] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L84] CALL assume_abort_if_not(signed_char_Array_0[5] <= 31) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L84] RET assume_abort_if_not(signed_char_Array_0[5] <= 31) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L85] signed_char_Array_0[6] = __VERIFIER_nondet_char() [L86] EXPR signed_char_Array_0[6] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L86] CALL assume_abort_if_not(signed_char_Array_0[6] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L86] RET assume_abort_if_not(signed_char_Array_0[6] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L87] EXPR signed_char_Array_0[6] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L87] CALL assume_abort_if_not(signed_char_Array_0[6] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L87] RET assume_abort_if_not(signed_char_Array_0[6] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L88] unsigned_long_int_Array_0[1] = __VERIFIER_nondet_ulong() [L89] EXPR unsigned_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L89] CALL assume_abort_if_not(unsigned_long_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L89] RET assume_abort_if_not(unsigned_long_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L90] EXPR unsigned_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L90] CALL assume_abort_if_not(unsigned_long_int_Array_0[1] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L90] RET assume_abort_if_not(unsigned_long_int_Array_0[1] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L104] RET updateVariables() [L105] CALL step() [L44] EXPR unsigned_long_int_Array_0[1] [L44] unsigned_long_int_Array_0[0] = unsigned_long_int_Array_0[1] [L45] signed_short_int_Array_0[0] = last_1_signed_short_int_Array_0_0_ [L46] EXPR signed_char_Array_0[2] [L46] signed_char_Array_0[1] = signed_char_Array_0[2] [L47] EXPR BOOL_unsigned_char_Array_0[1] [L47] BOOL_unsigned_char_Array_0[0] = BOOL_unsigned_char_Array_0[1] [L48] EXPR float_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L48] EXPR ((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]) [L48] EXPR ((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L48] EXPR float_Array_0[0][1] [L48] EXPR float_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L48] COND FALSE !(((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) [L51] EXPR signed_char_Array_0[1] [L51] signed char stepLocal_0 = signed_char_Array_0[1]; [L52] EXPR signed_char_Array_0[1] [L52] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L52] EXPR ((signed_char_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_char_Array_0[1]) : (signed_short_int_Array_0[0]) [L52] EXPR signed_char_Array_0[1] [L52] EXPR ((signed_char_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_char_Array_0[1]) : (signed_short_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, stepLocal_0=20, unsigned_long_int_Array_0={9:0}] [L52] COND FALSE !(stepLocal_0 != ((((signed_char_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_char_Array_0[1]) : (signed_short_int_Array_0[0])))) [L55] EXPR float_Array_0[1][0] [L55] EXPR float_Array_0[1][1] [L55] EXPR float_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L55] EXPR ((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]) [L55] EXPR float_Array_0[1][1] [L55] EXPR ((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, stepLocal_0=20, unsigned_long_int_Array_0={9:0}] [L55] EXPR float_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L55] COND TRUE float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0]) [L56] EXPR signed_char_Array_0[1] [L56] EXPR signed_char_Array_0[4] [L56] EXPR signed_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L56] EXPR (((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4]) [L56] EXPR signed_char_Array_0[1] [L56] EXPR signed_char_Array_0[4] [L56] EXPR (((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, stepLocal_0=20, unsigned_long_int_Array_0={9:0}] [L56] EXPR signed_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L56] EXPR ((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]) [L56] EXPR signed_char_Array_0[4] [L56] EXPR ((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, stepLocal_0=20, unsigned_long_int_Array_0={9:0}] [L56] EXPR (((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))) [L56] EXPR signed_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L56] EXPR ((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]) [L56] EXPR signed_char_Array_0[4] [L56] EXPR ((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, stepLocal_0=20, unsigned_long_int_Array_0={9:0}] [L56] EXPR (((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, stepLocal_0=20, unsigned_long_int_Array_0={9:0}] [L56] signed_long_int_Array_0[0] = (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))) [L105] RET step() [L106] CALL, EXPR property() [L96] EXPR float_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR ((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]) [L96] EXPR ((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR float_Array_0[0][1] [L96] EXPR float_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR (((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1 [L96] EXPR (((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR ((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR ((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1]))) [L96] EXPR float_Array_0[1][0] [L96] EXPR float_Array_0[1][1] [L96] EXPR float_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR ((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]) [L96] EXPR float_Array_0[1][1] [L96] EXPR ((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR float_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR (float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])) [L96] EXPR signed_long_int_Array_0[0] [L96] EXPR signed_char_Array_0[1] [L96] EXPR (float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR ((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR (((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_long_int_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR (((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_long_int_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR ((((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_long_int_Array_0[1]))) && ((signed_char_Array_0[1] != ((((signed_char_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_char_Array_0[1]) : (signed_short_int_Array_0[0])))) ? (signed_char_Array_0[4] == ((signed char) ((((((10 + signed_char_Array_0[2])) < (signed_char_Array_0[3])) ? ((10 + signed_char_Array_0[2])) : (signed_char_Array_0[3]))) - ((32 - signed_char_Array_0[5]) + ((((signed_char_Array_0[6]) > (signed_char_Array_0[0])) ? (signed_char_Array_0[6]) : (signed_char_Array_0[0]))))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR ((((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_long_int_Array_0[1]))) && ((signed_char_Array_0[1] != ((((signed_char_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_char_Array_0[1]) : (signed_short_int_Array_0[0])))) ? (signed_char_Array_0[4] == ((signed char) ((((((10 + signed_char_Array_0[2])) < (signed_char_Array_0[3])) ? ((10 + signed_char_Array_0[2])) : (signed_char_Array_0[3]))) - ((32 - signed_char_Array_0[5]) + ((((signed_char_Array_0[6]) > (signed_char_Array_0[0])) ? (signed_char_Array_0[6]) : (signed_char_Array_0[0]))))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR (((((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_long_int_Array_0[1]))) && ((signed_char_Array_0[1] != ((((signed_char_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_char_Array_0[1]) : (signed_short_int_Array_0[0])))) ? (signed_char_Array_0[4] == ((signed char) ((((((10 + signed_char_Array_0[2])) < (signed_char_Array_0[3])) ? ((10 + signed_char_Array_0[2])) : (signed_char_Array_0[3]))) - ((32 - signed_char_Array_0[5]) + ((((signed_char_Array_0[6]) > (signed_char_Array_0[0])) ? (signed_char_Array_0[6]) : (signed_char_Array_0[0]))))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) last_1_signed_short_int_Array_0_0_)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR (((((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_long_int_Array_0[1]))) && ((signed_char_Array_0[1] != ((((signed_char_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_char_Array_0[1]) : (signed_short_int_Array_0[0])))) ? (signed_char_Array_0[4] == ((signed char) ((((((10 + signed_char_Array_0[2])) < (signed_char_Array_0[3])) ? ((10 + signed_char_Array_0[2])) : (signed_char_Array_0[3]))) - ((32 - signed_char_Array_0[5]) + ((((signed_char_Array_0[6]) > (signed_char_Array_0[0])) ? (signed_char_Array_0[6]) : (signed_char_Array_0[0]))))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) last_1_signed_short_int_Array_0_0_)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR ((((((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_long_int_Array_0[1]))) && ((signed_char_Array_0[1] != ((((signed_char_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_char_Array_0[1]) : (signed_short_int_Array_0[0])))) ? (signed_char_Array_0[4] == ((signed char) ((((((10 + signed_char_Array_0[2])) < (signed_char_Array_0[3])) ? ((10 + signed_char_Array_0[2])) : (signed_char_Array_0[3]))) - ((32 - signed_char_Array_0[5]) + ((((signed_char_Array_0[6]) > (signed_char_Array_0[0])) ? (signed_char_Array_0[6]) : (signed_char_Array_0[0]))))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) last_1_signed_short_int_Array_0_0_))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[2])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR ((((((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_long_int_Array_0[1]))) && ((signed_char_Array_0[1] != ((((signed_char_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_char_Array_0[1]) : (signed_short_int_Array_0[0])))) ? (signed_char_Array_0[4] == ((signed char) ((((((10 + signed_char_Array_0[2])) < (signed_char_Array_0[3])) ? ((10 + signed_char_Array_0[2])) : (signed_char_Array_0[3]))) - ((32 - signed_char_Array_0[5]) + ((((signed_char_Array_0[6]) > (signed_char_Array_0[0])) ? (signed_char_Array_0[6]) : (signed_char_Array_0[0]))))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) last_1_signed_short_int_Array_0_0_))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[2])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR (((((((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_long_int_Array_0[1]))) && ((signed_char_Array_0[1] != ((((signed_char_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_char_Array_0[1]) : (signed_short_int_Array_0[0])))) ? (signed_char_Array_0[4] == ((signed char) ((((((10 + signed_char_Array_0[2])) < (signed_char_Array_0[3])) ? ((10 + signed_char_Array_0[2])) : (signed_char_Array_0[3]))) - ((32 - signed_char_Array_0[5]) + ((((signed_char_Array_0[6]) > (signed_char_Array_0[0])) ? (signed_char_Array_0[6]) : (signed_char_Array_0[0]))))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) last_1_signed_short_int_Array_0_0_))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[2]))) && (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR (((((((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_long_int_Array_0[1]))) && ((signed_char_Array_0[1] != ((((signed_char_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_char_Array_0[1]) : (signed_short_int_Array_0[0])))) ? (signed_char_Array_0[4] == ((signed char) ((((((10 + signed_char_Array_0[2])) < (signed_char_Array_0[3])) ? ((10 + signed_char_Array_0[2])) : (signed_char_Array_0[3]))) - ((32 - signed_char_Array_0[5]) + ((((signed_char_Array_0[6]) > (signed_char_Array_0[0])) ? (signed_char_Array_0[6]) : (signed_char_Array_0[0]))))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) last_1_signed_short_int_Array_0_0_))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[2]))) && (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96-L97] return (((((((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_long_int_Array_0[1]))) && ((signed_char_Array_0[1] != ((((signed_char_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_char_Array_0[1]) : (signed_short_int_Array_0[0])))) ? (signed_char_Array_0[4] == ((signed char) ((((((10 + signed_char_Array_0[2])) < (signed_char_Array_0[3])) ? ((10 + signed_char_Array_0[2])) : (signed_char_Array_0[3]))) - ((32 - signed_char_Array_0[5]) + ((((signed_char_Array_0[6]) > (signed_char_Array_0[0])) ? (signed_char_Array_0[6]) : (signed_char_Array_0[0]))))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) last_1_signed_short_int_Array_0_0_))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[2]))) && (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])) ; [L106] RET, EXPR property() [L106] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 132 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.1s, OverallIterations: 18, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2705 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2700 mSDsluCounter, 12813 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9346 mSDsCounter, 100 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1774 IncrementalHoareTripleChecker+Invalid, 1874 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 100 mSolverCounterUnsat, 3467 mSDtfsCounter, 1774 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1083 GetRequests, 971 SyntacticMatches, 2 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=717occurred in iteration=17, InterpolantAutomatonStates: 114, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 17 MinimizatonAttempts, 725 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 2938 NumberOfCodeBlocks, 2938 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 2910 ConstructedInterpolants, 0 QuantifiedInterpolants, 8633 SizeOfPredicates, 7 NumberOfNonLiveVariables, 550 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 19 InterpolantComputations, 16 PerfectInterpolantSequences, 11484/11628 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:47:59,786 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...