/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 true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-61.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 21:30:58,685 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 21:30:58,750 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-15 21:30:58,753 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 21:30:58,754 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 21:30:58,782 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 21:30:58,783 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 21:30:58,783 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 21:30:58,784 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 21:30:58,788 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 21:30:58,788 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 21:30:58,788 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 21:30:58,789 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 21:30:58,790 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 21:30:58,790 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 21:30:58,790 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 21:30:58,790 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 21:30:58,790 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 21:30:58,790 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 21:30:58,791 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 21:30:58,791 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 21:30:58,791 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 21:30:58,791 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 21:30:58,791 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 21:30:58,791 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 21:30:58,792 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 21:30:58,792 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 21:30:58,792 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 21:30:58,792 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 21:30:58,792 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 21:30:58,793 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 21:30:58,793 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 21:30:58,793 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:30:58,794 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 21:30:58,794 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 21:30:58,794 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 21:30:58,794 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 21:30:58,794 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 21:30:58,794 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 21:30:58,794 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 21:30:58,794 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 21:30:58,795 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 21:30:58,795 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 21:30:58,795 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 -> true [2023-12-15 21:30:58,988 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 21:30:59,006 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 21:30:59,009 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 21:30:59,009 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 21:30:59,010 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 21:30:59,010 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-61.i [2023-12-15 21:30:59,960 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 21:31:00,124 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 21:31:00,125 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-61.i [2023-12-15 21:31:00,132 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5eeec24fd/b819489839644e65b80ee78b99d4a92a/FLAG9abcaa98d [2023-12-15 21:31:00,143 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5eeec24fd/b819489839644e65b80ee78b99d4a92a [2023-12-15 21:31:00,145 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 21:31:00,146 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 21:31:00,147 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 21:31:00,147 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 21:31:00,150 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 21:31:00,150 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:31:00" (1/1) ... [2023-12-15 21:31:00,151 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7040a4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:31:00, skipping insertion in model container [2023-12-15 21:31:00,151 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:31:00" (1/1) ... [2023-12-15 21:31:00,177 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 21:31:00,297 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-61.i[916,929] [2023-12-15 21:31:00,341 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:31:00,351 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 21:31:00,359 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-61.i[916,929] [2023-12-15 21:31:00,389 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:31:00,401 INFO L206 MainTranslator]: Completed translation [2023-12-15 21:31:00,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:31:00 WrapperNode [2023-12-15 21:31:00,402 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 21:31:00,402 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 21:31:00,402 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 21:31:00,402 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 21:31:00,407 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:31:00" (1/1) ... [2023-12-15 21:31:00,418 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:31:00" (1/1) ... [2023-12-15 21:31:00,449 INFO L138 Inliner]: procedures = 29, calls = 189, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 512 [2023-12-15 21:31:00,450 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 21:31:00,450 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 21:31:00,450 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 21:31:00,450 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 21:31:00,461 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:31:00" (1/1) ... [2023-12-15 21:31:00,461 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:31:00" (1/1) ... [2023-12-15 21:31:00,467 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:31:00" (1/1) ... [2023-12-15 21:31:00,495 INFO L175 MemorySlicer]: Split 147 memory accesses to 7 slices as follows [2, 35, 5, 27, 3, 72, 3]. 49 percent of accesses are in the largest equivalence class. The 22 initializations are split as follows [2, 4, 1, 2, 1, 11, 1]. The 23 writes are split as follows [0, 6, 1, 2, 1, 12, 1]. [2023-12-15 21:31:00,496 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:31:00" (1/1) ... [2023-12-15 21:31:00,496 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:31:00" (1/1) ... [2023-12-15 21:31:00,514 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:31:00" (1/1) ... [2023-12-15 21:31:00,518 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:31:00" (1/1) ... [2023-12-15 21:31:00,521 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:31:00" (1/1) ... [2023-12-15 21:31:00,523 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:31:00" (1/1) ... [2023-12-15 21:31:00,543 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 21:31:00,544 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 21:31:00,544 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 21:31:00,545 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 21:31:00,545 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:31:00" (1/1) ... [2023-12-15 21:31:00,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:31:00,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:31:00,581 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-15 21:31:00,604 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-15 21:31:00,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 21:31:00,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-15 21:31:00,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-15 21:31:00,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-12-15 21:31:00,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2023-12-15 21:31:00,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2023-12-15 21:31:00,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2023-12-15 21:31:00,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2023-12-15 21:31:00,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-15 21:31:00,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-15 21:31:00,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-15 21:31:00,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-15 21:31:00,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-15 21:31:00,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-12-15 21:31:00,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2023-12-15 21:31:00,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-15 21:31:00,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-15 21:31:00,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-12-15 21:31:00,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2023-12-15 21:31:00,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2023-12-15 21:31:00,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2023-12-15 21:31:00,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2023-12-15 21:31:00,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-15 21:31:00,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-15 21:31:00,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-15 21:31:00,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-15 21:31:00,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-15 21:31:00,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-12-15 21:31:00,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2023-12-15 21:31:00,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-15 21:31:00,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-15 21:31:00,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-12-15 21:31:00,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2023-12-15 21:31:00,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2023-12-15 21:31:00,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2023-12-15 21:31:00,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2023-12-15 21:31:00,617 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-15 21:31:00,617 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-15 21:31:00,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 21:31:00,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-15 21:31:00,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-15 21:31:00,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-15 21:31:00,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-15 21:31:00,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-12-15 21:31:00,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-12-15 21:31:00,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 21:31:00,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 21:31:00,770 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 21:31:00,771 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 21:31:01,190 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 21:31:01,217 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 21:31:01,217 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 21:31:01,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:31:01 BoogieIcfgContainer [2023-12-15 21:31:01,217 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 21:31:01,219 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 21:31:01,219 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 21:31:01,222 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 21:31:01,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 09:31:00" (1/3) ... [2023-12-15 21:31:01,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8b036f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:31:01, skipping insertion in model container [2023-12-15 21:31:01,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:31:00" (2/3) ... [2023-12-15 21:31:01,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8b036f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:31:01, skipping insertion in model container [2023-12-15 21:31:01,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:31:01" (3/3) ... [2023-12-15 21:31:01,224 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-61.i [2023-12-15 21:31:01,236 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 21:31:01,236 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 21:31:01,276 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 21:31:01,281 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;@7b3f6543, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 21:31:01,281 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 21:31:01,284 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 85 states have (on average 1.388235294117647) internal successors, (118), 86 states have internal predecessors, (118), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-12-15 21:31:01,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2023-12-15 21:31:01,299 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:01,300 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:31:01,300 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:01,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:01,309 INFO L85 PathProgramCache]: Analyzing trace with hash 2119270199, now seen corresponding path program 1 times [2023-12-15 21:31:01,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:01,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671217641] [2023-12-15 21:31:01,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:01,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:01,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:01,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:01,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:01,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:01,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:01,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:01,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:31:01,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:31:01,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:31:01,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:31:01,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:31:01,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:31:01,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:31:01,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:31:01,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:31:01,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 21:31:01,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 21:31:01,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 21:31:01,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-15 21:31:01,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-15 21:31:01,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-15 21:31:01,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-15 21:31:01,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-15 21:31:01,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-12-15 21:31:01,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2023-12-15 21:31:01,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:01,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-12-15 21:31:01,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:01,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671217641] [2023-12-15 21:31:01,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671217641] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:01,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:01,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 21:31:01,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294889573] [2023-12-15 21:31:01,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:01,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 21:31:01,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:01,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 21:31:01,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 21:31:01,786 INFO L87 Difference]: Start difference. First operand has 113 states, 85 states have (on average 1.388235294117647) internal successors, (118), 86 states have internal predecessors, (118), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2023-12-15 21:31:01,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:01,825 INFO L93 Difference]: Finished difference Result 223 states and 359 transitions. [2023-12-15 21:31:01,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 21:31:01,826 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 185 [2023-12-15 21:31:01,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:01,831 INFO L225 Difference]: With dead ends: 223 [2023-12-15 21:31:01,831 INFO L226 Difference]: Without dead ends: 111 [2023-12-15 21:31:01,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 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-15 21:31:01,836 INFO L413 NwaCegarLoop]: 159 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, 159 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-15 21:31:01,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:31:01,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-12-15 21:31:01,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2023-12-15 21:31:01,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 84 states have (on average 1.3452380952380953) internal successors, (113), 84 states have internal predecessors, (113), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-12-15 21:31:01,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 163 transitions. [2023-12-15 21:31:01,889 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 163 transitions. Word has length 185 [2023-12-15 21:31:01,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:01,889 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 163 transitions. [2023-12-15 21:31:01,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2023-12-15 21:31:01,889 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 163 transitions. [2023-12-15 21:31:01,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2023-12-15 21:31:01,892 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:01,892 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:31:01,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 21:31:01,893 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:01,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:01,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1896348451, now seen corresponding path program 1 times [2023-12-15 21:31:01,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:01,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065377755] [2023-12-15 21:31:01,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:01,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:01,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:02,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:02,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:02,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:02,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:02,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:02,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:31:02,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:31:02,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:31:02,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:31:02,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:31:02,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:31:02,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:31:02,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:31:02,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:31:02,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 21:31:02,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 21:31:02,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 21:31:02,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-15 21:31:02,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-15 21:31:02,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-15 21:31:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-15 21:31:02,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-15 21:31:02,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-12-15 21:31:02,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2023-12-15 21:31:02,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-12-15 21:31:02,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:02,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065377755] [2023-12-15 21:31:02,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065377755] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:02,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:02,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 21:31:02,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319828774] [2023-12-15 21:31:02,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:02,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:31:02,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:02,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:31:02,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:31:02,253 INFO L87 Difference]: Start difference. First operand 111 states and 163 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-15 21:31:02,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:02,321 INFO L93 Difference]: Finished difference Result 233 states and 342 transitions. [2023-12-15 21:31:02,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:31:02,321 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 185 [2023-12-15 21:31:02,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:02,326 INFO L225 Difference]: With dead ends: 233 [2023-12-15 21:31:02,326 INFO L226 Difference]: Without dead ends: 123 [2023-12-15 21:31:02,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 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-15 21:31:02,329 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 21 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 468 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-15 21:31:02,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 468 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:31:02,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-12-15 21:31:02,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 113. [2023-12-15 21:31:02,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 86 states have internal predecessors, (115), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-12-15 21:31:02,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 165 transitions. [2023-12-15 21:31:02,344 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 165 transitions. Word has length 185 [2023-12-15 21:31:02,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:02,346 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 165 transitions. [2023-12-15 21:31:02,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-15 21:31:02,346 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 165 transitions. [2023-12-15 21:31:02,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2023-12-15 21:31:02,351 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:02,351 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:31:02,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 21:31:02,352 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:02,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:02,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1589272219, now seen corresponding path program 1 times [2023-12-15 21:31:02,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:02,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915450114] [2023-12-15 21:31:02,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:02,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:02,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:02,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:02,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:02,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:02,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:02,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:02,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:31:02,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:31:02,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:31:02,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:31:02,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:31:02,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:31:02,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:31:02,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:31:02,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:31:02,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 21:31:02,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 21:31:02,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 21:31:02,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-15 21:31:02,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-15 21:31:02,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-15 21:31:02,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-15 21:31:02,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-15 21:31:02,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-12-15 21:31:02,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2023-12-15 21:31:02,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-12-15 21:31:02,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:02,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915450114] [2023-12-15 21:31:02,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915450114] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:02,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:02,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 21:31:02,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162790513] [2023-12-15 21:31:02,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:02,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:31:02,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:02,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:31:02,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:31:02,568 INFO L87 Difference]: Start difference. First operand 113 states and 165 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-15 21:31:02,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:02,601 INFO L93 Difference]: Finished difference Result 229 states and 334 transitions. [2023-12-15 21:31:02,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:31:02,601 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 185 [2023-12-15 21:31:02,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:02,605 INFO L225 Difference]: With dead ends: 229 [2023-12-15 21:31:02,605 INFO L226 Difference]: Without dead ends: 117 [2023-12-15 21:31:02,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 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-15 21:31:02,609 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 3 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 466 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-15 21:31:02,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 466 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:31:02,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-12-15 21:31:02,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2023-12-15 21:31:02,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 88 states have (on average 1.3295454545454546) internal successors, (117), 88 states have internal predecessors, (117), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-12-15 21:31:02,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 167 transitions. [2023-12-15 21:31:02,625 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 167 transitions. Word has length 185 [2023-12-15 21:31:02,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:02,626 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 167 transitions. [2023-12-15 21:31:02,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-15 21:31:02,626 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 167 transitions. [2023-12-15 21:31:02,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2023-12-15 21:31:02,627 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:02,627 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:31:02,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 21:31:02,628 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:02,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:02,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1589331801, now seen corresponding path program 1 times [2023-12-15 21:31:02,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:02,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611477327] [2023-12-15 21:31:02,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:02,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:02,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:02,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:02,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:02,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:02,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:02,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:02,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:31:02,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:31:02,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:31:02,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:31:02,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:31:02,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:31:02,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:31:02,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:31:02,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:31:02,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 21:31:02,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 21:31:02,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 21:31:02,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-15 21:31:02,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-15 21:31:02,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-15 21:31:02,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-15 21:31:02,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-15 21:31:02,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-12-15 21:31:02,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2023-12-15 21:31:02,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-12-15 21:31:02,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:02,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611477327] [2023-12-15 21:31:02,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611477327] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:02,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:02,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:31:02,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363902746] [2023-12-15 21:31:02,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:02,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:31:02,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:02,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:31:02,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:31:02,999 INFO L87 Difference]: Start difference. First operand 115 states and 167 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-15 21:31:03,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:03,102 INFO L93 Difference]: Finished difference Result 281 states and 408 transitions. [2023-12-15 21:31:03,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:31:03,103 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 185 [2023-12-15 21:31:03,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:03,105 INFO L225 Difference]: With dead ends: 281 [2023-12-15 21:31:03,105 INFO L226 Difference]: Without dead ends: 167 [2023-12-15 21:31:03,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:31:03,110 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 66 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:03,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 551 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:31:03,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-12-15 21:31:03,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 117. [2023-12-15 21:31:03,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 90 states have (on average 1.3222222222222222) internal successors, (119), 90 states have internal predecessors, (119), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-12-15 21:31:03,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 169 transitions. [2023-12-15 21:31:03,126 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 169 transitions. Word has length 185 [2023-12-15 21:31:03,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:03,126 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 169 transitions. [2023-12-15 21:31:03,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-15 21:31:03,126 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 169 transitions. [2023-12-15 21:31:03,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2023-12-15 21:31:03,127 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:03,127 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:31:03,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 21:31:03,128 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:03,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:03,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1079858711, now seen corresponding path program 1 times [2023-12-15 21:31:03,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:03,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864992060] [2023-12-15 21:31:03,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:03,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:03,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:04,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:04,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:04,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:04,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:04,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:04,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:31:04,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:31:04,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:31:04,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:31:04,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:31:04,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:31:04,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:31:04,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:31:04,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:31:04,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 21:31:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 21:31:04,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 21:31:04,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-15 21:31:04,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-15 21:31:04,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-15 21:31:04,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-15 21:31:04,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-15 21:31:04,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-12-15 21:31:04,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2023-12-15 21:31:04,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-12-15 21:31:04,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:04,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864992060] [2023-12-15 21:31:04,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864992060] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:04,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:04,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 21:31:04,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967366703] [2023-12-15 21:31:04,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:04,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 21:31:04,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:04,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 21:31:04,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:31:04,349 INFO L87 Difference]: Start difference. First operand 117 states and 169 transitions. Second operand has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2023-12-15 21:31:04,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:04,558 INFO L93 Difference]: Finished difference Result 314 states and 450 transitions. [2023-12-15 21:31:04,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-15 21:31:04,559 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 185 [2023-12-15 21:31:04,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:04,560 INFO L225 Difference]: With dead ends: 314 [2023-12-15 21:31:04,560 INFO L226 Difference]: Without dead ends: 198 [2023-12-15 21:31:04,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-12-15 21:31:04,560 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 153 mSDsluCounter, 882 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:04,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 1050 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:31:04,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2023-12-15 21:31:04,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 168. [2023-12-15 21:31:04,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 138 states have (on average 1.3478260869565217) internal successors, (186), 139 states have internal predecessors, (186), 27 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-15 21:31:04,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 240 transitions. [2023-12-15 21:31:04,567 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 240 transitions. Word has length 185 [2023-12-15 21:31:04,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:04,568 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 240 transitions. [2023-12-15 21:31:04,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2023-12-15 21:31:04,568 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 240 transitions. [2023-12-15 21:31:04,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2023-12-15 21:31:04,569 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:04,569 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:31:04,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-15 21:31:04,569 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:04,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:04,570 INFO L85 PathProgramCache]: Analyzing trace with hash -508489191, now seen corresponding path program 1 times [2023-12-15 21:31:04,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:04,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845444756] [2023-12-15 21:31:04,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:04,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:04,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:05,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:05,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:05,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:05,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:05,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:05,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:05,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:05,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:05,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:05,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:05,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:05,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:05,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:31:05,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:05,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:31:05,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:05,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:31:05,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:05,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:31:05,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:05,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:31:05,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:05,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:31:05,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:05,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:31:05,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:05,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:31:05,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:05,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:31:05,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:05,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 21:31:05,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:05,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 21:31:05,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:05,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 21:31:05,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:05,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-15 21:31:05,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:05,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-15 21:31:05,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:05,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-12-15 21:31:05,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:05,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-15 21:31:05,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:05,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-15 21:31:05,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:05,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-12-15 21:31:05,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:05,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2023-12-15 21:31:05,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:05,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 21 proven. 117 refuted. 0 times theorem prover too weak. 1062 trivial. 0 not checked. [2023-12-15 21:31:05,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:05,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845444756] [2023-12-15 21:31:05,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845444756] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:31:05,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551170119] [2023-12-15 21:31:05,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:05,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:31:05,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:31:05,520 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-15 21:31:05,526 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-15 21:31:05,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:05,740 INFO L262 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-15 21:31:05,760 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:31:05,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-12-15 21:31:05,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-12-15 21:31:06,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 24 proven. 72 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-12-15 21:31:06,069 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:31:06,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2023-12-15 21:31:06,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551170119] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:31:06,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:31:06,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 16 [2023-12-15 21:31:06,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750701198] [2023-12-15 21:31:06,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:31:06,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-15 21:31:06,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:06,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-15 21:31:06,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2023-12-15 21:31:06,307 INFO L87 Difference]: Start difference. First operand 168 states and 240 transitions. Second operand has 16 states, 12 states have (on average 8.916666666666666) internal successors, (107), 16 states have internal predecessors, (107), 8 states have call successors, (75), 2 states have call predecessors, (75), 4 states have return successors, (75), 4 states have call predecessors, (75), 8 states have call successors, (75) [2023-12-15 21:31:07,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:07,022 INFO L93 Difference]: Finished difference Result 358 states and 498 transitions. [2023-12-15 21:31:07,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-15 21:31:07,023 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 8.916666666666666) internal successors, (107), 16 states have internal predecessors, (107), 8 states have call successors, (75), 2 states have call predecessors, (75), 4 states have return successors, (75), 4 states have call predecessors, (75), 8 states have call successors, (75) Word has length 185 [2023-12-15 21:31:07,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:07,025 INFO L225 Difference]: With dead ends: 358 [2023-12-15 21:31:07,025 INFO L226 Difference]: Without dead ends: 189 [2023-12-15 21:31:07,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 415 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=246, Invalid=1014, Unknown=0, NotChecked=0, Total=1260 [2023-12-15 21:31:07,026 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 393 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:07,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 855 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-15 21:31:07,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2023-12-15 21:31:07,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 182. [2023-12-15 21:31:07,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 148 states have (on average 1.3108108108108107) internal successors, (194), 149 states have internal predecessors, (194), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-15 21:31:07,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 248 transitions. [2023-12-15 21:31:07,042 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 248 transitions. Word has length 185 [2023-12-15 21:31:07,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:07,042 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 248 transitions. [2023-12-15 21:31:07,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 8.916666666666666) internal successors, (107), 16 states have internal predecessors, (107), 8 states have call successors, (75), 2 states have call predecessors, (75), 4 states have return successors, (75), 4 states have call predecessors, (75), 8 states have call successors, (75) [2023-12-15 21:31:07,042 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 248 transitions. [2023-12-15 21:31:07,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2023-12-15 21:31:07,044 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:07,044 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:31:07,050 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-15 21:31:07,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-12-15 21:31:07,250 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:07,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:07,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1594146464, now seen corresponding path program 1 times [2023-12-15 21:31:07,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:07,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889595725] [2023-12-15 21:31:07,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:07,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:07,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 21:31:07,361 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-15 21:31:07,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 21:31:07,466 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-15 21:31:07,466 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-15 21:31:07,467 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 21:31:07,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-15 21:31:07,471 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:31:07,473 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 21:31:07,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 09:31:07 BoogieIcfgContainer [2023-12-15 21:31:07,556 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 21:31:07,557 INFO L158 Benchmark]: Toolchain (without parser) took 7411.05ms. Allocated memory was 216.0MB in the beginning and 417.3MB in the end (delta: 201.3MB). Free memory was 174.7MB in the beginning and 235.3MB in the end (delta: -60.7MB). Peak memory consumption was 142.2MB. Max. memory is 8.0GB. [2023-12-15 21:31:07,557 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 216.0MB. Free memory is still 168.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 21:31:07,557 INFO L158 Benchmark]: CACSL2BoogieTranslator took 255.08ms. Allocated memory is still 216.0MB. Free memory was 174.7MB in the beginning and 158.9MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-15 21:31:07,557 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.62ms. Allocated memory is still 216.0MB. Free memory was 158.9MB in the beginning and 154.1MB in the end (delta: 4.9MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-15 21:31:07,557 INFO L158 Benchmark]: Boogie Preprocessor took 93.24ms. Allocated memory is still 216.0MB. Free memory was 154.1MB in the beginning and 147.4MB in the end (delta: 6.6MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2023-12-15 21:31:07,558 INFO L158 Benchmark]: RCFGBuilder took 672.90ms. Allocated memory was 216.0MB in the beginning and 275.8MB in the end (delta: 59.8MB). Free memory was 147.4MB in the beginning and 226.7MB in the end (delta: -79.2MB). Peak memory consumption was 28.7MB. Max. memory is 8.0GB. [2023-12-15 21:31:07,558 INFO L158 Benchmark]: TraceAbstraction took 6337.24ms. Allocated memory was 275.8MB in the beginning and 417.3MB in the end (delta: 141.6MB). Free memory was 226.2MB in the beginning and 235.3MB in the end (delta: -9.1MB). Peak memory consumption was 132.4MB. Max. memory is 8.0GB. [2023-12-15 21:31:07,559 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 216.0MB. Free memory is still 168.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 255.08ms. Allocated memory is still 216.0MB. Free memory was 174.7MB in the beginning and 158.9MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.62ms. Allocated memory is still 216.0MB. Free memory was 158.9MB in the beginning and 154.1MB in the end (delta: 4.9MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 93.24ms. Allocated memory is still 216.0MB. Free memory was 154.1MB in the beginning and 147.4MB in the end (delta: 6.6MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * RCFGBuilder took 672.90ms. Allocated memory was 216.0MB in the beginning and 275.8MB in the end (delta: 59.8MB). Free memory was 147.4MB in the beginning and 226.7MB in the end (delta: -79.2MB). Peak memory consumption was 28.7MB. Max. memory is 8.0GB. * TraceAbstraction took 6337.24ms. Allocated memory was 275.8MB in the beginning and 417.3MB in the end (delta: 141.6MB). Free memory was 226.2MB in the beginning and 235.3MB in the end (delta: -9.1MB). Peak memory consumption was 132.4MB. 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 111, overapproximation of someBinaryDOUBLEComparisonOperation at line 64. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {0, 0} }; [L25-L27] double double_Array_0[1] = { 32.5 }; [L25-L27] double double_Array_0[1] = { 32.5 }; [L28-L30] float float_Array_0[2] = { 255.5, 255.5 }; [L28-L30] float float_Array_0[2] = { 255.5, 255.5 }; [L28-L30] float float_Array_0[2] = { 255.5, 255.5 }; [L31-L33] signed char signed_char_Array_0[1] = { 0 }; [L31-L33] signed char signed_char_Array_0[1] = { 0 }; [L34-L36] unsigned char unsigned_char_Array_0[11] = { 5, 100, 128, 64, 100, 8, 50, 8, 32, 64, 0 }; [L34-L36] unsigned char unsigned_char_Array_0[11] = { 5, 100, 128, 64, 100, 8, 50, 8, 32, 64, 0 }; [L34-L36] unsigned char unsigned_char_Array_0[11] = { 5, 100, 128, 64, 100, 8, 50, 8, 32, 64, 0 }; [L34-L36] unsigned char unsigned_char_Array_0[11] = { 5, 100, 128, 64, 100, 8, 50, 8, 32, 64, 0 }; [L34-L36] unsigned char unsigned_char_Array_0[11] = { 5, 100, 128, 64, 100, 8, 50, 8, 32, 64, 0 }; [L34-L36] unsigned char unsigned_char_Array_0[11] = { 5, 100, 128, 64, 100, 8, 50, 8, 32, 64, 0 }; [L34-L36] unsigned char unsigned_char_Array_0[11] = { 5, 100, 128, 64, 100, 8, 50, 8, 32, 64, 0 }; [L34-L36] unsigned char unsigned_char_Array_0[11] = { 5, 100, 128, 64, 100, 8, 50, 8, 32, 64, 0 }; [L34-L36] unsigned char unsigned_char_Array_0[11] = { 5, 100, 128, 64, 100, 8, 50, 8, 32, 64, 0 }; [L34-L36] unsigned char unsigned_char_Array_0[11] = { 5, 100, 128, 64, 100, 8, 50, 8, 32, 64, 0 }; [L34-L36] unsigned char unsigned_char_Array_0[11] = { 5, 100, 128, 64, 100, 8, 50, 8, 32, 64, 0 }; [L34-L36] unsigned char unsigned_char_Array_0[11] = { 5, 100, 128, 64, 100, 8, 50, 8, 32, 64, 0 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[1] = { 64 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[1] = { 64 }; [L115] isInitial = 1 [L116] FCALL initially() [L117] COND TRUE 1 [L118] FCALL updateLastVariables() [L119] CALL updateVariables() [L69] BOOL_unsigned_char_Array_0[0][0] = __VERIFIER_nondet_uchar() [L70] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L70] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L71] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L71] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L71] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] BOOL_unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L73] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L73] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L73] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] BOOL_unsigned_char_Array_0[0][1] = __VERIFIER_nondet_uchar() [L76] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] float_Array_0[1] = __VERIFIER_nondet_float() [L79] EXPR float_Array_0[1] [L79] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F [L79] EXPR float_Array_0[1] [L79] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L81] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L84] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] CALL assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] RET assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] CALL assume_abort_if_not(unsigned_char_Array_0[1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] RET assume_abort_if_not(unsigned_char_Array_0[1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L87] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] CALL assume_abort_if_not(unsigned_char_Array_0[2] >= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] RET assume_abort_if_not(unsigned_char_Array_0[2] >= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L88] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L88] CALL assume_abort_if_not(unsigned_char_Array_0[2] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L88] RET assume_abort_if_not(unsigned_char_Array_0[2] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] unsigned_char_Array_0[3] = __VERIFIER_nondet_uchar() [L90] EXPR unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L90] CALL assume_abort_if_not(unsigned_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L90] RET assume_abort_if_not(unsigned_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L91] EXPR unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L91] CALL assume_abort_if_not(unsigned_char_Array_0[3] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L91] RET assume_abort_if_not(unsigned_char_Array_0[3] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] unsigned_char_Array_0[6] = __VERIFIER_nondet_uchar() [L93] EXPR unsigned_char_Array_0[6] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L93] CALL assume_abort_if_not(unsigned_char_Array_0[6] >= 32) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L93] RET assume_abort_if_not(unsigned_char_Array_0[6] >= 32) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L94] EXPR unsigned_char_Array_0[6] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L94] CALL assume_abort_if_not(unsigned_char_Array_0[6] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L94] RET assume_abort_if_not(unsigned_char_Array_0[6] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] unsigned_char_Array_0[7] = __VERIFIER_nondet_uchar() [L96] EXPR unsigned_char_Array_0[7] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] CALL assume_abort_if_not(unsigned_char_Array_0[7] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] RET assume_abort_if_not(unsigned_char_Array_0[7] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] EXPR unsigned_char_Array_0[7] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] CALL assume_abort_if_not(unsigned_char_Array_0[7] <= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] RET assume_abort_if_not(unsigned_char_Array_0[7] <= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L98] unsigned_char_Array_0[8] = __VERIFIER_nondet_uchar() [L99] EXPR unsigned_char_Array_0[8] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L99] CALL assume_abort_if_not(unsigned_char_Array_0[8] >= 32) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L99] RET assume_abort_if_not(unsigned_char_Array_0[8] >= 32) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] EXPR unsigned_char_Array_0[8] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] CALL assume_abort_if_not(unsigned_char_Array_0[8] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] RET assume_abort_if_not(unsigned_char_Array_0[8] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] unsigned_char_Array_0[9] = __VERIFIER_nondet_uchar() [L102] EXPR unsigned_char_Array_0[9] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L102] CALL assume_abort_if_not(unsigned_char_Array_0[9] >= 32) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L102] RET assume_abort_if_not(unsigned_char_Array_0[9] >= 32) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L103] EXPR unsigned_char_Array_0[9] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L103] CALL assume_abort_if_not(unsigned_char_Array_0[9] <= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L103] RET assume_abort_if_not(unsigned_char_Array_0[9] <= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L104] unsigned_char_Array_0[10] = __VERIFIER_nondet_uchar() [L105] EXPR unsigned_char_Array_0[10] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L105] CALL assume_abort_if_not(unsigned_char_Array_0[10] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L105] RET assume_abort_if_not(unsigned_char_Array_0[10] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L106] EXPR unsigned_char_Array_0[10] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L106] CALL assume_abort_if_not(unsigned_char_Array_0[10] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L106] RET assume_abort_if_not(unsigned_char_Array_0[10] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L119] RET updateVariables() [L120] CALL step() [L43] BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L43] COND TRUE BOOL_unsigned_char_Array_0[0][0] [L44] EXPR unsigned_char_Array_0[3] [L44] EXPR unsigned_char_Array_0[0] [L44] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L44] EXPR ((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1]) [L44] EXPR unsigned_char_Array_0[0] [L44] EXPR ((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L44] unsigned_char_Array_0[4] = (unsigned_char_Array_0[3] + ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1])))) [L48] EXPR BOOL_unsigned_char_Array_0[0][0] [L48] EXPR BOOL_unsigned_char_Array_0[0][0] || BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L48] EXPR BOOL_unsigned_char_Array_0[0][0] || BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L48] unsigned char stepLocal_0 = BOOL_unsigned_char_Array_0[0][0] || BOOL_unsigned_char_Array_0[0][1]; [L49] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L49] COND TRUE BOOL_unsigned_char_Array_0[1][0] || stepLocal_0 [L50] EXPR unsigned_char_Array_0[9] [L50] signed_char_Array_0[0] = unsigned_char_Array_0[9] [L52] EXPR float_Array_0[1] [L52] float_Array_0[0] = float_Array_0[1] [L53] EXPR unsigned_char_Array_0[10] [L53] unsigned_short_int_Array_0[0] = unsigned_char_Array_0[10] [L54] double_Array_0[0] = 0.010000000000000009 [L55] EXPR float_Array_0[0] [L55] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L55] COND FALSE !(float_Array_0[0] < float_Array_0[0]) [L58] EXPR float_Array_0[0] [L58] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L58] COND TRUE float_Array_0[0] >= float_Array_0[0] [L59] EXPR BOOL_unsigned_char_Array_0[1][0] [L59] BOOL_unsigned_char_Array_0[1][1] = BOOL_unsigned_char_Array_0[1][0] [L64] EXPR double_Array_0[0] [L64] EXPR float_Array_0[0] [L64] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L64] EXPR ((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0]) [L64] EXPR float_Array_0[0] [L64] EXPR ((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, stepLocal_0=1, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L64] COND TRUE double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0]))) [L65] EXPR unsigned_char_Array_0[2] [L65] EXPR unsigned_char_Array_0[3] [L65] unsigned_char_Array_0[5] = (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]) [L120] RET step() [L121] CALL, EXPR property() [L111] EXPR float_Array_0[0] [L111] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L111] EXPR (float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0]))) [L111] EXPR float_Array_0[0] [L111] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L111] EXPR (float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])) [L111] EXPR BOOL_unsigned_char_Array_0[1][1] [L111] EXPR BOOL_unsigned_char_Array_0[0][0] [L111] EXPR (float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L111] EXPR (float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L111] EXPR ((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L111] EXPR ((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L111] EXPR (((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_char_Array_0[4] == ((unsigned char) (unsigned_char_Array_0[3] + ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[4] == ((unsigned char) (((64 + unsigned_char_Array_0[8]) + (unsigned_char_Array_0[9] + unsigned_char_Array_0[6])) - (unsigned_char_Array_0[7] + unsigned_char_Array_0[10]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L111] EXPR (((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_char_Array_0[4] == ((unsigned char) (unsigned_char_Array_0[3] + ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[4] == ((unsigned char) (((64 + unsigned_char_Array_0[8]) + (unsigned_char_Array_0[9] + unsigned_char_Array_0[6])) - (unsigned_char_Array_0[7] + unsigned_char_Array_0[10]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L111] EXPR ((((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_char_Array_0[4] == ((unsigned char) (unsigned_char_Array_0[3] + ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[4] == ((unsigned char) (((64 + unsigned_char_Array_0[8]) + (unsigned_char_Array_0[9] + unsigned_char_Array_0[6])) - (unsigned_char_Array_0[7] + unsigned_char_Array_0[10])))))) && ((BOOL_unsigned_char_Array_0[1][0] || (BOOL_unsigned_char_Array_0[0][0] || BOOL_unsigned_char_Array_0[0][1])) ? (signed_char_Array_0[0] == ((signed char) unsigned_char_Array_0[9])) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L111] EXPR ((((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_char_Array_0[4] == ((unsigned char) (unsigned_char_Array_0[3] + ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[4] == ((unsigned char) (((64 + unsigned_char_Array_0[8]) + (unsigned_char_Array_0[9] + unsigned_char_Array_0[6])) - (unsigned_char_Array_0[7] + unsigned_char_Array_0[10])))))) && ((BOOL_unsigned_char_Array_0[1][0] || (BOOL_unsigned_char_Array_0[0][0] || BOOL_unsigned_char_Array_0[0][1])) ? (signed_char_Array_0[0] == ((signed char) unsigned_char_Array_0[9])) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L111] EXPR (((((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_char_Array_0[4] == ((unsigned char) (unsigned_char_Array_0[3] + ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[4] == ((unsigned char) (((64 + unsigned_char_Array_0[8]) + (unsigned_char_Array_0[9] + unsigned_char_Array_0[6])) - (unsigned_char_Array_0[7] + unsigned_char_Array_0[10])))))) && ((BOOL_unsigned_char_Array_0[1][0] || (BOOL_unsigned_char_Array_0[0][0] || BOOL_unsigned_char_Array_0[0][1])) ? (signed_char_Array_0[0] == ((signed char) unsigned_char_Array_0[9])) : 1)) && (float_Array_0[0] == ((float) float_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L111] EXPR (((((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_char_Array_0[4] == ((unsigned char) (unsigned_char_Array_0[3] + ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[4] == ((unsigned char) (((64 + unsigned_char_Array_0[8]) + (unsigned_char_Array_0[9] + unsigned_char_Array_0[6])) - (unsigned_char_Array_0[7] + unsigned_char_Array_0[10])))))) && ((BOOL_unsigned_char_Array_0[1][0] || (BOOL_unsigned_char_Array_0[0][0] || BOOL_unsigned_char_Array_0[0][1])) ? (signed_char_Array_0[0] == ((signed char) unsigned_char_Array_0[9])) : 1)) && (float_Array_0[0] == ((float) float_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L111] EXPR ((((((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_char_Array_0[4] == ((unsigned char) (unsigned_char_Array_0[3] + ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[4] == ((unsigned char) (((64 + unsigned_char_Array_0[8]) + (unsigned_char_Array_0[9] + unsigned_char_Array_0[6])) - (unsigned_char_Array_0[7] + unsigned_char_Array_0[10])))))) && ((BOOL_unsigned_char_Array_0[1][0] || (BOOL_unsigned_char_Array_0[0][0] || BOOL_unsigned_char_Array_0[0][1])) ? (signed_char_Array_0[0] == ((signed char) unsigned_char_Array_0[9])) : 1)) && (float_Array_0[0] == ((float) float_Array_0[1]))) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[10])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L111] EXPR ((((((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_char_Array_0[4] == ((unsigned char) (unsigned_char_Array_0[3] + ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[4] == ((unsigned char) (((64 + unsigned_char_Array_0[8]) + (unsigned_char_Array_0[9] + unsigned_char_Array_0[6])) - (unsigned_char_Array_0[7] + unsigned_char_Array_0[10])))))) && ((BOOL_unsigned_char_Array_0[1][0] || (BOOL_unsigned_char_Array_0[0][0] || BOOL_unsigned_char_Array_0[0][1])) ? (signed_char_Array_0[0] == ((signed char) unsigned_char_Array_0[9])) : 1)) && (float_Array_0[0] == ((float) float_Array_0[1]))) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[10])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L111] EXPR (((((((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_char_Array_0[4] == ((unsigned char) (unsigned_char_Array_0[3] + ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[4] == ((unsigned char) (((64 + unsigned_char_Array_0[8]) + (unsigned_char_Array_0[9] + unsigned_char_Array_0[6])) - (unsigned_char_Array_0[7] + unsigned_char_Array_0[10])))))) && ((BOOL_unsigned_char_Array_0[1][0] || (BOOL_unsigned_char_Array_0[0][0] || BOOL_unsigned_char_Array_0[0][1])) ? (signed_char_Array_0[0] == ((signed char) unsigned_char_Array_0[9])) : 1)) && (float_Array_0[0] == ((float) float_Array_0[1]))) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[10]))) && (double_Array_0[0] == ((double) 0.010000000000000009)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L111] EXPR (((((((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_char_Array_0[4] == ((unsigned char) (unsigned_char_Array_0[3] + ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[4] == ((unsigned char) (((64 + unsigned_char_Array_0[8]) + (unsigned_char_Array_0[9] + unsigned_char_Array_0[6])) - (unsigned_char_Array_0[7] + unsigned_char_Array_0[10])))))) && ((BOOL_unsigned_char_Array_0[1][0] || (BOOL_unsigned_char_Array_0[0][0] || BOOL_unsigned_char_Array_0[0][1])) ? (signed_char_Array_0[0] == ((signed char) unsigned_char_Array_0[9])) : 1)) && (float_Array_0[0] == ((float) float_Array_0[1]))) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[10]))) && (double_Array_0[0] == ((double) 0.010000000000000009)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L111-L112] return (((((((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_char_Array_0[4] == ((unsigned char) (unsigned_char_Array_0[3] + ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[4] == ((unsigned char) (((64 + unsigned_char_Array_0[8]) + (unsigned_char_Array_0[9] + unsigned_char_Array_0[6])) - (unsigned_char_Array_0[7] + unsigned_char_Array_0[10])))))) && ((BOOL_unsigned_char_Array_0[1][0] || (BOOL_unsigned_char_Array_0[0][0] || BOOL_unsigned_char_Array_0[0][1])) ? (signed_char_Array_0[0] == ((signed char) unsigned_char_Array_0[9])) : 1)) && (float_Array_0[0] == ((float) float_Array_0[1]))) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[10]))) && (double_Array_0[0] == ((double) 0.010000000000000009)) ; [L121] RET, EXPR property() [L121] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 113 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.2s, OverallIterations: 7, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 637 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 636 mSDsluCounter, 3549 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2655 mSDsCounter, 87 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1013 IncrementalHoareTripleChecker+Invalid, 1100 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 87 mSolverCounterUnsat, 894 mSDtfsCounter, 1013 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 761 GetRequests, 704 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=182occurred in iteration=6, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 99 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 1482 NumberOfCodeBlocks, 1482 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1472 ConstructedInterpolants, 0 QuantifiedInterpolants, 5525 SizeOfPredicates, 6 NumberOfNonLiveVariables, 632 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 9339/9600 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-15 21:31:07,573 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...