/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-70.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 02:15:12,489 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 02:15:12,560 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-21 02:15:12,564 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 02:15:12,564 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 02:15:12,584 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 02:15:12,585 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 02:15:12,585 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 02:15:12,586 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 02:15:12,589 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 02:15:12,589 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 02:15:12,589 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 02:15:12,589 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 02:15:12,590 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 02:15:12,590 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 02:15:12,590 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 02:15:12,591 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 02:15:12,591 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 02:15:12,591 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 02:15:12,591 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 02:15:12,591 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 02:15:12,592 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 02:15:12,592 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 02:15:12,592 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 02:15:12,592 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 02:15:12,592 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 02:15:12,593 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 02:15:12,593 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 02:15:12,593 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 02:15:12,593 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 02:15:12,594 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 02:15:12,594 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 02:15:12,594 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 02:15:12,594 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 02:15:12,595 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 02:15:12,595 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 02:15:12,595 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 02:15:12,595 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 02:15:12,595 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 02:15:12,596 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 02:15:12,596 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 02:15:12,596 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 02:15:12,596 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 02:15:12,596 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-21 02:15:12,768 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 02:15:12,781 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 02:15:12,783 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 02:15:12,783 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 02:15:12,783 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 02:15:12,784 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-70.i [2023-12-21 02:15:13,764 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 02:15:13,917 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 02:15:13,918 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-70.i [2023-12-21 02:15:13,933 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6279221f8/ec85c28c902040e6b3492a6080cd2533/FLAG7782dedcb [2023-12-21 02:15:13,942 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6279221f8/ec85c28c902040e6b3492a6080cd2533 [2023-12-21 02:15:13,944 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 02:15:13,945 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 02:15:13,946 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 02:15:13,946 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 02:15:13,949 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 02:15:13,949 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 02:15:13" (1/1) ... [2023-12-21 02:15:13,951 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1363e0ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:15:13, skipping insertion in model container [2023-12-21 02:15:13,951 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 02:15:13" (1/1) ... [2023-12-21 02:15:13,976 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 02:15:14,061 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-p_file-70.i[916,929] [2023-12-21 02:15:14,092 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 02:15:14,101 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 02:15:14,110 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-p_file-70.i[916,929] [2023-12-21 02:15:14,136 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 02:15:14,150 INFO L206 MainTranslator]: Completed translation [2023-12-21 02:15:14,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:15:14 WrapperNode [2023-12-21 02:15:14,151 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 02:15:14,151 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 02:15:14,151 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 02:15:14,152 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 02:15:14,179 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:15:14" (1/1) ... [2023-12-21 02:15:14,187 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:15:14" (1/1) ... [2023-12-21 02:15:14,227 INFO L138 Inliner]: procedures = 29, calls = 169, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 538 [2023-12-21 02:15:14,227 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 02:15:14,228 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 02:15:14,228 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 02:15:14,228 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 02:15:14,237 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:15:14" (1/1) ... [2023-12-21 02:15:14,237 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:15:14" (1/1) ... [2023-12-21 02:15:14,247 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:15:14" (1/1) ... [2023-12-21 02:15:14,269 INFO L175 MemorySlicer]: Split 132 memory accesses to 15 slices as follows [2, 7, 8, 18, 3, 5, 5, 10, 8, 8, 8, 35, 6, 3, 6]. 27 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 16 writes are split as follows [0, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1]. [2023-12-21 02:15:14,270 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:15:14" (1/1) ... [2023-12-21 02:15:14,270 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:15:14" (1/1) ... [2023-12-21 02:15:14,303 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:15:14" (1/1) ... [2023-12-21 02:15:14,306 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:15:14" (1/1) ... [2023-12-21 02:15:14,309 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:15:14" (1/1) ... [2023-12-21 02:15:14,311 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:15:14" (1/1) ... [2023-12-21 02:15:14,316 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 02:15:14,316 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 02:15:14,317 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 02:15:14,324 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 02:15:14,325 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:15:14" (1/1) ... [2023-12-21 02:15:14,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 02:15:14,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:15:14,378 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-21 02:15:14,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-21 02:15:14,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 02:15:14,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-21 02:15:14,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-21 02:15:14,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-12-21 02:15:14,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2023-12-21 02:15:14,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2023-12-21 02:15:14,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2023-12-21 02:15:14,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2023-12-21 02:15:14,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2023-12-21 02:15:14,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2023-12-21 02:15:14,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2023-12-21 02:15:14,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2023-12-21 02:15:14,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2023-12-21 02:15:14,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2023-12-21 02:15:14,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2023-12-21 02:15:14,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2023-12-21 02:15:14,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-21 02:15:14,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-21 02:15:14,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-21 02:15:14,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-21 02:15:14,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-21 02:15:14,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-12-21 02:15:14,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2023-12-21 02:15:14,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2023-12-21 02:15:14,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2023-12-21 02:15:14,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2023-12-21 02:15:14,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2023-12-21 02:15:14,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2023-12-21 02:15:14,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2023-12-21 02:15:14,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2023-12-21 02:15:14,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2023-12-21 02:15:14,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-21 02:15:14,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-21 02:15:14,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-12-21 02:15:14,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2023-12-21 02:15:14,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2023-12-21 02:15:14,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2023-12-21 02:15:14,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2023-12-21 02:15:14,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2023-12-21 02:15:14,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2023-12-21 02:15:14,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2023-12-21 02:15:14,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2023-12-21 02:15:14,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2023-12-21 02:15:14,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2023-12-21 02:15:14,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2023-12-21 02:15:14,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2023-12-21 02:15:14,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-21 02:15:14,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-21 02:15:14,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-21 02:15:14,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-21 02:15:14,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-21 02:15:14,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-12-21 02:15:14,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2023-12-21 02:15:14,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2023-12-21 02:15:14,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2023-12-21 02:15:14,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2023-12-21 02:15:14,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2023-12-21 02:15:14,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2023-12-21 02:15:14,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2023-12-21 02:15:14,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2023-12-21 02:15:14,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2023-12-21 02:15:14,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-21 02:15:14,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-21 02:15:14,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-12-21 02:15:14,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2023-12-21 02:15:14,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2023-12-21 02:15:14,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2023-12-21 02:15:14,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2023-12-21 02:15:14,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2023-12-21 02:15:14,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2023-12-21 02:15:14,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2023-12-21 02:15:14,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2023-12-21 02:15:14,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2023-12-21 02:15:14,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2023-12-21 02:15:14,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2023-12-21 02:15:14,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2023-12-21 02:15:14,419 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-21 02:15:14,419 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-21 02:15:14,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 02:15:14,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-21 02:15:14,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-21 02:15:14,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-21 02:15:14,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-21 02:15:14,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-12-21 02:15:14,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-12-21 02:15:14,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2023-12-21 02:15:14,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2023-12-21 02:15:14,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2023-12-21 02:15:14,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2023-12-21 02:15:14,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2023-12-21 02:15:14,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2023-12-21 02:15:14,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2023-12-21 02:15:14,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2023-12-21 02:15:14,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 02:15:14,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 02:15:14,583 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 02:15:14,585 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 02:15:14,960 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 02:15:14,988 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 02:15:14,988 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-21 02:15:14,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 02:15:14 BoogieIcfgContainer [2023-12-21 02:15:14,989 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 02:15:14,990 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 02:15:14,990 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 02:15:14,993 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 02:15:14,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 02:15:13" (1/3) ... [2023-12-21 02:15:14,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@210b61fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 02:15:14, skipping insertion in model container [2023-12-21 02:15:14,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:15:14" (2/3) ... [2023-12-21 02:15:14,994 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@210b61fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 02:15:14, skipping insertion in model container [2023-12-21 02:15:14,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 02:15:14" (3/3) ... [2023-12-21 02:15:14,994 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-70.i [2023-12-21 02:15:15,006 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 02:15:15,007 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 02:15:15,037 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 02:15:15,041 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;@f720528, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 02:15:15,041 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 02:15:15,044 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 79 states have (on average 1.481012658227848) internal successors, (117), 80 states have internal predecessors, (117), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-21 02:15:15,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-21 02:15:15,054 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:15:15,055 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:15:15,056 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:15:15,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:15:15,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1746080586, now seen corresponding path program 1 times [2023-12-21 02:15:15,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:15:15,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23301736] [2023-12-21 02:15:15,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:15:15,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:15:15,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:15,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:15:15,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:15,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:15:15,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:15,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:15:15,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:15,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:15:15,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:15,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:15:15,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:15,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:15:15,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:15,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:15:15,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:15,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:15:15,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:15,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:15:15,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:15,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:15:15,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:15,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:15:15,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:15,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:15:15,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:15,380 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:15:15,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:15:15,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23301736] [2023-12-21 02:15:15,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23301736] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:15:15,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:15:15,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 02:15:15,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940571962] [2023-12-21 02:15:15,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:15:15,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 02:15:15,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:15:15,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 02:15:15,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 02:15:15,403 INFO L87 Difference]: Start difference. First operand has 94 states, 79 states have (on average 1.481012658227848) internal successors, (117), 80 states have internal predecessors, (117), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 02:15:15,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:15:15,446 INFO L93 Difference]: Finished difference Result 185 states and 292 transitions. [2023-12-21 02:15:15,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 02:15:15,448 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2023-12-21 02:15:15,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:15:15,454 INFO L225 Difference]: With dead ends: 185 [2023-12-21 02:15:15,454 INFO L226 Difference]: Without dead ends: 92 [2023-12-21 02:15:15,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 02:15:15,460 INFO L413 NwaCegarLoop]: 132 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, 132 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:15:15,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:15:15,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-12-21 02:15:15,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2023-12-21 02:15:15,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 78 states have (on average 1.435897435897436) internal successors, (112), 78 states have internal predecessors, (112), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-21 02:15:15,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 136 transitions. [2023-12-21 02:15:15,498 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 136 transitions. Word has length 110 [2023-12-21 02:15:15,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:15:15,499 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 136 transitions. [2023-12-21 02:15:15,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 02:15:15,499 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 136 transitions. [2023-12-21 02:15:15,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-21 02:15:15,504 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:15:15,505 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:15:15,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 02:15:15,505 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:15:15,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:15:15,505 INFO L85 PathProgramCache]: Analyzing trace with hash 366087206, now seen corresponding path program 1 times [2023-12-21 02:15:15,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:15:15,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924043584] [2023-12-21 02:15:15,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:15:15,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:15:15,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:15,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:15:15,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:15,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:15:15,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:15,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:15:15,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:15,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:15:15,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:15,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:15:15,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:15,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:15:15,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:15,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:15:15,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:15,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:15:15,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:15,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:15:15,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:15,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:15:15,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:15,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:15:15,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:15,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:15:15,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:15,764 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:15:15,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:15:15,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924043584] [2023-12-21 02:15:15,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924043584] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:15:15,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:15:15,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 02:15:15,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347508834] [2023-12-21 02:15:15,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:15:15,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 02:15:15,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:15:15,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 02:15:15,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 02:15:15,771 INFO L87 Difference]: Start difference. First operand 92 states and 136 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 02:15:15,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:15:15,827 INFO L93 Difference]: Finished difference Result 189 states and 280 transitions. [2023-12-21 02:15:15,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 02:15:15,827 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2023-12-21 02:15:15,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:15:15,828 INFO L225 Difference]: With dead ends: 189 [2023-12-21 02:15:15,828 INFO L226 Difference]: Without dead ends: 98 [2023-12-21 02:15:15,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:15:15,829 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 10 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:15:15,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 388 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:15:15,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-12-21 02:15:15,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2023-12-21 02:15:15,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 80 states have (on average 1.425) internal successors, (114), 80 states have internal predecessors, (114), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-21 02:15:15,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 138 transitions. [2023-12-21 02:15:15,837 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 138 transitions. Word has length 110 [2023-12-21 02:15:15,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:15:15,837 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 138 transitions. [2023-12-21 02:15:15,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 02:15:15,837 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 138 transitions. [2023-12-21 02:15:15,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-21 02:15:15,838 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:15:15,838 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:15:15,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 02:15:15,839 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:15:15,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:15:15,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1098054632, now seen corresponding path program 1 times [2023-12-21 02:15:15,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:15:15,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676383434] [2023-12-21 02:15:15,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:15:15,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:15:15,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:16,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:15:16,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:16,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:15:16,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:16,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:15:16,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:16,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:15:16,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:16,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:15:16,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:16,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:15:16,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:16,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:15:16,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:16,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:15:16,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:16,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:15:16,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:16,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:15:16,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:16,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:15:16,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:16,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:15:16,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:16,135 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:15:16,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:15:16,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676383434] [2023-12-21 02:15:16,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676383434] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:15:16,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:15:16,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 02:15:16,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038896514] [2023-12-21 02:15:16,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:15:16,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 02:15:16,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:15:16,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 02:15:16,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 02:15:16,142 INFO L87 Difference]: Start difference. First operand 94 states and 138 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:15:16,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:15:16,202 INFO L93 Difference]: Finished difference Result 208 states and 307 transitions. [2023-12-21 02:15:16,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 02:15:16,203 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2023-12-21 02:15:16,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:15:16,204 INFO L225 Difference]: With dead ends: 208 [2023-12-21 02:15:16,204 INFO L226 Difference]: Without dead ends: 115 [2023-12-21 02:15:16,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:15:16,205 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 39 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:15:16,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 425 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:15:16,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-12-21 02:15:16,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 96. [2023-12-21 02:15:16,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 82 states have (on average 1.4146341463414633) internal successors, (116), 82 states have internal predecessors, (116), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-21 02:15:16,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 140 transitions. [2023-12-21 02:15:16,211 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 140 transitions. Word has length 110 [2023-12-21 02:15:16,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:15:16,211 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 140 transitions. [2023-12-21 02:15:16,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:15:16,211 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 140 transitions. [2023-12-21 02:15:16,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-21 02:15:16,215 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:15:16,215 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:15:16,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-21 02:15:16,215 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:15:16,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:15:16,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1681557613, now seen corresponding path program 1 times [2023-12-21 02:15:16,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:15:16,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874514958] [2023-12-21 02:15:16,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:15:16,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:15:16,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:16,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:15:16,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:16,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:15:16,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:16,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:15:16,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:16,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:15:16,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:16,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:15:16,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:16,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:15:16,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:16,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:15:16,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:16,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:15:16,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:16,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:15:16,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:16,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:15:16,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:16,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:15:16,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:16,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:15:16,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:16,392 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:15:16,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:15:16,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874514958] [2023-12-21 02:15:16,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874514958] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:15:16,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:15:16,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 02:15:16,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699302355] [2023-12-21 02:15:16,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:15:16,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 02:15:16,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:15:16,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 02:15:16,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 02:15:16,394 INFO L87 Difference]: Start difference. First operand 96 states and 140 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:15:16,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:15:16,430 INFO L93 Difference]: Finished difference Result 199 states and 290 transitions. [2023-12-21 02:15:16,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 02:15:16,430 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 112 [2023-12-21 02:15:16,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:15:16,434 INFO L225 Difference]: With dead ends: 199 [2023-12-21 02:15:16,434 INFO L226 Difference]: Without dead ends: 104 [2023-12-21 02:15:16,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:15:16,442 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 12 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:15:16,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 384 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:15:16,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-12-21 02:15:16,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2023-12-21 02:15:16,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 84 states have (on average 1.4047619047619047) internal successors, (118), 84 states have internal predecessors, (118), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-21 02:15:16,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 142 transitions. [2023-12-21 02:15:16,452 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 142 transitions. Word has length 112 [2023-12-21 02:15:16,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:15:16,452 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 142 transitions. [2023-12-21 02:15:16,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:15:16,452 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 142 transitions. [2023-12-21 02:15:16,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-21 02:15:16,453 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:15:16,453 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:15:16,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-21 02:15:16,454 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:15:16,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:15:16,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1738815915, now seen corresponding path program 1 times [2023-12-21 02:15:16,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:15:16,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345596516] [2023-12-21 02:15:16,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:15:16,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:15:16,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:16,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:15:16,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:16,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:15:16,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:16,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:15:16,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:16,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:15:16,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:16,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:15:16,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:16,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:15:16,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:16,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:15:16,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:16,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:15:16,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:16,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:15:16,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:16,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:15:16,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:16,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:15:16,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:16,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:15:16,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:16,609 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:15:16,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:15:16,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345596516] [2023-12-21 02:15:16,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345596516] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:15:16,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:15:16,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 02:15:16,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295656040] [2023-12-21 02:15:16,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:15:16,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 02:15:16,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:15:16,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 02:15:16,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 02:15:16,610 INFO L87 Difference]: Start difference. First operand 98 states and 142 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:15:16,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:15:16,637 INFO L93 Difference]: Finished difference Result 199 states and 288 transitions. [2023-12-21 02:15:16,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 02:15:16,638 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 112 [2023-12-21 02:15:16,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:15:16,638 INFO L225 Difference]: With dead ends: 199 [2023-12-21 02:15:16,638 INFO L226 Difference]: Without dead ends: 102 [2023-12-21 02:15:16,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:15:16,640 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 3 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:15:16,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 385 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:15:16,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-12-21 02:15:16,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2023-12-21 02:15:16,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 86 states have (on average 1.3953488372093024) internal successors, (120), 86 states have internal predecessors, (120), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-21 02:15:16,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 144 transitions. [2023-12-21 02:15:16,655 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 144 transitions. Word has length 112 [2023-12-21 02:15:16,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:15:16,657 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 144 transitions. [2023-12-21 02:15:16,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:15:16,658 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 144 transitions. [2023-12-21 02:15:16,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-21 02:15:16,659 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:15:16,660 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:15:16,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-21 02:15:16,660 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:15:16,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:15:16,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1738875497, now seen corresponding path program 1 times [2023-12-21 02:15:16,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:15:16,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624116756] [2023-12-21 02:15:16,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:15:16,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:15:16,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:16,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:15:16,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:16,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:15:16,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:16,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:15:16,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:16,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:15:16,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:16,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:15:16,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:16,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:15:16,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:16,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:15:16,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:16,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:15:16,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:16,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:15:16,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:16,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:15:16,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:16,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:15:16,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:16,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:15:16,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:16,912 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:15:16,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:15:16,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624116756] [2023-12-21 02:15:16,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624116756] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:15:16,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:15:16,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 02:15:16,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524186999] [2023-12-21 02:15:16,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:15:16,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 02:15:16,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:15:16,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 02:15:16,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:15:16,915 INFO L87 Difference]: Start difference. First operand 100 states and 144 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:15:16,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:15:16,958 INFO L93 Difference]: Finished difference Result 264 states and 379 transitions. [2023-12-21 02:15:16,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 02:15:16,958 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 112 [2023-12-21 02:15:16,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:15:16,959 INFO L225 Difference]: With dead ends: 264 [2023-12-21 02:15:16,959 INFO L226 Difference]: Without dead ends: 165 [2023-12-21 02:15:16,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 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-21 02:15:16,960 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 106 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:15:16,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 526 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:15:16,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2023-12-21 02:15:16,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 112. [2023-12-21 02:15:16,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 98 states have (on average 1.4081632653061225) internal successors, (138), 98 states have internal predecessors, (138), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-21 02:15:16,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 162 transitions. [2023-12-21 02:15:16,971 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 162 transitions. Word has length 112 [2023-12-21 02:15:16,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:15:16,972 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 162 transitions. [2023-12-21 02:15:16,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:15:16,972 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 162 transitions. [2023-12-21 02:15:16,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-21 02:15:16,973 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:15:16,973 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:15:16,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-21 02:15:16,973 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:15:16,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:15:16,973 INFO L85 PathProgramCache]: Analyzing trace with hash 935121502, now seen corresponding path program 1 times [2023-12-21 02:15:16,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:15:16,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565952682] [2023-12-21 02:15:16,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:15:16,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:15:17,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:17,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:15:17,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:17,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:15:17,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:17,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:15:17,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:17,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:15:17,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:17,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:15:17,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:17,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:15:17,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:17,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:15:17,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:17,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:15:17,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:17,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:15:17,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:17,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:15:17,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:17,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:15:17,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:17,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:15:17,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:17,285 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:15:17,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:15:17,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565952682] [2023-12-21 02:15:17,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565952682] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:15:17,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:15:17,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 02:15:17,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185126119] [2023-12-21 02:15:17,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:15:17,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 02:15:17,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:15:17,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 02:15:17,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 02:15:17,287 INFO L87 Difference]: Start difference. First operand 112 states and 162 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:15:17,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:15:17,387 INFO L93 Difference]: Finished difference Result 375 states and 541 transitions. [2023-12-21 02:15:17,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-21 02:15:17,387 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2023-12-21 02:15:17,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:15:17,390 INFO L225 Difference]: With dead ends: 375 [2023-12-21 02:15:17,390 INFO L226 Difference]: Without dead ends: 264 [2023-12-21 02:15:17,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-12-21 02:15:17,392 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 247 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:15:17,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 1069 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:15:17,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2023-12-21 02:15:17,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 226. [2023-12-21 02:15:17,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 199 states have (on average 1.4020100502512562) internal successors, (279), 199 states have internal predecessors, (279), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-21 02:15:17,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 327 transitions. [2023-12-21 02:15:17,403 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 327 transitions. Word has length 113 [2023-12-21 02:15:17,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:15:17,404 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 327 transitions. [2023-12-21 02:15:17,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:15:17,404 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 327 transitions. [2023-12-21 02:15:17,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-21 02:15:17,405 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:15:17,405 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:15:17,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-21 02:15:17,405 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:15:17,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:15:17,405 INFO L85 PathProgramCache]: Analyzing trace with hash 801107996, now seen corresponding path program 1 times [2023-12-21 02:15:17,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:15:17,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272773383] [2023-12-21 02:15:17,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:15:17,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:15:17,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:17,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:15:17,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:17,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:15:17,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:17,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:15:17,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:17,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:15:17,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:17,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:15:17,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:17,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:15:17,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:17,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:15:17,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:17,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:15:17,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:17,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:15:17,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:17,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:15:17,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:17,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:15:17,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:17,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:15:17,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:17,640 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:15:17,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:15:17,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272773383] [2023-12-21 02:15:17,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272773383] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:15:17,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:15:17,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 02:15:17,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530132586] [2023-12-21 02:15:17,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:15:17,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 02:15:17,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:15:17,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 02:15:17,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:15:17,641 INFO L87 Difference]: Start difference. First operand 226 states and 327 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:15:17,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:15:17,695 INFO L93 Difference]: Finished difference Result 550 states and 787 transitions. [2023-12-21 02:15:17,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 02:15:17,696 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2023-12-21 02:15:17,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:15:17,697 INFO L225 Difference]: With dead ends: 550 [2023-12-21 02:15:17,697 INFO L226 Difference]: Without dead ends: 325 [2023-12-21 02:15:17,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 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-21 02:15:17,698 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 87 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:15:17,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 557 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:15:17,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2023-12-21 02:15:17,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 234. [2023-12-21 02:15:17,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 207 states have (on average 1.3864734299516908) internal successors, (287), 207 states have internal predecessors, (287), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-21 02:15:17,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 335 transitions. [2023-12-21 02:15:17,710 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 335 transitions. Word has length 113 [2023-12-21 02:15:17,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:15:17,710 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 335 transitions. [2023-12-21 02:15:17,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:15:17,710 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 335 transitions. [2023-12-21 02:15:17,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-21 02:15:17,711 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:15:17,711 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:15:17,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-21 02:15:17,711 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:15:17,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:15:17,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1251745426, now seen corresponding path program 1 times [2023-12-21 02:15:17,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:15:17,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618959914] [2023-12-21 02:15:17,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:15:17,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:15:17,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:17,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:15:17,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:17,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:15:17,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:17,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:15:17,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:17,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:15:17,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:17,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:15:17,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:17,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:15:17,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:17,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:15:17,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:17,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:15:17,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:17,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:15:17,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:17,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:15:17,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:17,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:15:17,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:17,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:15:17,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:17,949 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:15:17,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:15:17,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618959914] [2023-12-21 02:15:17,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618959914] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:15:17,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:15:17,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 02:15:17,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894047589] [2023-12-21 02:15:17,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:15:17,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 02:15:17,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:15:17,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 02:15:17,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 02:15:17,951 INFO L87 Difference]: Start difference. First operand 234 states and 335 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:15:18,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:15:18,007 INFO L93 Difference]: Finished difference Result 467 states and 669 transitions. [2023-12-21 02:15:18,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 02:15:18,007 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2023-12-21 02:15:18,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:15:18,008 INFO L225 Difference]: With dead ends: 467 [2023-12-21 02:15:18,008 INFO L226 Difference]: Without dead ends: 234 [2023-12-21 02:15:18,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 02:15:18,010 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 1 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:15:18,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 362 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:15:18,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2023-12-21 02:15:18,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2023-12-21 02:15:18,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 207 states have (on average 1.3671497584541064) internal successors, (283), 207 states have internal predecessors, (283), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-21 02:15:18,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 331 transitions. [2023-12-21 02:15:18,018 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 331 transitions. Word has length 114 [2023-12-21 02:15:18,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:15:18,018 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 331 transitions. [2023-12-21 02:15:18,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:15:18,019 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 331 transitions. [2023-12-21 02:15:18,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-21 02:15:18,019 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:15:18,019 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:15:18,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-21 02:15:18,020 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:15:18,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:15:18,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1049077164, now seen corresponding path program 1 times [2023-12-21 02:15:18,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:15:18,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929823941] [2023-12-21 02:15:18,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:15:18,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:15:18,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:18,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:15:18,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:18,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:15:18,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:18,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:15:18,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:18,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:15:18,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:18,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:15:18,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:18,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:15:18,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:18,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:15:18,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:18,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:15:18,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:18,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:15:18,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:18,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:15:18,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:18,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:15:18,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:18,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:15:18,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:18,892 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:15:18,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:15:18,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929823941] [2023-12-21 02:15:18,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929823941] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:15:18,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:15:18,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-21 02:15:18,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305482622] [2023-12-21 02:15:18,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:15:18,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-21 02:15:18,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:15:18,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-21 02:15:18,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-21 02:15:18,894 INFO L87 Difference]: Start difference. First operand 234 states and 331 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:15:19,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:15:19,610 INFO L93 Difference]: Finished difference Result 825 states and 1161 transitions. [2023-12-21 02:15:19,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-21 02:15:19,611 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2023-12-21 02:15:19,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:15:19,613 INFO L225 Difference]: With dead ends: 825 [2023-12-21 02:15:19,613 INFO L226 Difference]: Without dead ends: 592 [2023-12-21 02:15:19,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2023-12-21 02:15:19,614 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 284 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 1181 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-21 02:15:19,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 1181 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-21 02:15:19,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2023-12-21 02:15:19,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 264. [2023-12-21 02:15:19,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 237 states have (on average 1.379746835443038) internal successors, (327), 237 states have internal predecessors, (327), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-21 02:15:19,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 375 transitions. [2023-12-21 02:15:19,626 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 375 transitions. Word has length 114 [2023-12-21 02:15:19,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:15:19,626 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 375 transitions. [2023-12-21 02:15:19,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:15:19,626 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 375 transitions. [2023-12-21 02:15:19,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-21 02:15:19,627 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:15:19,627 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:15:19,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-21 02:15:19,627 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:15:19,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:15:19,628 INFO L85 PathProgramCache]: Analyzing trace with hash -230786514, now seen corresponding path program 1 times [2023-12-21 02:15:19,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:15:19,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164866360] [2023-12-21 02:15:19,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:15:19,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:15:19,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:19,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:15:19,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:19,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:15:19,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:19,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:15:19,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:19,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:15:19,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:19,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:15:19,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:19,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:15:19,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:19,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:15:19,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:19,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:15:19,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:19,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:15:19,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:19,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:15:19,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:19,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:15:19,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:19,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:15:19,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:19,818 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:15:19,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:15:19,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164866360] [2023-12-21 02:15:19,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164866360] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:15:19,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:15:19,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 02:15:19,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801356264] [2023-12-21 02:15:19,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:15:19,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 02:15:19,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:15:19,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 02:15:19,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:15:19,820 INFO L87 Difference]: Start difference. First operand 264 states and 375 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:15:19,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:15:19,911 INFO L93 Difference]: Finished difference Result 661 states and 924 transitions. [2023-12-21 02:15:19,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 02:15:19,911 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2023-12-21 02:15:19,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:15:19,913 INFO L225 Difference]: With dead ends: 661 [2023-12-21 02:15:19,913 INFO L226 Difference]: Without dead ends: 398 [2023-12-21 02:15:19,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-21 02:15:19,914 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 88 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 02:15:19,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 537 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 02:15:19,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2023-12-21 02:15:19,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 339. [2023-12-21 02:15:19,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 306 states have (on average 1.3562091503267975) internal successors, (415), 308 states have internal predecessors, (415), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-21 02:15:19,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 471 transitions. [2023-12-21 02:15:19,927 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 471 transitions. Word has length 114 [2023-12-21 02:15:19,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:15:19,927 INFO L495 AbstractCegarLoop]: Abstraction has 339 states and 471 transitions. [2023-12-21 02:15:19,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:15:19,927 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 471 transitions. [2023-12-21 02:15:19,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-21 02:15:19,928 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:15:19,928 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:15:19,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-21 02:15:19,928 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:15:19,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:15:19,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1322662098, now seen corresponding path program 1 times [2023-12-21 02:15:19,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:15:19,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214168100] [2023-12-21 02:15:19,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:15:19,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:15:19,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:20,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:15:20,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:20,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:15:20,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:20,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:15:20,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:20,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:15:20,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:20,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:15:20,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:20,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:15:20,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:20,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:15:20,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:20,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:15:20,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:20,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:15:20,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:20,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:15:20,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:20,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:15:20,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:20,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:15:20,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:20,157 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:15:20,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:15:20,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214168100] [2023-12-21 02:15:20,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214168100] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:15:20,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:15:20,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 02:15:20,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44149673] [2023-12-21 02:15:20,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:15:20,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 02:15:20,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:15:20,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 02:15:20,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:15:20,158 INFO L87 Difference]: Start difference. First operand 339 states and 471 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:15:20,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:15:20,250 INFO L93 Difference]: Finished difference Result 796 states and 1096 transitions. [2023-12-21 02:15:20,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 02:15:20,251 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2023-12-21 02:15:20,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:15:20,254 INFO L225 Difference]: With dead ends: 796 [2023-12-21 02:15:20,254 INFO L226 Difference]: Without dead ends: 458 [2023-12-21 02:15:20,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-21 02:15:20,255 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 115 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 02:15:20,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 570 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 02:15:20,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2023-12-21 02:15:20,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 328. [2023-12-21 02:15:20,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 295 states have (on average 1.3457627118644069) internal successors, (397), 297 states have internal predecessors, (397), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-21 02:15:20,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 453 transitions. [2023-12-21 02:15:20,273 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 453 transitions. Word has length 114 [2023-12-21 02:15:20,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:15:20,274 INFO L495 AbstractCegarLoop]: Abstraction has 328 states and 453 transitions. [2023-12-21 02:15:20,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:15:20,274 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 453 transitions. [2023-12-21 02:15:20,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-21 02:15:20,275 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:15:20,275 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:15:20,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-21 02:15:20,275 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:15:20,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:15:20,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1692441520, now seen corresponding path program 1 times [2023-12-21 02:15:20,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:15:20,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579951434] [2023-12-21 02:15:20,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:15:20,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:15:20,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:20,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:15:20,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:20,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:15:20,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:20,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:15:20,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:20,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:15:20,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:20,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:15:20,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:20,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:15:20,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:20,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:15:20,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:20,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:15:20,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:20,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:15:20,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:20,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:15:20,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:20,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:15:20,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:20,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:15:20,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:20,647 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:15:20,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:15:20,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579951434] [2023-12-21 02:15:20,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579951434] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:15:20,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:15:20,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 02:15:20,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218858815] [2023-12-21 02:15:20,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:15:20,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 02:15:20,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:15:20,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 02:15:20,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 02:15:20,648 INFO L87 Difference]: Start difference. First operand 328 states and 453 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:15:20,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:15:20,770 INFO L93 Difference]: Finished difference Result 575 states and 788 transitions. [2023-12-21 02:15:20,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 02:15:20,771 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2023-12-21 02:15:20,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:15:20,772 INFO L225 Difference]: With dead ends: 575 [2023-12-21 02:15:20,772 INFO L226 Difference]: Without dead ends: 411 [2023-12-21 02:15:20,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-21 02:15:20,773 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 65 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 02:15:20,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 697 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 02:15:20,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2023-12-21 02:15:20,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 332. [2023-12-21 02:15:20,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 299 states have (on average 1.334448160535117) internal successors, (399), 301 states have internal predecessors, (399), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-21 02:15:20,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 455 transitions. [2023-12-21 02:15:20,788 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 455 transitions. Word has length 114 [2023-12-21 02:15:20,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:15:20,789 INFO L495 AbstractCegarLoop]: Abstraction has 332 states and 455 transitions. [2023-12-21 02:15:20,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:15:20,789 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 455 transitions. [2023-12-21 02:15:20,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-21 02:15:20,790 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:15:20,790 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:15:20,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-21 02:15:20,790 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:15:20,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:15:20,790 INFO L85 PathProgramCache]: Analyzing trace with hash -112996814, now seen corresponding path program 1 times [2023-12-21 02:15:20,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:15:20,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966341707] [2023-12-21 02:15:20,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:15:20,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:15:20,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:57,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:15:57,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:57,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:15:57,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:57,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:15:57,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:57,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:15:57,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:57,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:15:57,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:57,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:15:57,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:57,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:15:57,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:57,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:15:57,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:57,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:15:57,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:57,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:15:57,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:57,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:15:57,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:57,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:15:57,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:15:57,965 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:15:57,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:15:57,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966341707] [2023-12-21 02:15:57,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966341707] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:15:57,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:15:57,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-12-21 02:15:57,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532308914] [2023-12-21 02:15:57,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:15:57,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-21 02:15:57,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:15:57,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-21 02:15:57,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=203, Unknown=2, NotChecked=0, Total=240 [2023-12-21 02:15:57,966 INFO L87 Difference]: Start difference. First operand 332 states and 455 transitions. Second operand has 16 states, 14 states have (on average 4.071428571428571) internal successors, (57), 16 states have internal predecessors, (57), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 6 states have call successors, (12) [2023-12-21 02:16:06,032 WARN L293 SmtUtils]: Spent 6.90s on a formula simplification. DAG size of input: 100 DAG size of output: 78 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 02:16:19,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 02:16:21,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 02:16:32,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:16:32,202 INFO L93 Difference]: Finished difference Result 846 states and 1151 transitions. [2023-12-21 02:16:32,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-21 02:16:32,203 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.071428571428571) internal successors, (57), 16 states have internal predecessors, (57), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 6 states have call successors, (12) Word has length 114 [2023-12-21 02:16:32,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:16:32,205 INFO L225 Difference]: With dead ends: 846 [2023-12-21 02:16:32,205 INFO L226 Difference]: Without dead ends: 515 [2023-12-21 02:16:32,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 36.1s TimeCoverageRelationStatistics Valid=178, Invalid=811, Unknown=3, NotChecked=0, Total=992 [2023-12-21 02:16:32,206 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 562 mSDsluCounter, 1324 mSDsCounter, 0 mSdLazyCounter, 1001 mSolverCounterSat, 41 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 1484 SdHoareTripleChecker+Invalid, 1043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1001 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2023-12-21 02:16:32,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [562 Valid, 1484 Invalid, 1043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1001 Invalid, 1 Unknown, 0 Unchecked, 11.4s Time] [2023-12-21 02:16:32,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2023-12-21 02:16:32,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 324. [2023-12-21 02:16:32,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 291 states have (on average 1.3333333333333333) internal successors, (388), 293 states have internal predecessors, (388), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-21 02:16:32,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 444 transitions. [2023-12-21 02:16:32,223 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 444 transitions. Word has length 114 [2023-12-21 02:16:32,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:16:32,223 INFO L495 AbstractCegarLoop]: Abstraction has 324 states and 444 transitions. [2023-12-21 02:16:32,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.071428571428571) internal successors, (57), 16 states have internal predecessors, (57), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 6 states have call successors, (12) [2023-12-21 02:16:32,223 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 444 transitions. [2023-12-21 02:16:32,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-21 02:16:32,224 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:16:32,224 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:16:32,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-21 02:16:32,224 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:16:32,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:16:32,224 INFO L85 PathProgramCache]: Analyzing trace with hash 892196153, now seen corresponding path program 1 times [2023-12-21 02:16:32,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:16:32,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207656540] [2023-12-21 02:16:32,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:16:32,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:16:32,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:32,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:16:32,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:32,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:16:32,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:32,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:16:32,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:32,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:16:32,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:32,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:16:32,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:32,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:16:32,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:32,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:16:32,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:32,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:16:32,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:32,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:16:32,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:32,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:16:32,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:32,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:16:32,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:32,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:16:32,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:32,392 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:16:32,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:16:32,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207656540] [2023-12-21 02:16:32,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207656540] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:16:32,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:16:32,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 02:16:32,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892758247] [2023-12-21 02:16:32,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:16:32,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 02:16:32,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:16:32,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 02:16:32,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:16:32,393 INFO L87 Difference]: Start difference. First operand 324 states and 444 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:16:32,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:16:32,442 INFO L93 Difference]: Finished difference Result 650 states and 889 transitions. [2023-12-21 02:16:32,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 02:16:32,443 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2023-12-21 02:16:32,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:16:32,444 INFO L225 Difference]: With dead ends: 650 [2023-12-21 02:16:32,444 INFO L226 Difference]: Without dead ends: 327 [2023-12-21 02:16:32,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 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-21 02:16:32,446 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 82 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:16:32,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 589 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:16:32,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2023-12-21 02:16:32,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 324. [2023-12-21 02:16:32,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 291 states have (on average 1.3195876288659794) internal successors, (384), 293 states have internal predecessors, (384), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-21 02:16:32,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 440 transitions. [2023-12-21 02:16:32,467 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 440 transitions. Word has length 115 [2023-12-21 02:16:32,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:16:32,467 INFO L495 AbstractCegarLoop]: Abstraction has 324 states and 440 transitions. [2023-12-21 02:16:32,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:16:32,467 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 440 transitions. [2023-12-21 02:16:32,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-21 02:16:32,468 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:16:32,468 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:16:32,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-21 02:16:32,468 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:16:32,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:16:32,468 INFO L85 PathProgramCache]: Analyzing trace with hash 2040498361, now seen corresponding path program 1 times [2023-12-21 02:16:32,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:16:32,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997454487] [2023-12-21 02:16:32,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:16:32,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:16:32,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:32,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:16:32,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:32,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:16:32,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:32,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:16:32,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:32,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:16:32,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:32,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:16:32,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:32,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:16:32,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:32,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:16:32,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:32,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:16:32,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:32,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:16:32,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:32,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:16:32,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:32,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:16:32,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:32,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:16:32,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:32,623 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:16:32,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:16:32,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997454487] [2023-12-21 02:16:32,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997454487] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:16:32,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:16:32,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 02:16:32,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189538039] [2023-12-21 02:16:32,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:16:32,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 02:16:32,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:16:32,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 02:16:32,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:16:32,626 INFO L87 Difference]: Start difference. First operand 324 states and 440 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:16:32,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:16:32,671 INFO L93 Difference]: Finished difference Result 650 states and 879 transitions. [2023-12-21 02:16:32,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 02:16:32,671 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2023-12-21 02:16:32,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:16:32,673 INFO L225 Difference]: With dead ends: 650 [2023-12-21 02:16:32,673 INFO L226 Difference]: Without dead ends: 327 [2023-12-21 02:16:32,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 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-21 02:16:32,674 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 48 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:16:32,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 489 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:16:32,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2023-12-21 02:16:32,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 322. [2023-12-21 02:16:32,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 289 states have (on average 1.3079584775086506) internal successors, (378), 291 states have internal predecessors, (378), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-21 02:16:32,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 434 transitions. [2023-12-21 02:16:32,691 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 434 transitions. Word has length 116 [2023-12-21 02:16:32,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:16:32,692 INFO L495 AbstractCegarLoop]: Abstraction has 322 states and 434 transitions. [2023-12-21 02:16:32,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:16:32,692 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 434 transitions. [2023-12-21 02:16:32,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-21 02:16:32,693 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:16:32,693 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:16:32,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-21 02:16:32,693 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:16:32,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:16:32,693 INFO L85 PathProgramCache]: Analyzing trace with hash -840713991, now seen corresponding path program 1 times [2023-12-21 02:16:32,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:16:32,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900748113] [2023-12-21 02:16:32,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:16:32,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:16:32,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:33,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:16:33,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:33,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:16:33,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:33,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:16:33,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:33,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:16:33,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:33,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:16:33,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:33,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:16:33,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:33,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:16:33,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:33,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:16:33,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:33,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:16:33,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:33,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:16:33,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:33,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:16:33,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:33,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:16:33,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:33,131 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:16:33,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:16:33,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900748113] [2023-12-21 02:16:33,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900748113] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:16:33,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:16:33,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-21 02:16:33,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652350260] [2023-12-21 02:16:33,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:16:33,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 02:16:33,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:16:33,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 02:16:33,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-21 02:16:33,133 INFO L87 Difference]: Start difference. First operand 322 states and 434 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:16:33,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:16:33,357 INFO L93 Difference]: Finished difference Result 801 states and 1073 transitions. [2023-12-21 02:16:33,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-21 02:16:33,357 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2023-12-21 02:16:33,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:16:33,359 INFO L225 Difference]: With dead ends: 801 [2023-12-21 02:16:33,359 INFO L226 Difference]: Without dead ends: 480 [2023-12-21 02:16:33,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2023-12-21 02:16:33,360 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 169 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 02:16:33,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 804 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 02:16:33,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2023-12-21 02:16:33,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 455. [2023-12-21 02:16:33,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 406 states have (on average 1.2980295566502462) internal successors, (527), 409 states have internal predecessors, (527), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-21 02:16:33,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 611 transitions. [2023-12-21 02:16:33,393 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 611 transitions. Word has length 116 [2023-12-21 02:16:33,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:16:33,393 INFO L495 AbstractCegarLoop]: Abstraction has 455 states and 611 transitions. [2023-12-21 02:16:33,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:16:33,393 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 611 transitions. [2023-12-21 02:16:33,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-21 02:16:33,394 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:16:33,394 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:16:33,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-21 02:16:33,394 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:16:33,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:16:33,395 INFO L85 PathProgramCache]: Analyzing trace with hash -256773164, now seen corresponding path program 1 times [2023-12-21 02:16:33,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:16:33,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607845752] [2023-12-21 02:16:33,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:16:33,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:16:33,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:33,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:16:33,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:33,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:16:33,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:33,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:16:33,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:33,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:16:33,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:33,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:16:33,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:33,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:16:33,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:33,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:16:33,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:33,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:16:33,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:33,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:16:33,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:33,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:16:33,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:33,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:16:33,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:33,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:16:33,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:33,925 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:16:33,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:16:33,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607845752] [2023-12-21 02:16:33,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607845752] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:16:33,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:16:33,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-21 02:16:33,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106247048] [2023-12-21 02:16:33,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:16:33,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-21 02:16:33,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:16:33,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-21 02:16:33,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-12-21 02:16:33,928 INFO L87 Difference]: Start difference. First operand 455 states and 611 transitions. Second operand has 9 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-21 02:16:34,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:16:34,219 INFO L93 Difference]: Finished difference Result 935 states and 1250 transitions. [2023-12-21 02:16:34,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 02:16:34,220 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 117 [2023-12-21 02:16:34,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:16:34,222 INFO L225 Difference]: With dead ends: 935 [2023-12-21 02:16:34,222 INFO L226 Difference]: Without dead ends: 614 [2023-12-21 02:16:34,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2023-12-21 02:16:34,223 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 257 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 02:16:34,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 600 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 02:16:34,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2023-12-21 02:16:34,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 505. [2023-12-21 02:16:34,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 456 states have (on average 1.2960526315789473) internal successors, (591), 459 states have internal predecessors, (591), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-21 02:16:34,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 675 transitions. [2023-12-21 02:16:34,251 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 675 transitions. Word has length 117 [2023-12-21 02:16:34,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:16:34,251 INFO L495 AbstractCegarLoop]: Abstraction has 505 states and 675 transitions. [2023-12-21 02:16:34,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-21 02:16:34,251 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 675 transitions. [2023-12-21 02:16:34,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-21 02:16:34,252 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:16:34,252 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:16:34,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-21 02:16:34,252 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:16:34,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:16:34,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1666454870, now seen corresponding path program 1 times [2023-12-21 02:16:34,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:16:34,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347218180] [2023-12-21 02:16:34,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:16:34,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:16:34,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:34,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:16:34,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:34,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:16:34,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:34,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:16:34,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:34,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:16:34,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:34,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:16:34,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:34,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:16:34,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:34,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:16:34,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:34,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:16:34,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:34,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:16:34,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:34,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:16:34,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:34,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:16:34,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:34,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:16:34,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:34,401 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:16:34,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:16:34,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347218180] [2023-12-21 02:16:34,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347218180] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:16:34,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:16:34,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 02:16:34,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338836180] [2023-12-21 02:16:34,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:16:34,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 02:16:34,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:16:34,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 02:16:34,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:16:34,403 INFO L87 Difference]: Start difference. First operand 505 states and 675 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:16:34,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:16:34,465 INFO L93 Difference]: Finished difference Result 836 states and 1119 transitions. [2023-12-21 02:16:34,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 02:16:34,466 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2023-12-21 02:16:34,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:16:34,469 INFO L225 Difference]: With dead ends: 836 [2023-12-21 02:16:34,469 INFO L226 Difference]: Without dead ends: 465 [2023-12-21 02:16:34,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 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-21 02:16:34,472 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 54 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:16:34,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 603 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:16:34,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2023-12-21 02:16:34,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 307. [2023-12-21 02:16:34,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 274 states have (on average 1.2846715328467153) internal successors, (352), 276 states have internal predecessors, (352), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-21 02:16:34,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 408 transitions. [2023-12-21 02:16:34,495 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 408 transitions. Word has length 117 [2023-12-21 02:16:34,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:16:34,495 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 408 transitions. [2023-12-21 02:16:34,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:16:34,495 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 408 transitions. [2023-12-21 02:16:34,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-21 02:16:34,496 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:16:34,496 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:16:34,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-21 02:16:34,496 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:16:34,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:16:34,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1684184546, now seen corresponding path program 1 times [2023-12-21 02:16:34,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:16:34,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169224311] [2023-12-21 02:16:34,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:16:34,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:16:34,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 02:16:34,558 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-21 02:16:34,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 02:16:34,664 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-21 02:16:34,664 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-21 02:16:34,665 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 02:16:34,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-21 02:16:34,668 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:16:34,672 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 02:16:34,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 02:16:34 BoogieIcfgContainer [2023-12-21 02:16:34,795 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 02:16:34,795 INFO L158 Benchmark]: Toolchain (without parser) took 80850.28ms. Allocated memory was 217.1MB in the beginning and 481.3MB in the end (delta: 264.2MB). Free memory was 151.4MB in the beginning and 365.2MB in the end (delta: -213.8MB). Peak memory consumption was 51.7MB. Max. memory is 8.0GB. [2023-12-21 02:16:34,795 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 217.1MB. Free memory is still 167.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 02:16:34,795 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.23ms. Allocated memory is still 217.1MB. Free memory was 151.4MB in the beginning and 136.7MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-21 02:16:34,796 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.87ms. Allocated memory was 217.1MB in the beginning and 295.7MB in the end (delta: 78.6MB). Free memory was 136.6MB in the beginning and 258.6MB in the end (delta: -121.9MB). Peak memory consumption was 6.5MB. Max. memory is 8.0GB. [2023-12-21 02:16:34,796 INFO L158 Benchmark]: Boogie Preprocessor took 88.11ms. Allocated memory is still 295.7MB. Free memory was 258.6MB in the beginning and 252.8MB in the end (delta: 5.8MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-21 02:16:34,796 INFO L158 Benchmark]: RCFGBuilder took 672.34ms. Allocated memory is still 295.7MB. Free memory was 252.8MB in the beginning and 208.2MB in the end (delta: 44.6MB). Peak memory consumption was 45.1MB. Max. memory is 8.0GB. [2023-12-21 02:16:34,796 INFO L158 Benchmark]: TraceAbstraction took 79804.24ms. Allocated memory was 295.7MB in the beginning and 481.3MB in the end (delta: 185.6MB). Free memory was 207.7MB in the beginning and 365.2MB in the end (delta: -157.5MB). Peak memory consumption was 28.4MB. Max. memory is 8.0GB. [2023-12-21 02:16:34,799 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 217.1MB. Free memory is still 167.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 205.23ms. Allocated memory is still 217.1MB. Free memory was 151.4MB in the beginning and 136.7MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 75.87ms. Allocated memory was 217.1MB in the beginning and 295.7MB in the end (delta: 78.6MB). Free memory was 136.6MB in the beginning and 258.6MB in the end (delta: -121.9MB). Peak memory consumption was 6.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 88.11ms. Allocated memory is still 295.7MB. Free memory was 258.6MB in the beginning and 252.8MB in the end (delta: 5.8MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 672.34ms. Allocated memory is still 295.7MB. Free memory was 252.8MB in the beginning and 208.2MB in the end (delta: 44.6MB). Peak memory consumption was 45.1MB. Max. memory is 8.0GB. * TraceAbstraction took 79804.24ms. Allocated memory was 295.7MB in the beginning and 481.3MB in the end (delta: 185.6MB). Free memory was 207.7MB in the beginning and 365.2MB in the end (delta: -157.5MB). Peak memory consumption was 28.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 someBinaryDOUBLEComparisonOperation at line 88, overapproximation of bitwise operation at line 99, overapproximation of someBinaryArithmeticDOUBLEoperation at line 71. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 0; [L22] unsigned short int var_1_1 = 0; [L23] unsigned short int* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_2 = 0; [L24] unsigned char var_1_2 = 0; [L25] unsigned char* var_1_2_Pointer = &(var_1_2); [L26] unsigned short int var_1_4 = 19138; [L26] unsigned short int var_1_4 = 19138; [L27] unsigned short int* var_1_4_Pointer = &(var_1_4); [L28] signed char var_1_6 = 25; [L28] signed char var_1_6 = 25; [L29] signed char* var_1_6_Pointer = &(var_1_6); [L30] signed long int var_1_7 = -50; [L30] signed long int var_1_7 = -50; [L31] signed long int* var_1_7_Pointer = &(var_1_7); [L32] double var_1_8 = 8.3; [L32] double var_1_8 = 8.3; [L33] double* var_1_8_Pointer = &(var_1_8); [L34] double var_1_9 = 255.6; [L34] double var_1_9 = 255.6; [L35] double* var_1_9_Pointer = &(var_1_9); [L36] double var_1_10 = 10000000.375; [L36] double var_1_10 = 10000000.375; [L37] double* var_1_10_Pointer = &(var_1_10); [L38] double var_1_11 = 0.0; [L38] double var_1_11 = 0.0; [L39] double* var_1_11_Pointer = &(var_1_11); [L40] double var_1_12 = 255.375; [L40] double var_1_12 = 255.375; [L41] double* var_1_12_Pointer = &(var_1_12); [L42] unsigned char var_1_13 = 50; [L42] unsigned char var_1_13 = 50; [L43] unsigned char* var_1_13_Pointer = &(var_1_13); [L44] unsigned char var_1_14 = 2; [L44] unsigned char var_1_14 = 2; [L45] unsigned char* var_1_14_Pointer = &(var_1_14); [L46] signed char var_1_15 = 1; [L46] signed char var_1_15 = 1; [L47] signed char* var_1_15_Pointer = &(var_1_15); [L48] signed char var_1_16 = 5; [L48] signed char var_1_16 = 5; [L49] signed char* var_1_16_Pointer = &(var_1_16); [L103] isInitial = 1 [L104] FCALL initially() [L105] COND TRUE 1 [L106] FCALL updateLastVariables() [L107] CALL updateVariables() [L75] var_1_2 = __VERIFIER_nondet_uchar() [L76] EXPR \read(var_1_2) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L76] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L76] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L77] EXPR \read(var_1_2) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L77] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L77] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L78] var_1_4 = __VERIFIER_nondet_ushort() [L79] EXPR \read(var_1_4) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L79] CALL assume_abort_if_not(var_1_4 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L79] RET assume_abort_if_not(var_1_4 >= 16383) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L80] EXPR \read(var_1_4) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L80] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L80] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L81] var_1_9 = __VERIFIER_nondet_double() [L82] EXPR \read(var_1_9) [L82] EXPR var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L82] EXPR var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F [L82] EXPR \read(var_1_9) [L82] EXPR var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L82] EXPR (var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L82] EXPR (var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L82] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L82] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L83] var_1_10 = __VERIFIER_nondet_double() [L84] EXPR \read(var_1_10) [L84] EXPR var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L84] EXPR var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F [L84] EXPR \read(var_1_10) [L84] EXPR var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L84] EXPR (var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L84] EXPR (var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L84] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L84] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] var_1_11 = __VERIFIER_nondet_double() [L86] EXPR \read(var_1_11) [L86] EXPR var_1_11 >= 4611686.018427382800e+12F && var_1_11 <= -1.0e-20F VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L86] EXPR var_1_11 >= 4611686.018427382800e+12F && var_1_11 <= -1.0e-20F [L86] EXPR \read(var_1_11) [L86] EXPR var_1_11 >= 4611686.018427382800e+12F && var_1_11 <= -1.0e-20F VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L86] EXPR (var_1_11 >= 4611686.018427382800e+12F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L86] EXPR (var_1_11 >= 4611686.018427382800e+12F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L86] CALL assume_abort_if_not((var_1_11 >= 4611686.018427382800e+12F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L86] RET assume_abort_if_not((var_1_11 >= 4611686.018427382800e+12F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] var_1_12 = __VERIFIER_nondet_double() [L88] EXPR \read(var_1_12) [L88] EXPR var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] EXPR var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F [L88] EXPR \read(var_1_12) [L88] EXPR var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] EXPR (var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] EXPR (var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L89] var_1_14 = __VERIFIER_nondet_uchar() [L90] EXPR \read(var_1_14) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] EXPR \read(var_1_14) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L92] var_1_16 = __VERIFIER_nondet_char() [L93] EXPR \read(var_1_16) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L93] CALL assume_abort_if_not(var_1_16 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L93] RET assume_abort_if_not(var_1_16 >= -127) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] EXPR \read(var_1_16) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L107] RET updateVariables() [L108] CALL step() [L53] EXPR \read(*var_1_14_Pointer) [L53] (*(var_1_13_Pointer)) = (*(var_1_14_Pointer)) [L54] EXPR \read(*var_1_16_Pointer) [L54] (*(var_1_15_Pointer)) = (*(var_1_16_Pointer)) [L55] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L55] COND FALSE !((*(var_1_2_Pointer))) [L58] EXPR \read(*var_1_2_Pointer) [L58] (*(var_1_2_Pointer)) && ((*(var_1_4_Pointer)) >= ((*(var_1_13_Pointer)) + (*(var_1_1_Pointer)))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L58] (*(var_1_2_Pointer)) && ((*(var_1_4_Pointer)) >= ((*(var_1_13_Pointer)) + (*(var_1_1_Pointer)))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L58] COND FALSE !((*(var_1_2_Pointer)) && ((*(var_1_4_Pointer)) >= ((*(var_1_13_Pointer)) + (*(var_1_1_Pointer))))) [L61] EXPR \read(*var_1_4_Pointer) [L61] unsigned short int stepLocal_0 = (*(var_1_4_Pointer)); [L62] EXPR \read(*var_1_13_Pointer) [L62] EXPR \read(*var_1_13_Pointer) [L62] EXPR \read(*var_1_13_Pointer) [L62] EXPR (*(var_1_13_Pointer)) << (*(var_1_13_Pointer)) VAL [isInitial=1, stepLocal_0=16383, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L62] EXPR (((*(var_1_13_Pointer))) > (((*(var_1_13_Pointer)) << (*(var_1_13_Pointer))))) ? ((*(var_1_13_Pointer))) : (((*(var_1_13_Pointer)) << (*(var_1_13_Pointer)))) [L62] EXPR \read(*var_1_13_Pointer) [L62] EXPR \read(*var_1_13_Pointer) [L62] EXPR (*(var_1_13_Pointer)) << (*(var_1_13_Pointer)) [L62] EXPR (((*(var_1_13_Pointer))) > (((*(var_1_13_Pointer)) << (*(var_1_13_Pointer))))) ? ((*(var_1_13_Pointer))) : (((*(var_1_13_Pointer)) << (*(var_1_13_Pointer)))) VAL [isInitial=1, stepLocal_0=16383, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L62] COND TRUE stepLocal_0 <= (((((*(var_1_13_Pointer))) > (((*(var_1_13_Pointer)) << (*(var_1_13_Pointer))))) ? ((*(var_1_13_Pointer))) : (((*(var_1_13_Pointer)) << (*(var_1_13_Pointer)))))) [L63] EXPR \read(*var_1_13_Pointer) [L63] EXPR \read(*var_1_13_Pointer) [L63] EXPR \read(*var_1_4_Pointer) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L63] EXPR ((((*(var_1_13_Pointer)) - (*(var_1_13_Pointer)))) < ((*(var_1_4_Pointer)))) ? (((*(var_1_13_Pointer)) - (*(var_1_13_Pointer)))) : ((*(var_1_4_Pointer))) [L63] EXPR \read(*var_1_13_Pointer) [L63] EXPR \read(*var_1_13_Pointer) [L63] EXPR ((((*(var_1_13_Pointer)) - (*(var_1_13_Pointer)))) < ((*(var_1_4_Pointer)))) ? (((*(var_1_13_Pointer)) - (*(var_1_13_Pointer)))) : ((*(var_1_4_Pointer))) VAL [isInitial=1, stepLocal_0=16383, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L63] (*(var_1_7_Pointer)) = ((((((*(var_1_13_Pointer)) - (*(var_1_13_Pointer)))) < ((*(var_1_4_Pointer)))) ? (((*(var_1_13_Pointer)) - (*(var_1_13_Pointer)))) : ((*(var_1_4_Pointer))))) [L67] EXPR \read(*var_1_13_Pointer) [L67] unsigned char stepLocal_1 = (*(var_1_13_Pointer)); [L68] EXPR \read(*var_1_13_Pointer) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L68] COND FALSE !((*(var_1_13_Pointer)) < stepLocal_1) [L71] EXPR \read(*var_1_11_Pointer) [L71] EXPR \read(*var_1_12_Pointer) [L71] EXPR \read(*var_1_9_Pointer) [L71] (*(var_1_8_Pointer)) = (((*(var_1_11_Pointer)) - (*(var_1_12_Pointer))) - (*(var_1_9_Pointer))) [L108] RET step() [L109] CALL, EXPR property() [L99] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] EXPR (*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) ((17222 - (*(var_1_13_Pointer))) + (((((29916) < ((*(var_1_4_Pointer)))) ? (29916) : ((*(var_1_4_Pointer))))) - (*(var_1_13_Pointer)))))) : 1 [L99] EXPR (*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) ((17222 - (*(var_1_13_Pointer))) + (((((29916) < ((*(var_1_4_Pointer)))) ? (29916) : ((*(var_1_4_Pointer))))) - (*(var_1_13_Pointer)))))) : 1 VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] EXPR ((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) ((17222 - (*(var_1_13_Pointer))) + (((((29916) < ((*(var_1_4_Pointer)))) ? (29916) : ((*(var_1_4_Pointer))))) - (*(var_1_13_Pointer)))))) : 1) && (((*(var_1_2_Pointer)) && ((*(var_1_4_Pointer)) >= ((*(var_1_13_Pointer)) + (*(var_1_1_Pointer))))) ? ((*(var_1_6_Pointer)) == ((signed char) 8)) : 1) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] EXPR ((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) ((17222 - (*(var_1_13_Pointer))) + (((((29916) < ((*(var_1_4_Pointer)))) ? (29916) : ((*(var_1_4_Pointer))))) - (*(var_1_13_Pointer)))))) : 1) && (((*(var_1_2_Pointer)) && ((*(var_1_4_Pointer)) >= ((*(var_1_13_Pointer)) + (*(var_1_1_Pointer))))) ? ((*(var_1_6_Pointer)) == ((signed char) 8)) : 1) [L99] EXPR \read(*var_1_2_Pointer) [L99] EXPR (*(var_1_2_Pointer)) && ((*(var_1_4_Pointer)) >= ((*(var_1_13_Pointer)) + (*(var_1_1_Pointer)))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] EXPR (*(var_1_2_Pointer)) && ((*(var_1_4_Pointer)) >= ((*(var_1_13_Pointer)) + (*(var_1_1_Pointer)))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] EXPR ((*(var_1_2_Pointer)) && ((*(var_1_4_Pointer)) >= ((*(var_1_13_Pointer)) + (*(var_1_1_Pointer))))) ? ((*(var_1_6_Pointer)) == ((signed char) 8)) : 1 [L99] EXPR ((*(var_1_2_Pointer)) && ((*(var_1_4_Pointer)) >= ((*(var_1_13_Pointer)) + (*(var_1_1_Pointer))))) ? ((*(var_1_6_Pointer)) == ((signed char) 8)) : 1 VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] EXPR ((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) ((17222 - (*(var_1_13_Pointer))) + (((((29916) < ((*(var_1_4_Pointer)))) ? (29916) : ((*(var_1_4_Pointer))))) - (*(var_1_13_Pointer)))))) : 1) && (((*(var_1_2_Pointer)) && ((*(var_1_4_Pointer)) >= ((*(var_1_13_Pointer)) + (*(var_1_1_Pointer))))) ? ((*(var_1_6_Pointer)) == ((signed char) 8)) : 1) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] EXPR (((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) ((17222 - (*(var_1_13_Pointer))) + (((((29916) < ((*(var_1_4_Pointer)))) ? (29916) : ((*(var_1_4_Pointer))))) - (*(var_1_13_Pointer)))))) : 1) && (((*(var_1_2_Pointer)) && ((*(var_1_4_Pointer)) >= ((*(var_1_13_Pointer)) + (*(var_1_1_Pointer))))) ? ((*(var_1_6_Pointer)) == ((signed char) 8)) : 1)) && (((*(var_1_4_Pointer)) <= (((((*(var_1_13_Pointer))) > (((*(var_1_13_Pointer)) << (*(var_1_13_Pointer))))) ? ((*(var_1_13_Pointer))) : (((*(var_1_13_Pointer)) << (*(var_1_13_Pointer))))))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((*(var_1_13_Pointer)) - (*(var_1_13_Pointer)))) < ((*(var_1_4_Pointer)))) ? (((*(var_1_13_Pointer)) - (*(var_1_13_Pointer)))) : ((*(var_1_4_Pointer))))))) : ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_13_Pointer)) + ((*(var_1_1_Pointer)) + (*(var_1_4_Pointer))))))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] EXPR (((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) ((17222 - (*(var_1_13_Pointer))) + (((((29916) < ((*(var_1_4_Pointer)))) ? (29916) : ((*(var_1_4_Pointer))))) - (*(var_1_13_Pointer)))))) : 1) && (((*(var_1_2_Pointer)) && ((*(var_1_4_Pointer)) >= ((*(var_1_13_Pointer)) + (*(var_1_1_Pointer))))) ? ((*(var_1_6_Pointer)) == ((signed char) 8)) : 1)) && (((*(var_1_4_Pointer)) <= (((((*(var_1_13_Pointer))) > (((*(var_1_13_Pointer)) << (*(var_1_13_Pointer))))) ? ((*(var_1_13_Pointer))) : (((*(var_1_13_Pointer)) << (*(var_1_13_Pointer))))))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((*(var_1_13_Pointer)) - (*(var_1_13_Pointer)))) < ((*(var_1_4_Pointer)))) ? (((*(var_1_13_Pointer)) - (*(var_1_13_Pointer)))) : ((*(var_1_4_Pointer))))))) : ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_13_Pointer)) + ((*(var_1_1_Pointer)) + (*(var_1_4_Pointer))))))) [L99] EXPR \read(*var_1_4_Pointer) [L99] EXPR \read(*var_1_13_Pointer) [L99] EXPR \read(*var_1_13_Pointer) [L99] EXPR \read(*var_1_13_Pointer) [L99] EXPR (*(var_1_13_Pointer)) << (*(var_1_13_Pointer)) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] EXPR (((*(var_1_13_Pointer))) > (((*(var_1_13_Pointer)) << (*(var_1_13_Pointer))))) ? ((*(var_1_13_Pointer))) : (((*(var_1_13_Pointer)) << (*(var_1_13_Pointer)))) [L99] EXPR \read(*var_1_13_Pointer) [L99] EXPR \read(*var_1_13_Pointer) [L99] EXPR (*(var_1_13_Pointer)) << (*(var_1_13_Pointer)) [L99] EXPR (((*(var_1_13_Pointer))) > (((*(var_1_13_Pointer)) << (*(var_1_13_Pointer))))) ? ((*(var_1_13_Pointer))) : (((*(var_1_13_Pointer)) << (*(var_1_13_Pointer)))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] EXPR ((*(var_1_4_Pointer)) <= (((((*(var_1_13_Pointer))) > (((*(var_1_13_Pointer)) << (*(var_1_13_Pointer))))) ? ((*(var_1_13_Pointer))) : (((*(var_1_13_Pointer)) << (*(var_1_13_Pointer))))))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((*(var_1_13_Pointer)) - (*(var_1_13_Pointer)))) < ((*(var_1_4_Pointer)))) ? (((*(var_1_13_Pointer)) - (*(var_1_13_Pointer)))) : ((*(var_1_4_Pointer))))))) : ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_13_Pointer)) + ((*(var_1_1_Pointer)) + (*(var_1_4_Pointer)))))) [L99] EXPR \read(*var_1_7_Pointer) [L99] EXPR \read(*var_1_13_Pointer) [L99] EXPR \read(*var_1_1_Pointer) [L99] EXPR \read(*var_1_4_Pointer) [L99] EXPR ((*(var_1_4_Pointer)) <= (((((*(var_1_13_Pointer))) > (((*(var_1_13_Pointer)) << (*(var_1_13_Pointer))))) ? ((*(var_1_13_Pointer))) : (((*(var_1_13_Pointer)) << (*(var_1_13_Pointer))))))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((*(var_1_13_Pointer)) - (*(var_1_13_Pointer)))) < ((*(var_1_4_Pointer)))) ? (((*(var_1_13_Pointer)) - (*(var_1_13_Pointer)))) : ((*(var_1_4_Pointer))))))) : ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_13_Pointer)) + ((*(var_1_1_Pointer)) + (*(var_1_4_Pointer)))))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] EXPR (((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) ((17222 - (*(var_1_13_Pointer))) + (((((29916) < ((*(var_1_4_Pointer)))) ? (29916) : ((*(var_1_4_Pointer))))) - (*(var_1_13_Pointer)))))) : 1) && (((*(var_1_2_Pointer)) && ((*(var_1_4_Pointer)) >= ((*(var_1_13_Pointer)) + (*(var_1_1_Pointer))))) ? ((*(var_1_6_Pointer)) == ((signed char) 8)) : 1)) && (((*(var_1_4_Pointer)) <= (((((*(var_1_13_Pointer))) > (((*(var_1_13_Pointer)) << (*(var_1_13_Pointer))))) ? ((*(var_1_13_Pointer))) : (((*(var_1_13_Pointer)) << (*(var_1_13_Pointer))))))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((*(var_1_13_Pointer)) - (*(var_1_13_Pointer)))) < ((*(var_1_4_Pointer)))) ? (((*(var_1_13_Pointer)) - (*(var_1_13_Pointer)))) : ((*(var_1_4_Pointer))))))) : ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_13_Pointer)) + ((*(var_1_1_Pointer)) + (*(var_1_4_Pointer))))))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] EXPR ((((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) ((17222 - (*(var_1_13_Pointer))) + (((((29916) < ((*(var_1_4_Pointer)))) ? (29916) : ((*(var_1_4_Pointer))))) - (*(var_1_13_Pointer)))))) : 1) && (((*(var_1_2_Pointer)) && ((*(var_1_4_Pointer)) >= ((*(var_1_13_Pointer)) + (*(var_1_1_Pointer))))) ? ((*(var_1_6_Pointer)) == ((signed char) 8)) : 1)) && (((*(var_1_4_Pointer)) <= (((((*(var_1_13_Pointer))) > (((*(var_1_13_Pointer)) << (*(var_1_13_Pointer))))) ? ((*(var_1_13_Pointer))) : (((*(var_1_13_Pointer)) << (*(var_1_13_Pointer))))))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((*(var_1_13_Pointer)) - (*(var_1_13_Pointer)))) < ((*(var_1_4_Pointer)))) ? (((*(var_1_13_Pointer)) - (*(var_1_13_Pointer)))) : ((*(var_1_4_Pointer))))))) : ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_13_Pointer)) + ((*(var_1_1_Pointer)) + (*(var_1_4_Pointer)))))))) && (((*(var_1_13_Pointer)) < (*(var_1_13_Pointer))) ? ((*(var_1_8_Pointer)) == ((double) ((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (((*(var_1_11_Pointer)) - (*(var_1_12_Pointer))) - (*(var_1_9_Pointer)))))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] EXPR ((((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) ((17222 - (*(var_1_13_Pointer))) + (((((29916) < ((*(var_1_4_Pointer)))) ? (29916) : ((*(var_1_4_Pointer))))) - (*(var_1_13_Pointer)))))) : 1) && (((*(var_1_2_Pointer)) && ((*(var_1_4_Pointer)) >= ((*(var_1_13_Pointer)) + (*(var_1_1_Pointer))))) ? ((*(var_1_6_Pointer)) == ((signed char) 8)) : 1)) && (((*(var_1_4_Pointer)) <= (((((*(var_1_13_Pointer))) > (((*(var_1_13_Pointer)) << (*(var_1_13_Pointer))))) ? ((*(var_1_13_Pointer))) : (((*(var_1_13_Pointer)) << (*(var_1_13_Pointer))))))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((*(var_1_13_Pointer)) - (*(var_1_13_Pointer)))) < ((*(var_1_4_Pointer)))) ? (((*(var_1_13_Pointer)) - (*(var_1_13_Pointer)))) : ((*(var_1_4_Pointer))))))) : ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_13_Pointer)) + ((*(var_1_1_Pointer)) + (*(var_1_4_Pointer)))))))) && (((*(var_1_13_Pointer)) < (*(var_1_13_Pointer))) ? ((*(var_1_8_Pointer)) == ((double) ((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (((*(var_1_11_Pointer)) - (*(var_1_12_Pointer))) - (*(var_1_9_Pointer)))))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] EXPR (((((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) ((17222 - (*(var_1_13_Pointer))) + (((((29916) < ((*(var_1_4_Pointer)))) ? (29916) : ((*(var_1_4_Pointer))))) - (*(var_1_13_Pointer)))))) : 1) && (((*(var_1_2_Pointer)) && ((*(var_1_4_Pointer)) >= ((*(var_1_13_Pointer)) + (*(var_1_1_Pointer))))) ? ((*(var_1_6_Pointer)) == ((signed char) 8)) : 1)) && (((*(var_1_4_Pointer)) <= (((((*(var_1_13_Pointer))) > (((*(var_1_13_Pointer)) << (*(var_1_13_Pointer))))) ? ((*(var_1_13_Pointer))) : (((*(var_1_13_Pointer)) << (*(var_1_13_Pointer))))))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((*(var_1_13_Pointer)) - (*(var_1_13_Pointer)))) < ((*(var_1_4_Pointer)))) ? (((*(var_1_13_Pointer)) - (*(var_1_13_Pointer)))) : ((*(var_1_4_Pointer))))))) : ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_13_Pointer)) + ((*(var_1_1_Pointer)) + (*(var_1_4_Pointer)))))))) && (((*(var_1_13_Pointer)) < (*(var_1_13_Pointer))) ? ((*(var_1_8_Pointer)) == ((double) ((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (((*(var_1_11_Pointer)) - (*(var_1_12_Pointer))) - (*(var_1_9_Pointer))))))) && ((*(var_1_13_Pointer)) == ((unsigned char) (*(var_1_14_Pointer)))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] EXPR (((((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) ((17222 - (*(var_1_13_Pointer))) + (((((29916) < ((*(var_1_4_Pointer)))) ? (29916) : ((*(var_1_4_Pointer))))) - (*(var_1_13_Pointer)))))) : 1) && (((*(var_1_2_Pointer)) && ((*(var_1_4_Pointer)) >= ((*(var_1_13_Pointer)) + (*(var_1_1_Pointer))))) ? ((*(var_1_6_Pointer)) == ((signed char) 8)) : 1)) && (((*(var_1_4_Pointer)) <= (((((*(var_1_13_Pointer))) > (((*(var_1_13_Pointer)) << (*(var_1_13_Pointer))))) ? ((*(var_1_13_Pointer))) : (((*(var_1_13_Pointer)) << (*(var_1_13_Pointer))))))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((*(var_1_13_Pointer)) - (*(var_1_13_Pointer)))) < ((*(var_1_4_Pointer)))) ? (((*(var_1_13_Pointer)) - (*(var_1_13_Pointer)))) : ((*(var_1_4_Pointer))))))) : ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_13_Pointer)) + ((*(var_1_1_Pointer)) + (*(var_1_4_Pointer)))))))) && (((*(var_1_13_Pointer)) < (*(var_1_13_Pointer))) ? ((*(var_1_8_Pointer)) == ((double) ((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (((*(var_1_11_Pointer)) - (*(var_1_12_Pointer))) - (*(var_1_9_Pointer))))))) && ((*(var_1_13_Pointer)) == ((unsigned char) (*(var_1_14_Pointer)))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] EXPR ((((((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) ((17222 - (*(var_1_13_Pointer))) + (((((29916) < ((*(var_1_4_Pointer)))) ? (29916) : ((*(var_1_4_Pointer))))) - (*(var_1_13_Pointer)))))) : 1) && (((*(var_1_2_Pointer)) && ((*(var_1_4_Pointer)) >= ((*(var_1_13_Pointer)) + (*(var_1_1_Pointer))))) ? ((*(var_1_6_Pointer)) == ((signed char) 8)) : 1)) && (((*(var_1_4_Pointer)) <= (((((*(var_1_13_Pointer))) > (((*(var_1_13_Pointer)) << (*(var_1_13_Pointer))))) ? ((*(var_1_13_Pointer))) : (((*(var_1_13_Pointer)) << (*(var_1_13_Pointer))))))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((*(var_1_13_Pointer)) - (*(var_1_13_Pointer)))) < ((*(var_1_4_Pointer)))) ? (((*(var_1_13_Pointer)) - (*(var_1_13_Pointer)))) : ((*(var_1_4_Pointer))))))) : ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_13_Pointer)) + ((*(var_1_1_Pointer)) + (*(var_1_4_Pointer)))))))) && (((*(var_1_13_Pointer)) < (*(var_1_13_Pointer))) ? ((*(var_1_8_Pointer)) == ((double) ((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (((*(var_1_11_Pointer)) - (*(var_1_12_Pointer))) - (*(var_1_9_Pointer))))))) && ((*(var_1_13_Pointer)) == ((unsigned char) (*(var_1_14_Pointer))))) && ((*(var_1_15_Pointer)) == ((signed char) (*(var_1_16_Pointer)))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] EXPR ((((((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) ((17222 - (*(var_1_13_Pointer))) + (((((29916) < ((*(var_1_4_Pointer)))) ? (29916) : ((*(var_1_4_Pointer))))) - (*(var_1_13_Pointer)))))) : 1) && (((*(var_1_2_Pointer)) && ((*(var_1_4_Pointer)) >= ((*(var_1_13_Pointer)) + (*(var_1_1_Pointer))))) ? ((*(var_1_6_Pointer)) == ((signed char) 8)) : 1)) && (((*(var_1_4_Pointer)) <= (((((*(var_1_13_Pointer))) > (((*(var_1_13_Pointer)) << (*(var_1_13_Pointer))))) ? ((*(var_1_13_Pointer))) : (((*(var_1_13_Pointer)) << (*(var_1_13_Pointer))))))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((*(var_1_13_Pointer)) - (*(var_1_13_Pointer)))) < ((*(var_1_4_Pointer)))) ? (((*(var_1_13_Pointer)) - (*(var_1_13_Pointer)))) : ((*(var_1_4_Pointer))))))) : ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_13_Pointer)) + ((*(var_1_1_Pointer)) + (*(var_1_4_Pointer)))))))) && (((*(var_1_13_Pointer)) < (*(var_1_13_Pointer))) ? ((*(var_1_8_Pointer)) == ((double) ((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (((*(var_1_11_Pointer)) - (*(var_1_12_Pointer))) - (*(var_1_9_Pointer))))))) && ((*(var_1_13_Pointer)) == ((unsigned char) (*(var_1_14_Pointer))))) && ((*(var_1_15_Pointer)) == ((signed char) (*(var_1_16_Pointer)))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99-L100] return ((((((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) ((17222 - (*(var_1_13_Pointer))) + (((((29916) < ((*(var_1_4_Pointer)))) ? (29916) : ((*(var_1_4_Pointer))))) - (*(var_1_13_Pointer)))))) : 1) && (((*(var_1_2_Pointer)) && ((*(var_1_4_Pointer)) >= ((*(var_1_13_Pointer)) + (*(var_1_1_Pointer))))) ? ((*(var_1_6_Pointer)) == ((signed char) 8)) : 1)) && (((*(var_1_4_Pointer)) <= (((((*(var_1_13_Pointer))) > (((*(var_1_13_Pointer)) << (*(var_1_13_Pointer))))) ? ((*(var_1_13_Pointer))) : (((*(var_1_13_Pointer)) << (*(var_1_13_Pointer))))))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((*(var_1_13_Pointer)) - (*(var_1_13_Pointer)))) < ((*(var_1_4_Pointer)))) ? (((*(var_1_13_Pointer)) - (*(var_1_13_Pointer)))) : ((*(var_1_4_Pointer))))))) : ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_13_Pointer)) + ((*(var_1_1_Pointer)) + (*(var_1_4_Pointer)))))))) && (((*(var_1_13_Pointer)) < (*(var_1_13_Pointer))) ? ((*(var_1_8_Pointer)) == ((double) ((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (((*(var_1_11_Pointer)) - (*(var_1_12_Pointer))) - (*(var_1_9_Pointer))))))) && ((*(var_1_13_Pointer)) == ((unsigned char) (*(var_1_14_Pointer))))) && ((*(var_1_15_Pointer)) == ((signed char) (*(var_1_16_Pointer)))) ; [L109] RET, EXPR property() [L109] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 94 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 79.6s, OverallIterations: 20, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 36.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 2230 SdHoareTripleChecker+Valid, 12.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2229 mSDsluCounter, 11782 SdHoareTripleChecker+Invalid, 12.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8798 mSDsCounter, 80 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2619 IncrementalHoareTripleChecker+Invalid, 2700 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 80 mSolverCounterUnsat, 2984 mSDtfsCounter, 2619 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 645 GetRequests, 513 SyntacticMatches, 4 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 36.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=505occurred in iteration=18, InterpolantAutomatonStates: 139, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 1300 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 41.5s InterpolantComputationTime, 2275 NumberOfCodeBlocks, 2275 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 2138 ConstructedInterpolants, 0 QuantifiedInterpolants, 8526 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 5016/5016 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-12-21 02:16:34,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...