./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-63.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9c2d9fe6cca3f07b0ec4ef0cef7c77d56847aacde02fd15a5949ee3e6a04e48b --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:54:47,598 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:54:47,681 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 01:54:47,687 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:54:47,688 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:54:47,716 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:54:47,717 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:54:47,717 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:54:47,718 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:54:47,719 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:54:47,719 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:54:47,720 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:54:47,721 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:54:47,721 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:54:47,723 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:54:47,723 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:54:47,724 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:54:47,724 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:54:47,724 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:54:47,724 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:54:47,725 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:54:47,728 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:54:47,728 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:54:47,728 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:54:47,729 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:54:47,729 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:54:47,729 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:54:47,729 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:54:47,730 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:54:47,730 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:54:47,730 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:54:47,730 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:54:47,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:54:47,731 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:54:47,731 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:54:47,732 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:54:47,732 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 01:54:47,732 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:54:47,732 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:54:47,732 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:54:47,733 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:54:47,733 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:54:47,733 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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9c2d9fe6cca3f07b0ec4ef0cef7c77d56847aacde02fd15a5949ee3e6a04e48b [2024-11-09 01:54:47,977 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:54:48,004 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:54:48,008 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:54:48,010 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:54:48,010 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:54:48,011 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-63.i [2024-11-09 01:54:49,490 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:54:49,732 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:54:49,733 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-63.i [2024-11-09 01:54:49,747 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5cc64106/214a810187c247ca9de2305ae1ce7426/FLAGc65dfed1d [2024-11-09 01:54:49,766 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5cc64106/214a810187c247ca9de2305ae1ce7426 [2024-11-09 01:54:49,769 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:54:49,770 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:54:49,773 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:54:49,774 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:54:49,779 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:54:49,780 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:54:49" (1/1) ... [2024-11-09 01:54:49,782 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ebee5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:54:49, skipping insertion in model container [2024-11-09 01:54:49,783 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:54:49" (1/1) ... [2024-11-09 01:54:49,815 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:54:49,995 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-63.i[916,929] [2024-11-09 01:54:50,078 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:54:50,097 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:54:50,111 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-63.i[916,929] [2024-11-09 01:54:50,169 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:54:50,203 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:54:50,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:54:50 WrapperNode [2024-11-09 01:54:50,207 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:54:50,208 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:54:50,208 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:54:50,209 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:54:50,216 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:54:50" (1/1) ... [2024-11-09 01:54:50,229 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:54:50" (1/1) ... [2024-11-09 01:54:50,274 INFO L138 Inliner]: procedures = 29, calls = 221, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 711 [2024-11-09 01:54:50,274 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:54:50,275 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:54:50,275 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:54:50,275 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:54:50,286 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:54:50" (1/1) ... [2024-11-09 01:54:50,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:54:50" (1/1) ... [2024-11-09 01:54:50,291 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:54:50" (1/1) ... [2024-11-09 01:54:50,335 INFO L175 MemorySlicer]: Split 174 memory accesses to 19 slices as follows [2, 3, 14, 12, 10, 8, 5, 8, 3, 6, 31, 10, 8, 6, 8, 8, 8, 19, 5]. 18 percent of accesses are in the largest equivalence class. The 20 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 19 writes are split as follows [0, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. [2024-11-09 01:54:50,336 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:54:50" (1/1) ... [2024-11-09 01:54:50,336 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:54:50" (1/1) ... [2024-11-09 01:54:50,369 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:54:50" (1/1) ... [2024-11-09 01:54:50,379 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:54:50" (1/1) ... [2024-11-09 01:54:50,388 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:54:50" (1/1) ... [2024-11-09 01:54:50,394 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:54:50" (1/1) ... [2024-11-09 01:54:50,409 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:54:50,415 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:54:50,415 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:54:50,415 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:54:50,416 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:54:50" (1/1) ... [2024-11-09 01:54:50,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:54:50,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:54:50,459 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) [2024-11-09 01:54:50,462 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 [2024-11-09 01:54:50,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:54:50,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-09 01:54:50,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-09 01:54:50,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-09 01:54:50,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-09 01:54:50,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-09 01:54:50,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-09 01:54:50,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-09 01:54:50,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-11-09 01:54:50,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-11-09 01:54:50,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-11-09 01:54:50,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-11-09 01:54:50,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2024-11-09 01:54:50,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2024-11-09 01:54:50,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2024-11-09 01:54:50,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2024-11-09 01:54:50,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#15 [2024-11-09 01:54:50,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#16 [2024-11-09 01:54:50,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#17 [2024-11-09 01:54:50,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#18 [2024-11-09 01:54:50,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 01:54:50,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 01:54:50,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 01:54:50,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 01:54:50,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-09 01:54:50,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-09 01:54:50,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-09 01:54:50,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-09 01:54:50,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-09 01:54:50,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-09 01:54:50,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-09 01:54:50,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-11-09 01:54:50,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-11-09 01:54:50,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-11-09 01:54:50,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-11-09 01:54:50,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2024-11-09 01:54:50,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2024-11-09 01:54:50,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2024-11-09 01:54:50,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2024-11-09 01:54:50,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-09 01:54:50,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-09 01:54:50,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-09 01:54:50,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-09 01:54:50,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-09 01:54:50,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-09 01:54:50,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-09 01:54:50,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-11-09 01:54:50,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-11-09 01:54:50,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-11-09 01:54:50,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-11-09 01:54:50,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2024-11-09 01:54:50,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2024-11-09 01:54:50,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2024-11-09 01:54:50,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2024-11-09 01:54:50,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#15 [2024-11-09 01:54:50,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#16 [2024-11-09 01:54:50,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#17 [2024-11-09 01:54:50,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#18 [2024-11-09 01:54:50,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 01:54:50,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 01:54:50,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 01:54:50,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 01:54:50,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-09 01:54:50,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-09 01:54:50,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-09 01:54:50,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-09 01:54:50,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-09 01:54:50,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-09 01:54:50,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-09 01:54:50,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-11-09 01:54:50,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-11-09 01:54:50,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-11-09 01:54:50,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-11-09 01:54:50,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2024-11-09 01:54:50,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2024-11-09 01:54:50,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2024-11-09 01:54:50,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2024-11-09 01:54:50,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-09 01:54:50,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-09 01:54:50,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-09 01:54:50,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-09 01:54:50,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-09 01:54:50,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-09 01:54:50,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-09 01:54:50,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-11-09 01:54:50,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-11-09 01:54:50,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-11-09 01:54:50,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-11-09 01:54:50,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2024-11-09 01:54:50,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2024-11-09 01:54:50,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2024-11-09 01:54:50,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2024-11-09 01:54:50,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#15 [2024-11-09 01:54:50,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#16 [2024-11-09 01:54:50,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#17 [2024-11-09 01:54:50,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#18 [2024-11-09 01:54:50,530 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:54:50,531 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:54:50,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 01:54:50,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 01:54:50,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 01:54:50,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 01:54:50,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-09 01:54:50,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-09 01:54:50,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-09 01:54:50,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-09 01:54:50,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-09 01:54:50,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-09 01:54:50,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-09 01:54:50,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-09 01:54:50,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-09 01:54:50,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-09 01:54:50,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-11-09 01:54:50,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-11-09 01:54:50,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-11-09 01:54:50,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-11-09 01:54:50,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-11-09 01:54:50,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:54:50,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:54:50,763 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:54:50,765 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:54:51,370 INFO L? ?]: Removed 201 outVars from TransFormulas that were not future-live. [2024-11-09 01:54:51,370 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:54:51,384 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:54:51,384 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:54:51,384 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:54:51 BoogieIcfgContainer [2024-11-09 01:54:51,385 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:54:51,387 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:54:51,387 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:54:51,390 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:54:51,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:54:49" (1/3) ... [2024-11-09 01:54:51,391 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75c2c577 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:54:51, skipping insertion in model container [2024-11-09 01:54:51,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:54:50" (2/3) ... [2024-11-09 01:54:51,391 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75c2c577 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:54:51, skipping insertion in model container [2024-11-09 01:54:51,392 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:54:51" (3/3) ... [2024-11-09 01:54:51,393 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-63.i [2024-11-09 01:54:51,409 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:54:51,409 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:54:51,489 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:54:51,496 INFO L333 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, 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;@e70b1a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:54:51,497 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:54:51,503 INFO L276 IsEmpty]: Start isEmpty. Operand has 139 states, 118 states have (on average 1.4322033898305084) internal successors, (169), 119 states have internal predecessors, (169), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 01:54:51,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-09 01:54:51,516 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:54:51,517 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:54:51,517 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:54:51,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:54:51,522 INFO L85 PathProgramCache]: Analyzing trace with hash -16098142, now seen corresponding path program 1 times [2024-11-09 01:54:51,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:54:51,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771465226] [2024-11-09 01:54:51,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:54:51,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:54:51,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:51,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 01:54:51,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:51,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:54:51,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:51,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 01:54:51,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:51,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:54:51,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:51,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:54:51,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:52,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:54:52,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:52,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:54:52,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:52,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:54:52,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:52,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:54:52,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:52,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:54:52,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:52,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:54:52,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:52,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:54:52,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:52,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:54:52,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:52,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:54:52,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:52,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:54:52,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:52,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:54:52,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:52,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:54:52,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:52,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 01:54:52,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:52,117 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:54:52,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:54:52,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771465226] [2024-11-09 01:54:52,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771465226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:54:52,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:54:52,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:54:52,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215273663] [2024-11-09 01:54:52,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:54:52,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:54:52,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:54:52,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:54:52,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:54:52,154 INFO L87 Difference]: Start difference. First operand has 139 states, 118 states have (on average 1.4322033898305084) internal successors, (169), 119 states have internal predecessors, (169), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 01:54:52,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:54:52,192 INFO L93 Difference]: Finished difference Result 271 states and 422 transitions. [2024-11-09 01:54:52,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:54:52,196 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 156 [2024-11-09 01:54:52,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:54:52,205 INFO L225 Difference]: With dead ends: 271 [2024-11-09 01:54:52,205 INFO L226 Difference]: Without dead ends: 135 [2024-11-09 01:54:52,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:54:52,213 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:54:52,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:54:52,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-09 01:54:52,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-11-09 01:54:52,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 115 states have (on average 1.4086956521739131) internal successors, (162), 115 states have internal predecessors, (162), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 01:54:52,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 198 transitions. [2024-11-09 01:54:52,265 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 198 transitions. Word has length 156 [2024-11-09 01:54:52,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:54:52,265 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 198 transitions. [2024-11-09 01:54:52,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 01:54:52,266 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 198 transitions. [2024-11-09 01:54:52,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-09 01:54:52,269 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:54:52,269 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:54:52,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 01:54:52,270 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:54:52,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:54:52,270 INFO L85 PathProgramCache]: Analyzing trace with hash 413675062, now seen corresponding path program 1 times [2024-11-09 01:54:52,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:54:52,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352925463] [2024-11-09 01:54:52,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:54:52,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:54:52,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:52,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 01:54:52,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:52,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:54:52,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:52,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 01:54:52,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:52,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:54:52,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:52,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:54:52,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:52,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:54:52,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:52,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:54:52,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:52,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:54:52,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:52,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:54:52,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:52,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:54:52,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:52,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:54:52,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:52,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:54:52,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:52,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:54:52,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:52,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:54:52,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:52,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:54:52,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:52,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:54:52,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:52,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:54:52,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:52,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 01:54:52,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:52,863 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:54:52,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:54:52,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352925463] [2024-11-09 01:54:52,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352925463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:54:52,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:54:52,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:54:52,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618951500] [2024-11-09 01:54:52,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:54:52,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:54:52,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:54:52,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:54:52,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:54:52,867 INFO L87 Difference]: Start difference. First operand 135 states and 198 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:54:52,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:54:52,926 INFO L93 Difference]: Finished difference Result 269 states and 396 transitions. [2024-11-09 01:54:52,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:54:52,926 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 156 [2024-11-09 01:54:52,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:54:52,929 INFO L225 Difference]: With dead ends: 269 [2024-11-09 01:54:52,929 INFO L226 Difference]: Without dead ends: 137 [2024-11-09 01:54:52,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:54:52,931 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:54:52,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 577 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:54:52,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-09 01:54:52,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-11-09 01:54:52,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 117 states have (on average 1.4017094017094016) internal successors, (164), 117 states have internal predecessors, (164), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 01:54:52,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 200 transitions. [2024-11-09 01:54:52,948 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 200 transitions. Word has length 156 [2024-11-09 01:54:52,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:54:52,950 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 200 transitions. [2024-11-09 01:54:52,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:54:52,954 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 200 transitions. [2024-11-09 01:54:52,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-09 01:54:52,957 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:54:52,957 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:54:52,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 01:54:52,957 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:54:52,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:54:52,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1261194609, now seen corresponding path program 1 times [2024-11-09 01:54:52,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:54:52,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333224447] [2024-11-09 01:54:52,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:54:52,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:54:53,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:53,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 01:54:53,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:53,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:54:53,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:53,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 01:54:53,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:53,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:54:53,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:53,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:54:53,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:53,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:54:53,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:53,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:54:53,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:53,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:54:53,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:53,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:54:53,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:53,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:54:53,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:53,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:54:53,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:53,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:54:53,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:53,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:54:53,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:53,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:54:53,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:53,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:54:53,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:53,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:54:53,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:53,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:54:53,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:53,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 01:54:53,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:53,258 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:54:53,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:54:53,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333224447] [2024-11-09 01:54:53,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333224447] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:54:53,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:54:53,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:54:53,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820309892] [2024-11-09 01:54:53,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:54:53,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:54:53,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:54:53,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:54:53,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:54:53,262 INFO L87 Difference]: Start difference. First operand 137 states and 200 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:54:53,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:54:53,294 INFO L93 Difference]: Finished difference Result 274 states and 401 transitions. [2024-11-09 01:54:53,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:54:53,295 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2024-11-09 01:54:53,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:54:53,297 INFO L225 Difference]: With dead ends: 274 [2024-11-09 01:54:53,297 INFO L226 Difference]: Without dead ends: 140 [2024-11-09 01:54:53,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:54:53,299 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 1 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:54:53,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 574 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:54:53,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-09 01:54:53,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2024-11-09 01:54:53,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 119 states have (on average 1.3949579831932772) internal successors, (166), 119 states have internal predecessors, (166), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 01:54:53,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 202 transitions. [2024-11-09 01:54:53,318 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 202 transitions. Word has length 158 [2024-11-09 01:54:53,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:54:53,321 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 202 transitions. [2024-11-09 01:54:53,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:54:53,321 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 202 transitions. [2024-11-09 01:54:53,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-09 01:54:53,323 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:54:53,323 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:54:53,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 01:54:53,324 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:54:53,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:54:53,324 INFO L85 PathProgramCache]: Analyzing trace with hash 674388595, now seen corresponding path program 1 times [2024-11-09 01:54:53,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:54:53,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316481103] [2024-11-09 01:54:53,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:54:53,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:54:53,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:53,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 01:54:53,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:53,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:54:53,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:53,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 01:54:53,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:53,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:54:53,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:53,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:54:53,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:53,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:54:53,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:53,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:54:53,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:53,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:54:53,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:53,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:54:53,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:53,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:54:53,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:53,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:54:53,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:53,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:54:53,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:53,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:54:53,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:53,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:54:53,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:53,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:54:53,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:53,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:54:53,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:53,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:54:53,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:53,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 01:54:53,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:53,600 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:54:53,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:54:53,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316481103] [2024-11-09 01:54:53,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316481103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:54:53,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:54:53,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:54:53,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828353609] [2024-11-09 01:54:53,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:54:53,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:54:53,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:54:53,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:54:53,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:54:53,604 INFO L87 Difference]: Start difference. First operand 139 states and 202 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:54:53,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:54:53,639 INFO L93 Difference]: Finished difference Result 278 states and 405 transitions. [2024-11-09 01:54:53,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:54:53,640 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2024-11-09 01:54:53,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:54:53,642 INFO L225 Difference]: With dead ends: 278 [2024-11-09 01:54:53,642 INFO L226 Difference]: Without dead ends: 142 [2024-11-09 01:54:53,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:54:53,648 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 1 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:54:53,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 574 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:54:53,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-09 01:54:53,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2024-11-09 01:54:53,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 121 states have (on average 1.3884297520661157) internal successors, (168), 121 states have internal predecessors, (168), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 01:54:53,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 204 transitions. [2024-11-09 01:54:53,668 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 204 transitions. Word has length 158 [2024-11-09 01:54:53,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:54:53,669 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 204 transitions. [2024-11-09 01:54:53,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:54:53,670 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 204 transitions. [2024-11-09 01:54:53,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-09 01:54:53,673 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:54:53,673 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:54:53,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 01:54:53,673 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:54:53,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:54:53,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1354446965, now seen corresponding path program 1 times [2024-11-09 01:54:53,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:54:53,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452659398] [2024-11-09 01:54:53,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:54:53,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:54:53,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:53,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 01:54:53,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:53,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:54:53,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:53,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 01:54:53,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:53,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:54:53,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:53,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:54:53,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:53,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:54:53,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:53,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:54:53,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:53,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:54:53,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:53,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:54:53,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:53,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:54:53,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:53,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:54:53,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:53,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:54:53,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:53,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:54:53,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:53,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:54:53,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:53,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:54:53,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:53,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:54:53,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:53,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:54:53,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:53,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 01:54:53,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:53,890 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:54:53,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:54:53,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452659398] [2024-11-09 01:54:53,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452659398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:54:53,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:54:53,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:54:53,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057329482] [2024-11-09 01:54:53,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:54:53,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:54:53,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:54:53,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:54:53,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:54:53,895 INFO L87 Difference]: Start difference. First operand 141 states and 204 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:54:53,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:54:53,923 INFO L93 Difference]: Finished difference Result 282 states and 409 transitions. [2024-11-09 01:54:53,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:54:53,924 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2024-11-09 01:54:53,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:54:53,926 INFO L225 Difference]: With dead ends: 282 [2024-11-09 01:54:53,927 INFO L226 Difference]: Without dead ends: 144 [2024-11-09 01:54:53,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:54:53,931 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 1 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:54:53,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 575 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:54:53,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-09 01:54:53,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2024-11-09 01:54:53,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 123 states have (on average 1.3821138211382114) internal successors, (170), 123 states have internal predecessors, (170), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 01:54:53,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 206 transitions. [2024-11-09 01:54:53,947 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 206 transitions. Word has length 158 [2024-11-09 01:54:53,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:54:53,947 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 206 transitions. [2024-11-09 01:54:53,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:54:53,949 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 206 transitions. [2024-11-09 01:54:53,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-09 01:54:53,951 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:54:53,951 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:54:53,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 01:54:53,953 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:54:53,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:54:53,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1165512969, now seen corresponding path program 1 times [2024-11-09 01:54:53,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:54:53,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309124385] [2024-11-09 01:54:53,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:54:53,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:54:54,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:54,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 01:54:54,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:54,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:54:54,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:54,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 01:54:54,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:54,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:54:54,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:54,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:54:54,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:54,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:54:54,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:54,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:54:54,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:54,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:54:54,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:54,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:54:54,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:54,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:54:54,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:54,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:54:54,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:54,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:54:54,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:54,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:54:54,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:54,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:54:54,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:54,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:54:54,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:54,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:54:54,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:54,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:54:54,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:54,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 01:54:54,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:54,155 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:54:54,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:54:54,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309124385] [2024-11-09 01:54:54,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309124385] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:54:54,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:54:54,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:54:54,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902127299] [2024-11-09 01:54:54,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:54:54,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:54:54,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:54:54,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:54:54,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:54:54,158 INFO L87 Difference]: Start difference. First operand 143 states and 206 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:54:54,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:54:54,182 INFO L93 Difference]: Finished difference Result 286 states and 413 transitions. [2024-11-09 01:54:54,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:54:54,183 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2024-11-09 01:54:54,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:54:54,184 INFO L225 Difference]: With dead ends: 286 [2024-11-09 01:54:54,185 INFO L226 Difference]: Without dead ends: 146 [2024-11-09 01:54:54,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:54:54,186 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 1 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:54:54,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 577 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:54:54,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-09 01:54:54,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2024-11-09 01:54:54,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 125 states have (on average 1.376) internal successors, (172), 125 states have internal predecessors, (172), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 01:54:54,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 208 transitions. [2024-11-09 01:54:54,200 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 208 transitions. Word has length 158 [2024-11-09 01:54:54,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:54:54,200 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 208 transitions. [2024-11-09 01:54:54,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:54:54,201 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 208 transitions. [2024-11-09 01:54:54,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-09 01:54:54,202 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:54:54,202 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:54:54,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 01:54:54,202 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:54:54,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:54:54,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1163665927, now seen corresponding path program 1 times [2024-11-09 01:54:54,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:54:54,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819850798] [2024-11-09 01:54:54,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:54:54,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:54:54,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:55,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 01:54:55,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:55,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:54:55,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:55,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 01:54:55,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:55,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:54:55,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:55,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:54:55,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:55,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:54:55,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:55,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:54:55,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:55,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:54:55,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:55,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:54:55,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:55,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:54:55,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:55,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:54:55,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:55,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:54:55,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:55,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:54:55,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:55,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:54:55,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:55,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:54:55,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:55,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:54:55,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:55,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:54:55,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:55,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 01:54:55,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:55,198 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-09 01:54:55,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:54:55,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819850798] [2024-11-09 01:54:55,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819850798] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:54:55,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476392190] [2024-11-09 01:54:55,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:54:55,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:54:55,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:54:55,201 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:54:55,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 01:54:55,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:55,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 722 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 01:54:55,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:54:55,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 01:54:56,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-09 01:54:56,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2024-11-09 01:54:56,262 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 13 proven. 263 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2024-11-09 01:54:56,263 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:54:56,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2024-11-09 01:54:56,697 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-09 01:54:56,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476392190] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:54:56,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:54:56,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 16 [2024-11-09 01:54:56,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454276412] [2024-11-09 01:54:56,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:54:56,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 01:54:56,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:54:56,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 01:54:56,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2024-11-09 01:54:56,700 INFO L87 Difference]: Start difference. First operand 145 states and 208 transitions. Second operand has 16 states, 14 states have (on average 7.357142857142857) internal successors, (103), 16 states have internal predecessors, (103), 6 states have call successors, (37), 3 states have call predecessors, (37), 5 states have return successors, (37), 4 states have call predecessors, (37), 6 states have call successors, (37) [2024-11-09 01:54:57,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:54:57,233 INFO L93 Difference]: Finished difference Result 299 states and 423 transitions. [2024-11-09 01:54:57,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 01:54:57,234 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 7.357142857142857) internal successors, (103), 16 states have internal predecessors, (103), 6 states have call successors, (37), 3 states have call predecessors, (37), 5 states have return successors, (37), 4 states have call predecessors, (37), 6 states have call successors, (37) Word has length 158 [2024-11-09 01:54:57,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:54:57,235 INFO L225 Difference]: With dead ends: 299 [2024-11-09 01:54:57,236 INFO L226 Difference]: Without dead ends: 157 [2024-11-09 01:54:57,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 345 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=635, Unknown=0, NotChecked=0, Total=870 [2024-11-09 01:54:57,237 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 796 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 796 SdHoareTripleChecker+Valid, 954 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:54:57,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [796 Valid, 954 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:54:57,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-09 01:54:57,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 153. [2024-11-09 01:54:57,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 131 states have (on average 1.3511450381679388) internal successors, (177), 131 states have internal predecessors, (177), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 01:54:57,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 213 transitions. [2024-11-09 01:54:57,248 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 213 transitions. Word has length 158 [2024-11-09 01:54:57,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:54:57,248 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 213 transitions. [2024-11-09 01:54:57,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 7.357142857142857) internal successors, (103), 16 states have internal predecessors, (103), 6 states have call successors, (37), 3 states have call predecessors, (37), 5 states have return successors, (37), 4 states have call predecessors, (37), 6 states have call successors, (37) [2024-11-09 01:54:57,249 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 213 transitions. [2024-11-09 01:54:57,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-09 01:54:57,250 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:54:57,250 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:54:57,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 01:54:57,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:54:57,455 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:54:57,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:54:57,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1137156663, now seen corresponding path program 1 times [2024-11-09 01:54:57,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:54:57,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149168974] [2024-11-09 01:54:57,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:54:57,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:54:57,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:57,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 01:54:57,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:57,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:54:57,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:57,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 01:54:57,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:57,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:54:57,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:57,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:54:57,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:57,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:54:57,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:57,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:54:58,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:58,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:54:58,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:58,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:54:58,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:58,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:54:58,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:58,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:54:58,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:58,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:54:58,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:58,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:54:58,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:58,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:54:58,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:58,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:54:58,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:58,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:54:58,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:58,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:54:58,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:58,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 01:54:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:58,064 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:54:58,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:54:58,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149168974] [2024-11-09 01:54:58,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149168974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:54:58,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:54:58,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 01:54:58,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612074809] [2024-11-09 01:54:58,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:54:58,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:54:58,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:54:58,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:54:58,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:54:58,067 INFO L87 Difference]: Start difference. First operand 153 states and 213 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:54:58,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:54:58,143 INFO L93 Difference]: Finished difference Result 451 states and 631 transitions. [2024-11-09 01:54:58,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 01:54:58,144 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2024-11-09 01:54:58,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:54:58,146 INFO L225 Difference]: With dead ends: 451 [2024-11-09 01:54:58,146 INFO L226 Difference]: Without dead ends: 301 [2024-11-09 01:54:58,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:54:58,147 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 128 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:54:58,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 945 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:54:58,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-11-09 01:54:58,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 295. [2024-11-09 01:54:58,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 252 states have (on average 1.3571428571428572) internal successors, (342), 252 states have internal predecessors, (342), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-09 01:54:58,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 414 transitions. [2024-11-09 01:54:58,168 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 414 transitions. Word has length 158 [2024-11-09 01:54:58,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:54:58,168 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 414 transitions. [2024-11-09 01:54:58,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:54:58,169 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 414 transitions. [2024-11-09 01:54:58,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-09 01:54:58,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:54:58,171 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:54:58,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 01:54:58,171 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:54:58,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:54:58,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1423596816, now seen corresponding path program 1 times [2024-11-09 01:54:58,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:54:58,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087654090] [2024-11-09 01:54:58,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:54:58,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:54:58,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:58,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 01:54:58,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:58,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:54:58,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:58,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 01:54:58,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:58,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:54:58,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:58,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:54:58,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:58,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:54:58,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:58,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:54:58,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:58,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:54:58,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:58,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:54:58,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:58,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:54:58,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:58,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:54:58,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:58,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:54:58,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:58,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:54:58,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:58,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:54:58,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:58,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:54:58,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:58,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:54:58,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:58,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:54:58,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:58,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 01:54:58,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:58,912 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:54:58,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:54:58,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087654090] [2024-11-09 01:54:58,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087654090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:54:58,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:54:58,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 01:54:58,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385136258] [2024-11-09 01:54:58,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:54:58,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:54:58,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:54:58,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:54:58,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:54:58,916 INFO L87 Difference]: Start difference. First operand 295 states and 414 transitions. Second operand has 8 states, 7 states have (on average 10.428571428571429) internal successors, (73), 8 states have internal predecessors, (73), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-09 01:54:59,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:54:59,161 INFO L93 Difference]: Finished difference Result 641 states and 895 transitions. [2024-11-09 01:54:59,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:54:59,162 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.428571428571429) internal successors, (73), 8 states have internal predecessors, (73), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 160 [2024-11-09 01:54:59,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:54:59,165 INFO L225 Difference]: With dead ends: 641 [2024-11-09 01:54:59,165 INFO L226 Difference]: Without dead ends: 349 [2024-11-09 01:54:59,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-09 01:54:59,168 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 295 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:54:59,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 969 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:54:59,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-11-09 01:54:59,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 348. [2024-11-09 01:54:59,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 295 states have (on average 1.3457627118644069) internal successors, (397), 296 states have internal predecessors, (397), 42 states have call successors, (42), 10 states have call predecessors, (42), 10 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-09 01:54:59,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 481 transitions. [2024-11-09 01:54:59,216 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 481 transitions. Word has length 160 [2024-11-09 01:54:59,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:54:59,219 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 481 transitions. [2024-11-09 01:54:59,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.428571428571429) internal successors, (73), 8 states have internal predecessors, (73), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-09 01:54:59,219 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 481 transitions. [2024-11-09 01:54:59,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-09 01:54:59,221 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:54:59,221 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:54:59,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 01:54:59,222 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:54:59,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:54:59,222 INFO L85 PathProgramCache]: Analyzing trace with hash -2010402830, now seen corresponding path program 1 times [2024-11-09 01:54:59,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:54:59,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363921195] [2024-11-09 01:54:59,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:54:59,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:54:59,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:59,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 01:54:59,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:59,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:54:59,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:59,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 01:54:59,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:59,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:54:59,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:59,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:54:59,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:59,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:54:59,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:59,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:54:59,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:59,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:54:59,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:59,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:54:59,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:59,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:54:59,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:59,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:54:59,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:59,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:54:59,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:59,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:54:59,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:59,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:54:59,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:59,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:54:59,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:59,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:54:59,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:59,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:54:59,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:59,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 01:54:59,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:54:59,589 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:54:59,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:54:59,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363921195] [2024-11-09 01:54:59,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363921195] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:54:59,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:54:59,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:54:59,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077004711] [2024-11-09 01:54:59,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:54:59,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:54:59,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:54:59,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:54:59,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:54:59,592 INFO L87 Difference]: Start difference. First operand 348 states and 481 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:54:59,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:54:59,729 INFO L93 Difference]: Finished difference Result 914 states and 1256 transitions. [2024-11-09 01:54:59,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:54:59,729 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 160 [2024-11-09 01:54:59,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:54:59,734 INFO L225 Difference]: With dead ends: 914 [2024-11-09 01:54:59,734 INFO L226 Difference]: Without dead ends: 610 [2024-11-09 01:54:59,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:54:59,736 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 149 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1272 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:54:59,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1272 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:54:59,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2024-11-09 01:54:59,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 490. [2024-11-09 01:54:59,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 415 states have (on average 1.3325301204819278) internal successors, (553), 417 states have internal predecessors, (553), 60 states have call successors, (60), 14 states have call predecessors, (60), 14 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-09 01:54:59,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 673 transitions. [2024-11-09 01:54:59,782 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 673 transitions. Word has length 160 [2024-11-09 01:54:59,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:54:59,782 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 673 transitions. [2024-11-09 01:54:59,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:54:59,783 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 673 transitions. [2024-11-09 01:54:59,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-09 01:54:59,784 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:54:59,784 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:54:59,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 01:54:59,785 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:54:59,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:54:59,785 INFO L85 PathProgramCache]: Analyzing trace with hash -863949156, now seen corresponding path program 1 times [2024-11-09 01:54:59,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:54:59,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242301178] [2024-11-09 01:54:59,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:54:59,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:54:59,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:00,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 01:55:00,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:00,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:55:00,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:00,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 01:55:00,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:00,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:55:00,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:00,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:55:00,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:00,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:55:00,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:00,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:55:00,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:00,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:55:00,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:00,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:55:00,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:00,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:55:00,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:00,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:55:00,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:00,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:55:00,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:00,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:55:00,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:00,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:55:00,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:00,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:55:00,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:00,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:55:00,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:00,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:55:00,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:00,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 01:55:00,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:00,177 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:55:00,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:55:00,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242301178] [2024-11-09 01:55:00,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242301178] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:55:00,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:55:00,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:55:00,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136578090] [2024-11-09 01:55:00,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:55:00,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:55:00,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:55:00,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:55:00,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:55:00,180 INFO L87 Difference]: Start difference. First operand 490 states and 673 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:55:00,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:55:00,263 INFO L93 Difference]: Finished difference Result 822 states and 1128 transitions. [2024-11-09 01:55:00,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:55:00,264 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 160 [2024-11-09 01:55:00,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:55:00,270 INFO L225 Difference]: With dead ends: 822 [2024-11-09 01:55:00,270 INFO L226 Difference]: Without dead ends: 648 [2024-11-09 01:55:00,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:55:00,271 INFO L432 NwaCegarLoop]: 375 mSDtfsCounter, 173 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 1118 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:55:00,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 1118 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:55:00,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2024-11-09 01:55:00,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 519. [2024-11-09 01:55:00,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 444 states have (on average 1.34009009009009) internal successors, (595), 446 states have internal predecessors, (595), 60 states have call successors, (60), 14 states have call predecessors, (60), 14 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-09 01:55:00,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 715 transitions. [2024-11-09 01:55:00,317 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 715 transitions. Word has length 160 [2024-11-09 01:55:00,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:55:00,318 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 715 transitions. [2024-11-09 01:55:00,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:55:00,318 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 715 transitions. [2024-11-09 01:55:00,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-09 01:55:00,320 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:55:00,320 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:55:00,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 01:55:00,321 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:55:00,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:55:00,321 INFO L85 PathProgramCache]: Analyzing trace with hash -162349282, now seen corresponding path program 1 times [2024-11-09 01:55:00,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:55:00,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060095757] [2024-11-09 01:55:00,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:55:00,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:55:00,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:00,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 01:55:00,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:00,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:55:00,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:00,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 01:55:00,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:00,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:55:00,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:00,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:55:00,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:00,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:55:00,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:00,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:55:00,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:00,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:55:00,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:00,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:55:00,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:00,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:55:00,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:00,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:55:00,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:00,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:55:00,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:00,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:55:00,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:00,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:55:00,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:00,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:55:00,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:00,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:55:00,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:00,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:55:00,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:00,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 01:55:00,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:00,949 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:55:00,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:55:00,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060095757] [2024-11-09 01:55:00,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060095757] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:55:00,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:55:00,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 01:55:00,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907178662] [2024-11-09 01:55:00,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:55:00,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:55:00,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:55:00,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:55:00,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:55:00,956 INFO L87 Difference]: Start difference. First operand 519 states and 715 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:55:01,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:55:01,118 INFO L93 Difference]: Finished difference Result 891 states and 1228 transitions. [2024-11-09 01:55:01,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 01:55:01,118 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 160 [2024-11-09 01:55:01,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:55:01,122 INFO L225 Difference]: With dead ends: 891 [2024-11-09 01:55:01,122 INFO L226 Difference]: Without dead ends: 690 [2024-11-09 01:55:01,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-09 01:55:01,124 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 184 mSDsluCounter, 936 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 1127 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:55:01,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 1127 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:55:01,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2024-11-09 01:55:01,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 681. [2024-11-09 01:55:01,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 584 states have (on average 1.3407534246575343) internal successors, (783), 586 states have internal predecessors, (783), 78 states have call successors, (78), 18 states have call predecessors, (78), 18 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-09 01:55:01,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 939 transitions. [2024-11-09 01:55:01,179 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 939 transitions. Word has length 160 [2024-11-09 01:55:01,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:55:01,179 INFO L471 AbstractCegarLoop]: Abstraction has 681 states and 939 transitions. [2024-11-09 01:55:01,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:55:01,179 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 939 transitions. [2024-11-09 01:55:01,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-09 01:55:01,181 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:55:01,181 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:55:01,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 01:55:01,182 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:55:01,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:55:01,182 INFO L85 PathProgramCache]: Analyzing trace with hash 590692053, now seen corresponding path program 1 times [2024-11-09 01:55:01,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:55:01,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429439696] [2024-11-09 01:55:01,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:55:01,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:55:01,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:02,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 01:55:02,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:02,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:55:02,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:02,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 01:55:02,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:02,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:55:02,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:02,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:55:02,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:02,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:55:02,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:02,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:55:02,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:02,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:55:02,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:02,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:55:02,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:02,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:55:02,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:02,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:55:02,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:02,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:55:02,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:02,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:55:02,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:02,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:55:02,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:02,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:55:02,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:02,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:55:02,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:02,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:55:02,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:02,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 01:55:02,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:02,123 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:55:02,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:55:02,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429439696] [2024-11-09 01:55:02,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429439696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:55:02,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:55:02,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 01:55:02,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535672665] [2024-11-09 01:55:02,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:55:02,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 01:55:02,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:55:02,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 01:55:02,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:55:02,125 INFO L87 Difference]: Start difference. First operand 681 states and 939 transitions. Second operand has 9 states, 8 states have (on average 9.5) internal successors, (76), 9 states have internal predecessors, (76), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-09 01:55:02,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:55:02,421 INFO L93 Difference]: Finished difference Result 695 states and 956 transitions. [2024-11-09 01:55:02,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:55:02,422 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.5) internal successors, (76), 9 states have internal predecessors, (76), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 163 [2024-11-09 01:55:02,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:55:02,426 INFO L225 Difference]: With dead ends: 695 [2024-11-09 01:55:02,427 INFO L226 Difference]: Without dead ends: 693 [2024-11-09 01:55:02,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-09 01:55:02,428 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 286 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:55:02,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 911 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:55:02,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2024-11-09 01:55:02,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 693. [2024-11-09 01:55:02,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 596 states have (on average 1.3338926174496644) internal successors, (795), 598 states have internal predecessors, (795), 78 states have call successors, (78), 18 states have call predecessors, (78), 18 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-09 01:55:02,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 951 transitions. [2024-11-09 01:55:02,493 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 951 transitions. Word has length 163 [2024-11-09 01:55:02,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:55:02,493 INFO L471 AbstractCegarLoop]: Abstraction has 693 states and 951 transitions. [2024-11-09 01:55:02,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.5) internal successors, (76), 9 states have internal predecessors, (76), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-09 01:55:02,494 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 951 transitions. [2024-11-09 01:55:02,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-09 01:55:02,495 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:55:02,496 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:55:02,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 01:55:02,496 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:55:02,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:55:02,496 INFO L85 PathProgramCache]: Analyzing trace with hash 592539095, now seen corresponding path program 1 times [2024-11-09 01:55:02,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:55:02,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630119254] [2024-11-09 01:55:02,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:55:02,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:55:02,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:02,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 01:55:02,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:02,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:55:02,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:02,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 01:55:02,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:02,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:55:02,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:02,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:55:02,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:02,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:55:02,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:02,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:55:02,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:02,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:55:02,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:02,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:55:02,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:02,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:55:02,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:02,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:55:02,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:02,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:55:02,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:02,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:55:02,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:02,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:55:02,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:02,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:55:02,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:02,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:55:02,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:02,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:55:02,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:02,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 01:55:02,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:02,796 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:55:02,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:55:02,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630119254] [2024-11-09 01:55:02,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630119254] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:55:02,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:55:02,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:55:02,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133921365] [2024-11-09 01:55:02,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:55:02,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:55:02,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:55:02,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:55:02,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:55:02,799 INFO L87 Difference]: Start difference. First operand 693 states and 951 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:55:02,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:55:02,917 INFO L93 Difference]: Finished difference Result 1358 states and 1854 transitions. [2024-11-09 01:55:02,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:55:02,917 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 163 [2024-11-09 01:55:02,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:55:02,921 INFO L225 Difference]: With dead ends: 1358 [2024-11-09 01:55:02,921 INFO L226 Difference]: Without dead ends: 709 [2024-11-09 01:55:02,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:55:02,923 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 135 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:55:02,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 548 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:55:02,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2024-11-09 01:55:02,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 685. [2024-11-09 01:55:02,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 595 states have (on average 1.3277310924369747) internal successors, (790), 597 states have internal predecessors, (790), 68 states have call successors, (68), 21 states have call predecessors, (68), 21 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-09 01:55:02,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 926 transitions. [2024-11-09 01:55:02,979 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 926 transitions. Word has length 163 [2024-11-09 01:55:02,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:55:02,979 INFO L471 AbstractCegarLoop]: Abstraction has 685 states and 926 transitions. [2024-11-09 01:55:02,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:55:02,980 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 926 transitions. [2024-11-09 01:55:02,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-09 01:55:02,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:55:02,981 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:55:02,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 01:55:02,982 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:55:02,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:55:02,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1927420839, now seen corresponding path program 1 times [2024-11-09 01:55:02,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:55:02,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150170131] [2024-11-09 01:55:02,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:55:02,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:55:03,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:03,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 01:55:03,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:03,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:55:03,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:03,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 01:55:03,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:03,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:55:03,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:03,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:55:03,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:03,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:55:03,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:03,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:55:03,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:03,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:55:03,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:03,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:55:03,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:03,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:55:03,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:03,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:55:03,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:03,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:55:03,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:03,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:55:03,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:03,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:55:03,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:03,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:55:03,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:03,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:55:03,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:03,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:55:03,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:03,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 01:55:03,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:03,267 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:55:03,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:55:03,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150170131] [2024-11-09 01:55:03,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150170131] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:55:03,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:55:03,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:55:03,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797656673] [2024-11-09 01:55:03,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:55:03,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:55:03,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:55:03,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:55:03,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:55:03,270 INFO L87 Difference]: Start difference. First operand 685 states and 926 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:55:03,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:55:03,352 INFO L93 Difference]: Finished difference Result 1326 states and 1792 transitions. [2024-11-09 01:55:03,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:55:03,353 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 163 [2024-11-09 01:55:03,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:55:03,357 INFO L225 Difference]: With dead ends: 1326 [2024-11-09 01:55:03,357 INFO L226 Difference]: Without dead ends: 685 [2024-11-09 01:55:03,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:55:03,359 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 77 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:55:03,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 647 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:55:03,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2024-11-09 01:55:03,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 685. [2024-11-09 01:55:03,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 595 states have (on average 1.3210084033613445) internal successors, (786), 597 states have internal predecessors, (786), 68 states have call successors, (68), 21 states have call predecessors, (68), 21 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-09 01:55:03,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 922 transitions. [2024-11-09 01:55:03,410 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 922 transitions. Word has length 163 [2024-11-09 01:55:03,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:55:03,411 INFO L471 AbstractCegarLoop]: Abstraction has 685 states and 922 transitions. [2024-11-09 01:55:03,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:55:03,411 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 922 transitions. [2024-11-09 01:55:03,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-09 01:55:03,413 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:55:03,413 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:55:03,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 01:55:03,413 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:55:03,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:55:03,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1247362469, now seen corresponding path program 1 times [2024-11-09 01:55:03,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:55:03,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145559977] [2024-11-09 01:55:03,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:55:03,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:55:03,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:03,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 01:55:03,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:03,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:55:03,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:03,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 01:55:03,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:03,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:55:03,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:03,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:55:03,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:03,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:55:03,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:03,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:55:03,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:03,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:55:03,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:03,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:55:03,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:03,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:55:03,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:03,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:55:03,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:03,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:55:03,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:03,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:55:03,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:03,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:55:03,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:03,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:55:03,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:03,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:55:03,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:03,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:55:03,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:03,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 01:55:03,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:03,680 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:55:03,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:55:03,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145559977] [2024-11-09 01:55:03,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145559977] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:55:03,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:55:03,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:55:03,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294867492] [2024-11-09 01:55:03,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:55:03,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:55:03,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:55:03,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:55:03,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:55:03,683 INFO L87 Difference]: Start difference. First operand 685 states and 922 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:55:03,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:55:03,770 INFO L93 Difference]: Finished difference Result 1338 states and 1800 transitions. [2024-11-09 01:55:03,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:55:03,771 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 163 [2024-11-09 01:55:03,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:55:03,775 INFO L225 Difference]: With dead ends: 1338 [2024-11-09 01:55:03,775 INFO L226 Difference]: Without dead ends: 697 [2024-11-09 01:55:03,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:55:03,778 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 0 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:55:03,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 760 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:55:03,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2024-11-09 01:55:03,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 697. [2024-11-09 01:55:03,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 607 states have (on average 1.314662273476112) internal successors, (798), 609 states have internal predecessors, (798), 68 states have call successors, (68), 21 states have call predecessors, (68), 21 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-09 01:55:03,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 934 transitions. [2024-11-09 01:55:03,853 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 934 transitions. Word has length 163 [2024-11-09 01:55:03,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:55:03,854 INFO L471 AbstractCegarLoop]: Abstraction has 697 states and 934 transitions. [2024-11-09 01:55:03,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:55:03,854 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 934 transitions. [2024-11-09 01:55:03,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-09 01:55:03,856 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:55:03,857 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:55:03,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 01:55:03,857 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:55:03,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:55:03,858 INFO L85 PathProgramCache]: Analyzing trace with hash 55412868, now seen corresponding path program 1 times [2024-11-09 01:55:03,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:55:03,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804036323] [2024-11-09 01:55:03,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:55:03,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:55:03,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:55:03,949 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 01:55:04,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:55:04,155 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 01:55:04,156 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 01:55:04,157 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 01:55:04,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 01:55:04,163 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:55:04,395 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 01:55:04,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 01:55:04 BoogieIcfgContainer [2024-11-09 01:55:04,399 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 01:55:04,400 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 01:55:04,401 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 01:55:04,401 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 01:55:04,401 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:54:51" (3/4) ... [2024-11-09 01:55:04,404 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 01:55:04,405 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 01:55:04,405 INFO L158 Benchmark]: Toolchain (without parser) took 14635.38ms. Allocated memory was 157.3MB in the beginning and 511.7MB in the end (delta: 354.4MB). Free memory was 89.5MB in the beginning and 256.1MB in the end (delta: -166.6MB). Peak memory consumption was 189.6MB. Max. memory is 16.1GB. [2024-11-09 01:55:04,406 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 104.9MB. Free memory is still 66.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:55:04,406 INFO L158 Benchmark]: CACSL2BoogieTranslator took 434.65ms. Allocated memory is still 157.3MB. Free memory was 89.3MB in the beginning and 124.6MB in the end (delta: -35.3MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. [2024-11-09 01:55:04,407 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.18ms. Allocated memory is still 157.3MB. Free memory was 124.6MB in the beginning and 121.1MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 01:55:04,407 INFO L158 Benchmark]: Boogie Preprocessor took 139.06ms. Allocated memory is still 157.3MB. Free memory was 121.1MB in the beginning and 114.2MB in the end (delta: 6.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-09 01:55:04,407 INFO L158 Benchmark]: RCFGBuilder took 969.87ms. Allocated memory is still 157.3MB. Free memory was 114.2MB in the beginning and 58.4MB in the end (delta: 55.7MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. [2024-11-09 01:55:04,407 INFO L158 Benchmark]: TraceAbstraction took 13012.94ms. Allocated memory was 157.3MB in the beginning and 511.7MB in the end (delta: 354.4MB). Free memory was 58.1MB in the beginning and 256.1MB in the end (delta: -197.9MB). Peak memory consumption was 159.6MB. Max. memory is 16.1GB. [2024-11-09 01:55:04,407 INFO L158 Benchmark]: Witness Printer took 4.88ms. Allocated memory is still 511.7MB. Free memory is still 256.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:55:04,409 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.23ms. Allocated memory is still 104.9MB. Free memory is still 66.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 434.65ms. Allocated memory is still 157.3MB. Free memory was 89.3MB in the beginning and 124.6MB in the end (delta: -35.3MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.18ms. Allocated memory is still 157.3MB. Free memory was 124.6MB in the beginning and 121.1MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 139.06ms. Allocated memory is still 157.3MB. Free memory was 121.1MB in the beginning and 114.2MB in the end (delta: 6.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 969.87ms. Allocated memory is still 157.3MB. Free memory was 114.2MB in the beginning and 58.4MB in the end (delta: 55.7MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. * TraceAbstraction took 13012.94ms. Allocated memory was 157.3MB in the beginning and 511.7MB in the end (delta: 354.4MB). Free memory was 58.1MB in the beginning and 256.1MB in the end (delta: -197.9MB). Peak memory consumption was 159.6MB. Max. memory is 16.1GB. * Witness Printer took 4.88ms. Allocated memory is still 511.7MB. Free memory is still 256.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 114. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char* var_1_1_Pointer = &(var_1_1); [L24] float var_1_2 = 8.3; [L24] float var_1_2 = 8.3; [L25] float* var_1_2_Pointer = &(var_1_2); [L26] float var_1_3 = 2.25; [L26] float var_1_3 = 2.25; [L27] float* var_1_3_Pointer = &(var_1_3); [L28] float var_1_4 = 10.3; [L28] float var_1_4 = 10.3; [L29] float* var_1_4_Pointer = &(var_1_4); [L30] unsigned char var_1_6 = 0; [L30] unsigned char var_1_6 = 0; [L31] unsigned char* var_1_6_Pointer = &(var_1_6); [L32] signed long int var_1_7 = 128; [L32] signed long int var_1_7 = 128; [L33] signed long int* var_1_7_Pointer = &(var_1_7); [L34] float var_1_8 = 9.8; [L34] float var_1_8 = 9.8; [L35] float* var_1_8_Pointer = &(var_1_8); [L36] unsigned long int var_1_13 = 1; [L36] unsigned long int var_1_13 = 1; [L37] unsigned long int* var_1_13_Pointer = &(var_1_13); [L38] unsigned long int var_1_14 = 32; [L38] unsigned long int var_1_14 = 32; [L39] unsigned long int* var_1_14_Pointer = &(var_1_14); [L40] signed char var_1_15 = -10; [L40] signed char var_1_15 = -10; [L41] signed char* var_1_15_Pointer = &(var_1_15); [L42] signed char var_1_16 = 16; [L42] signed char var_1_16 = 16; [L43] signed char* var_1_16_Pointer = &(var_1_16); [L44] signed char var_1_17 = 25; [L44] signed char var_1_17 = 25; [L45] signed char* var_1_17_Pointer = &(var_1_17); [L46] signed char var_1_18 = 1; [L46] signed char var_1_18 = 1; [L47] signed char* var_1_18_Pointer = &(var_1_18); [L48] signed char var_1_19 = 0; [L48] signed char var_1_19 = 0; [L49] signed char* var_1_19_Pointer = &(var_1_19); [L50] signed char var_1_20 = 32; [L50] signed char var_1_20 = 32; [L51] signed char* var_1_20_Pointer = &(var_1_20); [L52] signed short int var_1_21 = 256; [L52] signed short int var_1_21 = 256; [L53] signed short int* var_1_21_Pointer = &(var_1_21); [L54] signed char var_1_22 = 16; [L54] signed char var_1_22 = 16; [L55] signed char* var_1_22_Pointer = &(var_1_22); [L56] unsigned char var_1_23 = 0; [L56] unsigned char var_1_23 = 0; [L57] unsigned char* var_1_23_Pointer = &(var_1_23); [L58] signed short int last_1_var_1_21 = 256; VAL [isInitial=0, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L118] isInitial = 1 [L119] FCALL initially() [L120] COND TRUE 1 [L121] CALL updateLastVariables() [L111] EXPR \read(var_1_21) [L111] last_1_var_1_21 = var_1_21 [L121] RET updateLastVariables() [L122] CALL updateVariables() [L80] var_1_2 = __VERIFIER_nondet_float() [L81] EXPR \read(var_1_2) [L81] EXPR var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L81] EXPR var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F [L81] EXPR \read(var_1_2) [L81] EXPR var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L81] EXPR (var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L81] EXPR (var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L81] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L81] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L82] var_1_3 = __VERIFIER_nondet_float() [L83] EXPR \read(var_1_3) [L83] EXPR var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L83] EXPR var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F [L83] EXPR \read(var_1_3) [L83] EXPR var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L83] EXPR (var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L83] EXPR (var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L83] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L83] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L84] var_1_4 = __VERIFIER_nondet_float() [L85] EXPR \read(var_1_4) [L85] EXPR var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L85] EXPR var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F [L85] EXPR \read(var_1_4) [L85] EXPR var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L85] EXPR (var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L85] EXPR (var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L85] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L85] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L86] var_1_6 = __VERIFIER_nondet_uchar() [L87] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L87] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L87] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L88] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L88] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L88] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L89] var_1_8 = __VERIFIER_nondet_float() [L90] EXPR \read(var_1_8) [L90] EXPR var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L90] EXPR var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F [L90] EXPR \read(var_1_8) [L90] EXPR var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L90] EXPR (var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L90] EXPR (var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L90] CALL assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L90] RET assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L91] var_1_14 = __VERIFIER_nondet_ulong() [L92] EXPR \read(var_1_14) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L92] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L92] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L93] EXPR \read(var_1_14) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L93] CALL assume_abort_if_not(var_1_14 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L93] RET assume_abort_if_not(var_1_14 <= 4294967294) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L94] var_1_16 = __VERIFIER_nondet_char() [L95] EXPR \read(var_1_16) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L95] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L95] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L96] EXPR \read(var_1_16) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L96] CALL assume_abort_if_not(var_1_16 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L96] RET assume_abort_if_not(var_1_16 <= 63) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L97] var_1_17 = __VERIFIER_nondet_char() [L98] EXPR \read(var_1_17) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L98] CALL assume_abort_if_not(var_1_17 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L98] RET assume_abort_if_not(var_1_17 >= -1) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L99] EXPR \read(var_1_17) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L99] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L99] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L100] var_1_18 = __VERIFIER_nondet_char() [L101] EXPR \read(var_1_18) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L101] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L101] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L102] EXPR \read(var_1_18) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L102] CALL assume_abort_if_not(var_1_18 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L102] RET assume_abort_if_not(var_1_18 <= 31) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L103] var_1_19 = __VERIFIER_nondet_char() [L104] EXPR \read(var_1_19) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L104] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L104] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L105] EXPR \read(var_1_19) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L105] CALL assume_abort_if_not(var_1_19 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L105] RET assume_abort_if_not(var_1_19 <= 63) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L106] var_1_20 = __VERIFIER_nondet_char() [L107] EXPR \read(var_1_20) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L107] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L107] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L108] EXPR \read(var_1_20) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L108] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L108] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L122] RET updateVariables() [L123] CALL step() [L62] EXPR \read(*var_1_14_Pointer) [L62] (*(var_1_13_Pointer)) = (*(var_1_14_Pointer)) [L63] (*(var_1_21_Pointer)) = last_1_var_1_21 [L64] EXPR \read(*var_1_16_Pointer) [L64] (*(var_1_22_Pointer)) = (*(var_1_16_Pointer)) [L65] EXPR \read(*var_1_6_Pointer) [L65] (*(var_1_23_Pointer)) = (*(var_1_6_Pointer)) [L66] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L66] EXPR ((1.1f) < ((*(var_1_2_Pointer)))) ? (1.1f) : ((*(var_1_2_Pointer))) [L66] EXPR ((1.1f) < ((*(var_1_2_Pointer)))) ? (1.1f) : ((*(var_1_2_Pointer))) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L66] EXPR \read(*var_1_3_Pointer) [L66] EXPR \read(*var_1_4_Pointer) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L66] COND FALSE !(((((1.1f) < ((*(var_1_2_Pointer)))) ? (1.1f) : ((*(var_1_2_Pointer))))) > ((*(var_1_3_Pointer)) * (*(var_1_4_Pointer)))) [L69] EXPR \read(*var_1_22_Pointer) [L69] signed char stepLocal_0 = (*(var_1_22_Pointer)); [L70] EXPR \read(*var_1_22_Pointer) [L70] EXPR \read(*var_1_21_Pointer) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L70] EXPR (((*(var_1_22_Pointer))) < ((*(var_1_21_Pointer)))) ? ((*(var_1_22_Pointer))) : ((*(var_1_21_Pointer))) [L70] EXPR \read(*var_1_22_Pointer) [L70] EXPR (((*(var_1_22_Pointer))) < ((*(var_1_21_Pointer)))) ? ((*(var_1_22_Pointer))) : ((*(var_1_21_Pointer))) VAL [isInitial=1, last_1_var_1_21=256, stepLocal_0=19, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L70] COND FALSE !(stepLocal_0 != (((((*(var_1_22_Pointer))) < ((*(var_1_21_Pointer)))) ? ((*(var_1_22_Pointer))) : ((*(var_1_21_Pointer)))))) [L73] EXPR \read(*var_1_4_Pointer) [L73] EXPR \read(*var_1_2_Pointer) [L73] EXPR \read(*var_1_3_Pointer) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L73] EXPR (((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))) [L73] EXPR \read(*var_1_2_Pointer) [L73] EXPR (((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L73] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L73] COND TRUE (*(var_1_4_Pointer)) <= ((((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))) * (*(var_1_8_Pointer))) [L74] EXPR \read(*var_1_22_Pointer) [L74] EXPR \read(*var_1_15_Pointer) [L74] EXPR \read(*var_1_15_Pointer) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L74] EXPR ((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer))) [L74] EXPR \read(*var_1_22_Pointer) [L74] EXPR \read(*var_1_15_Pointer) [L74] EXPR ((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer))) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L74] EXPR \read(*var_1_15_Pointer) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L74] EXPR (((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))) [L74] EXPR \read(*var_1_15_Pointer) [L74] EXPR (((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L74] EXPR ((((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) > ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) ? (((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) : ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))) [L74] EXPR \read(*var_1_15_Pointer) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L74] EXPR (((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))) [L74] EXPR \read(*var_1_15_Pointer) [L74] EXPR (((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L74] EXPR ((((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) > ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) ? (((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) : ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L74] (*(var_1_7_Pointer)) = ((((((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) > ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) ? (((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) : ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))) [L123] RET step() [L124] CALL, EXPR property() [L114] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L114] EXPR ((1.1f) < ((*(var_1_2_Pointer)))) ? (1.1f) : ((*(var_1_2_Pointer))) [L114] EXPR ((1.1f) < ((*(var_1_2_Pointer)))) ? (1.1f) : ((*(var_1_2_Pointer))) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L114] EXPR \read(*var_1_3_Pointer) [L114] EXPR \read(*var_1_4_Pointer) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L114] EXPR (((((1.1f) < ((*(var_1_2_Pointer)))) ? (1.1f) : ((*(var_1_2_Pointer))))) > ((*(var_1_3_Pointer)) * (*(var_1_4_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_23_Pointer)) && (*(var_1_6_Pointer))))) : 1 [L114] EXPR (((((1.1f) < ((*(var_1_2_Pointer)))) ? (1.1f) : ((*(var_1_2_Pointer))))) > ((*(var_1_3_Pointer)) * (*(var_1_4_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_23_Pointer)) && (*(var_1_6_Pointer))))) : 1 VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L114] EXPR ((((((1.1f) < ((*(var_1_2_Pointer)))) ? (1.1f) : ((*(var_1_2_Pointer))))) > ((*(var_1_3_Pointer)) * (*(var_1_4_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_23_Pointer)) && (*(var_1_6_Pointer))))) : 1) && (((*(var_1_4_Pointer)) <= ((((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))) * (*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) > ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) ? (((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) : ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))) : ((*(var_1_7_Pointer)) == ((signed long int) (*(var_1_22_Pointer))))) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L114] EXPR ((((((1.1f) < ((*(var_1_2_Pointer)))) ? (1.1f) : ((*(var_1_2_Pointer))))) > ((*(var_1_3_Pointer)) * (*(var_1_4_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_23_Pointer)) && (*(var_1_6_Pointer))))) : 1) && (((*(var_1_4_Pointer)) <= ((((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))) * (*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) > ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) ? (((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) : ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))) : ((*(var_1_7_Pointer)) == ((signed long int) (*(var_1_22_Pointer))))) [L114] EXPR \read(*var_1_4_Pointer) [L114] EXPR \read(*var_1_2_Pointer) [L114] EXPR \read(*var_1_3_Pointer) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L114] EXPR (((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))) [L114] EXPR \read(*var_1_2_Pointer) [L114] EXPR (((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L114] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L114] EXPR ((*(var_1_4_Pointer)) <= ((((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))) * (*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) > ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) ? (((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) : ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))) : ((*(var_1_7_Pointer)) == ((signed long int) (*(var_1_22_Pointer)))) [L114] EXPR \read(*var_1_7_Pointer) [L114] EXPR \read(*var_1_22_Pointer) [L114] EXPR ((*(var_1_4_Pointer)) <= ((((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))) * (*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) > ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) ? (((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) : ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))) : ((*(var_1_7_Pointer)) == ((signed long int) (*(var_1_22_Pointer)))) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L114] EXPR ((((((1.1f) < ((*(var_1_2_Pointer)))) ? (1.1f) : ((*(var_1_2_Pointer))))) > ((*(var_1_3_Pointer)) * (*(var_1_4_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_23_Pointer)) && (*(var_1_6_Pointer))))) : 1) && (((*(var_1_4_Pointer)) <= ((((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))) * (*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) > ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) ? (((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) : ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))) : ((*(var_1_7_Pointer)) == ((signed long int) (*(var_1_22_Pointer))))) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L114] EXPR (((((((1.1f) < ((*(var_1_2_Pointer)))) ? (1.1f) : ((*(var_1_2_Pointer))))) > ((*(var_1_3_Pointer)) * (*(var_1_4_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_23_Pointer)) && (*(var_1_6_Pointer))))) : 1) && (((*(var_1_4_Pointer)) <= ((((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))) * (*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) > ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) ? (((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) : ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))) : ((*(var_1_7_Pointer)) == ((signed long int) (*(var_1_22_Pointer)))))) && ((*(var_1_13_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer)))) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L114] EXPR (((((((1.1f) < ((*(var_1_2_Pointer)))) ? (1.1f) : ((*(var_1_2_Pointer))))) > ((*(var_1_3_Pointer)) * (*(var_1_4_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_23_Pointer)) && (*(var_1_6_Pointer))))) : 1) && (((*(var_1_4_Pointer)) <= ((((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))) * (*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) > ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) ? (((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) : ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))) : ((*(var_1_7_Pointer)) == ((signed long int) (*(var_1_22_Pointer)))))) && ((*(var_1_13_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer)))) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L114] EXPR ((((((((1.1f) < ((*(var_1_2_Pointer)))) ? (1.1f) : ((*(var_1_2_Pointer))))) > ((*(var_1_3_Pointer)) * (*(var_1_4_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_23_Pointer)) && (*(var_1_6_Pointer))))) : 1) && (((*(var_1_4_Pointer)) <= ((((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))) * (*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) > ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) ? (((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) : ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))) : ((*(var_1_7_Pointer)) == ((signed long int) (*(var_1_22_Pointer)))))) && ((*(var_1_13_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) && (((*(var_1_22_Pointer)) != (((((*(var_1_22_Pointer))) < ((*(var_1_21_Pointer)))) ? ((*(var_1_22_Pointer))) : ((*(var_1_21_Pointer)))))) ? ((*(var_1_15_Pointer)) == ((signed char) ((((((10 + (*(var_1_16_Pointer)))) < ((*(var_1_17_Pointer)))) ? ((10 + (*(var_1_16_Pointer)))) : ((*(var_1_17_Pointer))))) - ((32 - (*(var_1_18_Pointer))) + (((((*(var_1_19_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_19_Pointer))) : ((*(var_1_20_Pointer))))))))) : 1) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L114] EXPR ((((((((1.1f) < ((*(var_1_2_Pointer)))) ? (1.1f) : ((*(var_1_2_Pointer))))) > ((*(var_1_3_Pointer)) * (*(var_1_4_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_23_Pointer)) && (*(var_1_6_Pointer))))) : 1) && (((*(var_1_4_Pointer)) <= ((((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))) * (*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) > ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) ? (((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) : ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))) : ((*(var_1_7_Pointer)) == ((signed long int) (*(var_1_22_Pointer)))))) && ((*(var_1_13_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) && (((*(var_1_22_Pointer)) != (((((*(var_1_22_Pointer))) < ((*(var_1_21_Pointer)))) ? ((*(var_1_22_Pointer))) : ((*(var_1_21_Pointer)))))) ? ((*(var_1_15_Pointer)) == ((signed char) ((((((10 + (*(var_1_16_Pointer)))) < ((*(var_1_17_Pointer)))) ? ((10 + (*(var_1_16_Pointer)))) : ((*(var_1_17_Pointer))))) - ((32 - (*(var_1_18_Pointer))) + (((((*(var_1_19_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_19_Pointer))) : ((*(var_1_20_Pointer))))))))) : 1) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L114] EXPR (((((((((1.1f) < ((*(var_1_2_Pointer)))) ? (1.1f) : ((*(var_1_2_Pointer))))) > ((*(var_1_3_Pointer)) * (*(var_1_4_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_23_Pointer)) && (*(var_1_6_Pointer))))) : 1) && (((*(var_1_4_Pointer)) <= ((((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))) * (*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) > ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) ? (((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) : ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))) : ((*(var_1_7_Pointer)) == ((signed long int) (*(var_1_22_Pointer)))))) && ((*(var_1_13_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) && (((*(var_1_22_Pointer)) != (((((*(var_1_22_Pointer))) < ((*(var_1_21_Pointer)))) ? ((*(var_1_22_Pointer))) : ((*(var_1_21_Pointer)))))) ? ((*(var_1_15_Pointer)) == ((signed char) ((((((10 + (*(var_1_16_Pointer)))) < ((*(var_1_17_Pointer)))) ? ((10 + (*(var_1_16_Pointer)))) : ((*(var_1_17_Pointer))))) - ((32 - (*(var_1_18_Pointer))) + (((((*(var_1_19_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_19_Pointer))) : ((*(var_1_20_Pointer))))))))) : 1)) && ((*(var_1_21_Pointer)) == ((signed short int) last_1_var_1_21)) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L114] EXPR (((((((((1.1f) < ((*(var_1_2_Pointer)))) ? (1.1f) : ((*(var_1_2_Pointer))))) > ((*(var_1_3_Pointer)) * (*(var_1_4_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_23_Pointer)) && (*(var_1_6_Pointer))))) : 1) && (((*(var_1_4_Pointer)) <= ((((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))) * (*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) > ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) ? (((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) : ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))) : ((*(var_1_7_Pointer)) == ((signed long int) (*(var_1_22_Pointer)))))) && ((*(var_1_13_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) && (((*(var_1_22_Pointer)) != (((((*(var_1_22_Pointer))) < ((*(var_1_21_Pointer)))) ? ((*(var_1_22_Pointer))) : ((*(var_1_21_Pointer)))))) ? ((*(var_1_15_Pointer)) == ((signed char) ((((((10 + (*(var_1_16_Pointer)))) < ((*(var_1_17_Pointer)))) ? ((10 + (*(var_1_16_Pointer)))) : ((*(var_1_17_Pointer))))) - ((32 - (*(var_1_18_Pointer))) + (((((*(var_1_19_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_19_Pointer))) : ((*(var_1_20_Pointer))))))))) : 1)) && ((*(var_1_21_Pointer)) == ((signed short int) last_1_var_1_21)) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L114] EXPR ((((((((((1.1f) < ((*(var_1_2_Pointer)))) ? (1.1f) : ((*(var_1_2_Pointer))))) > ((*(var_1_3_Pointer)) * (*(var_1_4_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_23_Pointer)) && (*(var_1_6_Pointer))))) : 1) && (((*(var_1_4_Pointer)) <= ((((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))) * (*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) > ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) ? (((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) : ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))) : ((*(var_1_7_Pointer)) == ((signed long int) (*(var_1_22_Pointer)))))) && ((*(var_1_13_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) && (((*(var_1_22_Pointer)) != (((((*(var_1_22_Pointer))) < ((*(var_1_21_Pointer)))) ? ((*(var_1_22_Pointer))) : ((*(var_1_21_Pointer)))))) ? ((*(var_1_15_Pointer)) == ((signed char) ((((((10 + (*(var_1_16_Pointer)))) < ((*(var_1_17_Pointer)))) ? ((10 + (*(var_1_16_Pointer)))) : ((*(var_1_17_Pointer))))) - ((32 - (*(var_1_18_Pointer))) + (((((*(var_1_19_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_19_Pointer))) : ((*(var_1_20_Pointer))))))))) : 1)) && ((*(var_1_21_Pointer)) == ((signed short int) last_1_var_1_21))) && ((*(var_1_22_Pointer)) == ((signed char) (*(var_1_16_Pointer)))) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L114] EXPR ((((((((((1.1f) < ((*(var_1_2_Pointer)))) ? (1.1f) : ((*(var_1_2_Pointer))))) > ((*(var_1_3_Pointer)) * (*(var_1_4_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_23_Pointer)) && (*(var_1_6_Pointer))))) : 1) && (((*(var_1_4_Pointer)) <= ((((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))) * (*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) > ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) ? (((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) : ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))) : ((*(var_1_7_Pointer)) == ((signed long int) (*(var_1_22_Pointer)))))) && ((*(var_1_13_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) && (((*(var_1_22_Pointer)) != (((((*(var_1_22_Pointer))) < ((*(var_1_21_Pointer)))) ? ((*(var_1_22_Pointer))) : ((*(var_1_21_Pointer)))))) ? ((*(var_1_15_Pointer)) == ((signed char) ((((((10 + (*(var_1_16_Pointer)))) < ((*(var_1_17_Pointer)))) ? ((10 + (*(var_1_16_Pointer)))) : ((*(var_1_17_Pointer))))) - ((32 - (*(var_1_18_Pointer))) + (((((*(var_1_19_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_19_Pointer))) : ((*(var_1_20_Pointer))))))))) : 1)) && ((*(var_1_21_Pointer)) == ((signed short int) last_1_var_1_21))) && ((*(var_1_22_Pointer)) == ((signed char) (*(var_1_16_Pointer)))) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L114] EXPR (((((((((((1.1f) < ((*(var_1_2_Pointer)))) ? (1.1f) : ((*(var_1_2_Pointer))))) > ((*(var_1_3_Pointer)) * (*(var_1_4_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_23_Pointer)) && (*(var_1_6_Pointer))))) : 1) && (((*(var_1_4_Pointer)) <= ((((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))) * (*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) > ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) ? (((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) : ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))) : ((*(var_1_7_Pointer)) == ((signed long int) (*(var_1_22_Pointer)))))) && ((*(var_1_13_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) && (((*(var_1_22_Pointer)) != (((((*(var_1_22_Pointer))) < ((*(var_1_21_Pointer)))) ? ((*(var_1_22_Pointer))) : ((*(var_1_21_Pointer)))))) ? ((*(var_1_15_Pointer)) == ((signed char) ((((((10 + (*(var_1_16_Pointer)))) < ((*(var_1_17_Pointer)))) ? ((10 + (*(var_1_16_Pointer)))) : ((*(var_1_17_Pointer))))) - ((32 - (*(var_1_18_Pointer))) + (((((*(var_1_19_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_19_Pointer))) : ((*(var_1_20_Pointer))))))))) : 1)) && ((*(var_1_21_Pointer)) == ((signed short int) last_1_var_1_21))) && ((*(var_1_22_Pointer)) == ((signed char) (*(var_1_16_Pointer))))) && ((*(var_1_23_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L114] EXPR (((((((((((1.1f) < ((*(var_1_2_Pointer)))) ? (1.1f) : ((*(var_1_2_Pointer))))) > ((*(var_1_3_Pointer)) * (*(var_1_4_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_23_Pointer)) && (*(var_1_6_Pointer))))) : 1) && (((*(var_1_4_Pointer)) <= ((((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))) * (*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) > ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) ? (((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) : ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))) : ((*(var_1_7_Pointer)) == ((signed long int) (*(var_1_22_Pointer)))))) && ((*(var_1_13_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) && (((*(var_1_22_Pointer)) != (((((*(var_1_22_Pointer))) < ((*(var_1_21_Pointer)))) ? ((*(var_1_22_Pointer))) : ((*(var_1_21_Pointer)))))) ? ((*(var_1_15_Pointer)) == ((signed char) ((((((10 + (*(var_1_16_Pointer)))) < ((*(var_1_17_Pointer)))) ? ((10 + (*(var_1_16_Pointer)))) : ((*(var_1_17_Pointer))))) - ((32 - (*(var_1_18_Pointer))) + (((((*(var_1_19_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_19_Pointer))) : ((*(var_1_20_Pointer))))))))) : 1)) && ((*(var_1_21_Pointer)) == ((signed short int) last_1_var_1_21))) && ((*(var_1_22_Pointer)) == ((signed char) (*(var_1_16_Pointer))))) && ((*(var_1_23_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L114-L115] return (((((((((((1.1f) < ((*(var_1_2_Pointer)))) ? (1.1f) : ((*(var_1_2_Pointer))))) > ((*(var_1_3_Pointer)) * (*(var_1_4_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_23_Pointer)) && (*(var_1_6_Pointer))))) : 1) && (((*(var_1_4_Pointer)) <= ((((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))) * (*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) > ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) ? (((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) : ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))) : ((*(var_1_7_Pointer)) == ((signed long int) (*(var_1_22_Pointer)))))) && ((*(var_1_13_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) && (((*(var_1_22_Pointer)) != (((((*(var_1_22_Pointer))) < ((*(var_1_21_Pointer)))) ? ((*(var_1_22_Pointer))) : ((*(var_1_21_Pointer)))))) ? ((*(var_1_15_Pointer)) == ((signed char) ((((((10 + (*(var_1_16_Pointer)))) < ((*(var_1_17_Pointer)))) ? ((10 + (*(var_1_16_Pointer)))) : ((*(var_1_17_Pointer))))) - ((32 - (*(var_1_18_Pointer))) + (((((*(var_1_19_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_19_Pointer))) : ((*(var_1_20_Pointer))))))))) : 1)) && ((*(var_1_21_Pointer)) == ((signed short int) last_1_var_1_21))) && ((*(var_1_22_Pointer)) == ((signed char) (*(var_1_16_Pointer))))) && ((*(var_1_23_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) ; [L124] RET, EXPR property() [L124] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 139 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.7s, OverallIterations: 17, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2227 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2227 mSDsluCounter, 12326 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8960 mSDsCounter, 149 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 976 IncrementalHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 149 mSolverCounterUnsat, 3366 mSDtfsCounter, 976 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1044 GetRequests, 938 SyntacticMatches, 2 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=697occurred in iteration=16, InterpolantAutomatonStates: 99, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 16 MinimizatonAttempts, 297 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 2877 NumberOfCodeBlocks, 2877 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 2850 ConstructedInterpolants, 0 QuantifiedInterpolants, 8284 SizeOfPredicates, 7 NumberOfNonLiveVariables, 722 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 18 InterpolantComputations, 15 PerfectInterpolantSequences, 10675/11016 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 [2024-11-09 01:55:04,447 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... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-63.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9c2d9fe6cca3f07b0ec4ef0cef7c77d56847aacde02fd15a5949ee3e6a04e48b --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:55:06,684 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:55:06,772 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 01:55:06,779 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:55:06,779 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:55:06,810 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:55:06,811 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:55:06,811 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:55:06,812 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:55:06,812 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:55:06,812 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:55:06,813 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:55:06,813 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:55:06,815 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:55:06,815 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:55:06,816 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:55:06,816 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:55:06,816 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:55:06,819 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:55:06,820 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:55:06,820 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:55:06,820 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:55:06,821 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:55:06,821 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 01:55:06,821 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 01:55:06,825 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:55:06,825 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 01:55:06,825 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:55:06,826 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:55:06,826 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:55:06,826 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:55:06,826 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:55:06,827 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:55:06,827 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:55:06,827 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:55:06,827 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:55:06,828 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:55:06,828 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:55:06,828 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 01:55:06,828 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 01:55:06,828 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:55:06,830 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:55:06,830 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:55:06,831 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:55:06,831 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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9c2d9fe6cca3f07b0ec4ef0cef7c77d56847aacde02fd15a5949ee3e6a04e48b [2024-11-09 01:55:07,179 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:55:07,208 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:55:07,211 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:55:07,212 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:55:07,212 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:55:07,214 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-63.i [2024-11-09 01:55:08,800 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:55:09,011 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:55:09,011 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-63.i [2024-11-09 01:55:09,025 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a74a38c3c/7a8f3121bdde42c8b50d90c7fe91d046/FLAGebbe449ba [2024-11-09 01:55:09,042 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a74a38c3c/7a8f3121bdde42c8b50d90c7fe91d046 [2024-11-09 01:55:09,044 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:55:09,046 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:55:09,049 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:55:09,049 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:55:09,054 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:55:09,055 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:55:09" (1/1) ... [2024-11-09 01:55:09,057 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d30f835 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:55:09, skipping insertion in model container [2024-11-09 01:55:09,057 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:55:09" (1/1) ... [2024-11-09 01:55:09,095 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:55:09,276 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-63.i[916,929] [2024-11-09 01:55:09,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:55:09,384 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:55:09,399 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-63.i[916,929] [2024-11-09 01:55:09,443 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:55:09,473 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:55:09,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:55:09 WrapperNode [2024-11-09 01:55:09,474 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:55:09,475 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:55:09,475 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:55:09,475 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:55:09,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:55:09" (1/1) ... [2024-11-09 01:55:09,508 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:55:09" (1/1) ... [2024-11-09 01:55:09,557 INFO L138 Inliner]: procedures = 36, calls = 221, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 706 [2024-11-09 01:55:09,558 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:55:09,559 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:55:09,559 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:55:09,559 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:55:09,569 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:55:09" (1/1) ... [2024-11-09 01:55:09,573 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:55:09" (1/1) ... [2024-11-09 01:55:09,584 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:55:09" (1/1) ... [2024-11-09 01:55:09,633 INFO L175 MemorySlicer]: Split 174 memory accesses to 19 slices as follows [2, 3, 14, 12, 10, 8, 5, 8, 3, 6, 31, 10, 8, 6, 8, 8, 8, 19, 5]. 18 percent of accesses are in the largest equivalence class. The 20 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 19 writes are split as follows [0, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. [2024-11-09 01:55:09,633 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:55:09" (1/1) ... [2024-11-09 01:55:09,634 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:55:09" (1/1) ... [2024-11-09 01:55:09,669 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:55:09" (1/1) ... [2024-11-09 01:55:09,676 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:55:09" (1/1) ... [2024-11-09 01:55:09,690 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:55:09" (1/1) ... [2024-11-09 01:55:09,697 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:55:09" (1/1) ... [2024-11-09 01:55:09,708 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:55:09,709 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:55:09,709 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:55:09,709 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:55:09,710 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:55:09" (1/1) ... [2024-11-09 01:55:09,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:55:09,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:55:09,749 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) [2024-11-09 01:55:09,755 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 [2024-11-09 01:55:09,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:55:09,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-09 01:55:09,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-09 01:55:09,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-09 01:55:09,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-09 01:55:09,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-09 01:55:09,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-09 01:55:09,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-09 01:55:09,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-11-09 01:55:09,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-11-09 01:55:09,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-11-09 01:55:09,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-11-09 01:55:09,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2024-11-09 01:55:09,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2024-11-09 01:55:09,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2024-11-09 01:55:09,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#14 [2024-11-09 01:55:09,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#15 [2024-11-09 01:55:09,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#16 [2024-11-09 01:55:09,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#17 [2024-11-09 01:55:09,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#18 [2024-11-09 01:55:09,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-09 01:55:09,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-09 01:55:09,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-09 01:55:09,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-09 01:55:09,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-09 01:55:09,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-09 01:55:09,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-11-09 01:55:09,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2024-11-09 01:55:09,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2024-11-09 01:55:09,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2024-11-09 01:55:09,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2024-11-09 01:55:09,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2024-11-09 01:55:09,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2024-11-09 01:55:09,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#13 [2024-11-09 01:55:09,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#14 [2024-11-09 01:55:09,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#15 [2024-11-09 01:55:09,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#16 [2024-11-09 01:55:09,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#17 [2024-11-09 01:55:09,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#18 [2024-11-09 01:55:09,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 01:55:09,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 01:55:09,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-09 01:55:09,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-09 01:55:09,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-09 01:55:09,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-09 01:55:09,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-09 01:55:09,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-11-09 01:55:09,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-11-09 01:55:09,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-11-09 01:55:09,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-11-09 01:55:09,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2024-11-09 01:55:09,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2024-11-09 01:55:09,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2024-11-09 01:55:09,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#14 [2024-11-09 01:55:09,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#15 [2024-11-09 01:55:09,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#16 [2024-11-09 01:55:09,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#17 [2024-11-09 01:55:09,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#18 [2024-11-09 01:55:09,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-09 01:55:09,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-09 01:55:09,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-09 01:55:09,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-09 01:55:09,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-09 01:55:09,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-09 01:55:09,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-11-09 01:55:09,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2024-11-09 01:55:09,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2024-11-09 01:55:09,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2024-11-09 01:55:09,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2024-11-09 01:55:09,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2024-11-09 01:55:09,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2024-11-09 01:55:09,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#13 [2024-11-09 01:55:09,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#14 [2024-11-09 01:55:09,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#15 [2024-11-09 01:55:09,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#16 [2024-11-09 01:55:09,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#17 [2024-11-09 01:55:09,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#18 [2024-11-09 01:55:09,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-09 01:55:09,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-09 01:55:09,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-09 01:55:09,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-09 01:55:09,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-09 01:55:09,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-09 01:55:09,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-11-09 01:55:09,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2024-11-09 01:55:09,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2024-11-09 01:55:09,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2024-11-09 01:55:09,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2024-11-09 01:55:09,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#11 [2024-11-09 01:55:09,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#12 [2024-11-09 01:55:09,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#13 [2024-11-09 01:55:09,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#14 [2024-11-09 01:55:09,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#15 [2024-11-09 01:55:09,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#16 [2024-11-09 01:55:09,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#17 [2024-11-09 01:55:09,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#18 [2024-11-09 01:55:09,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 01:55:09,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-09 01:55:09,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-09 01:55:09,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-09 01:55:09,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-09 01:55:09,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-09 01:55:09,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-11-09 01:55:09,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2024-11-09 01:55:09,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2024-11-09 01:55:09,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2024-11-09 01:55:09,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2024-11-09 01:55:09,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2024-11-09 01:55:09,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2024-11-09 01:55:09,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#13 [2024-11-09 01:55:09,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#14 [2024-11-09 01:55:09,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#15 [2024-11-09 01:55:09,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#16 [2024-11-09 01:55:09,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#17 [2024-11-09 01:55:09,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#18 [2024-11-09 01:55:09,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-09 01:55:09,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-09 01:55:09,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-09 01:55:09,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-09 01:55:09,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-09 01:55:09,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-09 01:55:09,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-11-09 01:55:09,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2024-11-09 01:55:09,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2024-11-09 01:55:09,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2024-11-09 01:55:09,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2024-11-09 01:55:09,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#11 [2024-11-09 01:55:09,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#12 [2024-11-09 01:55:09,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#13 [2024-11-09 01:55:09,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#14 [2024-11-09 01:55:09,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#15 [2024-11-09 01:55:09,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#16 [2024-11-09 01:55:09,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#17 [2024-11-09 01:55:09,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#18 [2024-11-09 01:55:09,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-09 01:55:09,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-09 01:55:09,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-09 01:55:09,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-09 01:55:09,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-09 01:55:09,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-09 01:55:09,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-11-09 01:55:09,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2024-11-09 01:55:09,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2024-11-09 01:55:09,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2024-11-09 01:55:09,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2024-11-09 01:55:09,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#11 [2024-11-09 01:55:09,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#12 [2024-11-09 01:55:09,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#13 [2024-11-09 01:55:09,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#14 [2024-11-09 01:55:09,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#15 [2024-11-09 01:55:09,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#16 [2024-11-09 01:55:09,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#17 [2024-11-09 01:55:09,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#18 [2024-11-09 01:55:09,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-09 01:55:09,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-09 01:55:09,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-09 01:55:09,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-09 01:55:09,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-09 01:55:09,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-09 01:55:09,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-11-09 01:55:09,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2024-11-09 01:55:09,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2024-11-09 01:55:09,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2024-11-09 01:55:09,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2024-11-09 01:55:09,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#11 [2024-11-09 01:55:09,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#12 [2024-11-09 01:55:09,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#13 [2024-11-09 01:55:09,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#14 [2024-11-09 01:55:09,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#15 [2024-11-09 01:55:09,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#16 [2024-11-09 01:55:09,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#17 [2024-11-09 01:55:09,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#18 [2024-11-09 01:55:09,823 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:55:09,825 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:55:09,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:55:09,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:55:09,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-09 01:55:09,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-09 01:55:09,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-09 01:55:09,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-09 01:55:09,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-09 01:55:09,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-09 01:55:09,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-09 01:55:09,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-11-09 01:55:09,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-11-09 01:55:09,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-11-09 01:55:09,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-11-09 01:55:09,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2024-11-09 01:55:09,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2024-11-09 01:55:09,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2024-11-09 01:55:09,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#14 [2024-11-09 01:55:09,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#15 [2024-11-09 01:55:09,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#16 [2024-11-09 01:55:09,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#17 [2024-11-09 01:55:09,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#18 [2024-11-09 01:55:09,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-09 01:55:09,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-09 01:55:09,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-09 01:55:09,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-09 01:55:09,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-09 01:55:09,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-09 01:55:09,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-11-09 01:55:09,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2024-11-09 01:55:09,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2024-11-09 01:55:09,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2024-11-09 01:55:09,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2024-11-09 01:55:09,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#11 [2024-11-09 01:55:09,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#12 [2024-11-09 01:55:09,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#13 [2024-11-09 01:55:09,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#14 [2024-11-09 01:55:09,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#15 [2024-11-09 01:55:09,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#16 [2024-11-09 01:55:09,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#17 [2024-11-09 01:55:09,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#18 [2024-11-09 01:55:09,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-09 01:55:09,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-09 01:55:09,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-09 01:55:09,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-09 01:55:09,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-09 01:55:09,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-09 01:55:09,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-11-09 01:55:09,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2024-11-09 01:55:09,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2024-11-09 01:55:09,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2024-11-09 01:55:09,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2024-11-09 01:55:09,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2024-11-09 01:55:09,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2024-11-09 01:55:09,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#13 [2024-11-09 01:55:09,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#14 [2024-11-09 01:55:09,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#15 [2024-11-09 01:55:09,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#16 [2024-11-09 01:55:09,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#17 [2024-11-09 01:55:09,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#18 [2024-11-09 01:55:10,176 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:55:10,181 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:55:12,167 INFO L? ?]: Removed 203 outVars from TransFormulas that were not future-live. [2024-11-09 01:55:12,168 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:55:12,182 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:55:12,183 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:55:12,183 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:55:12 BoogieIcfgContainer [2024-11-09 01:55:12,183 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:55:12,187 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:55:12,187 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:55:12,190 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:55:12,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:55:09" (1/3) ... [2024-11-09 01:55:12,191 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44d78235 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:55:12, skipping insertion in model container [2024-11-09 01:55:12,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:55:09" (2/3) ... [2024-11-09 01:55:12,191 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44d78235 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:55:12, skipping insertion in model container [2024-11-09 01:55:12,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:55:12" (3/3) ... [2024-11-09 01:55:12,193 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-63.i [2024-11-09 01:55:12,211 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:55:12,211 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:55:12,290 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:55:12,298 INFO L333 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, 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;@6eec4899, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:55:12,299 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:55:12,303 INFO L276 IsEmpty]: Start isEmpty. Operand has 139 states, 118 states have (on average 1.4322033898305084) internal successors, (169), 119 states have internal predecessors, (169), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 01:55:12,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-09 01:55:12,320 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:55:12,321 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:55:12,321 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:55:12,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:55:12,327 INFO L85 PathProgramCache]: Analyzing trace with hash -16098142, now seen corresponding path program 1 times [2024-11-09 01:55:12,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:55:12,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1336639872] [2024-11-09 01:55:12,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:55:12,346 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:55:12,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:55:12,347 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:55:12,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 01:55:13,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:13,052 INFO L255 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 01:55:13,062 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:55:13,112 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-11-09 01:55:13,112 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:55:13,113 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:55:13,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1336639872] [2024-11-09 01:55:13,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1336639872] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:55:13,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:55:13,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:55:13,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550731554] [2024-11-09 01:55:13,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:55:13,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:55:13,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:55:13,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:55:13,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:55:13,155 INFO L87 Difference]: Start difference. First operand has 139 states, 118 states have (on average 1.4322033898305084) internal successors, (169), 119 states have internal predecessors, (169), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 01:55:13,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:55:13,202 INFO L93 Difference]: Finished difference Result 271 states and 422 transitions. [2024-11-09 01:55:13,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:55:13,208 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 156 [2024-11-09 01:55:13,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:55:13,216 INFO L225 Difference]: With dead ends: 271 [2024-11-09 01:55:13,217 INFO L226 Difference]: Without dead ends: 135 [2024-11-09 01:55:13,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:55:13,228 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:55:13,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:55:13,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-09 01:55:13,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-11-09 01:55:13,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 115 states have (on average 1.4086956521739131) internal successors, (162), 115 states have internal predecessors, (162), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 01:55:13,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 198 transitions. [2024-11-09 01:55:13,294 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 198 transitions. Word has length 156 [2024-11-09 01:55:13,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:55:13,295 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 198 transitions. [2024-11-09 01:55:13,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 01:55:13,296 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 198 transitions. [2024-11-09 01:55:13,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-09 01:55:13,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:55:13,300 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:55:13,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 01:55:13,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:55:13,503 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:55:13,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:55:13,503 INFO L85 PathProgramCache]: Analyzing trace with hash 413675062, now seen corresponding path program 1 times [2024-11-09 01:55:13,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:55:13,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [894260450] [2024-11-09 01:55:13,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:55:13,505 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:55:13,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:55:13,508 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:55:13,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 01:55:14,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:14,124 INFO L255 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 01:55:14,130 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:55:14,190 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:55:14,191 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:55:14,191 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:55:14,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [894260450] [2024-11-09 01:55:14,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [894260450] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:55:14,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:55:14,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:55:14,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486398668] [2024-11-09 01:55:14,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:55:14,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:55:14,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:55:14,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:55:14,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:55:14,195 INFO L87 Difference]: Start difference. First operand 135 states and 198 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:55:14,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:55:14,246 INFO L93 Difference]: Finished difference Result 269 states and 396 transitions. [2024-11-09 01:55:14,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:55:14,246 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 156 [2024-11-09 01:55:14,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:55:14,250 INFO L225 Difference]: With dead ends: 269 [2024-11-09 01:55:14,251 INFO L226 Difference]: Without dead ends: 137 [2024-11-09 01:55:14,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:55:14,253 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:55:14,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 577 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:55:14,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-09 01:55:14,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-11-09 01:55:14,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 117 states have (on average 1.4017094017094016) internal successors, (164), 117 states have internal predecessors, (164), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 01:55:14,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 200 transitions. [2024-11-09 01:55:14,267 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 200 transitions. Word has length 156 [2024-11-09 01:55:14,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:55:14,269 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 200 transitions. [2024-11-09 01:55:14,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:55:14,269 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 200 transitions. [2024-11-09 01:55:14,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-09 01:55:14,273 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:55:14,273 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:55:14,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-09 01:55:14,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:55:14,474 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:55:14,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:55:14,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1261194609, now seen corresponding path program 1 times [2024-11-09 01:55:14,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:55:14,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [75956799] [2024-11-09 01:55:14,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:55:14,476 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:55:14,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:55:14,479 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:55:14,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 01:55:15,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:15,102 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 01:55:15,112 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:55:15,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2024-11-09 01:55:15,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 01:55:16,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2024-11-09 01:55:16,029 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 13 proven. 263 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2024-11-09 01:55:16,030 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:55:16,488 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-09 01:55:16,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2024-11-09 01:55:16,641 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-09 01:55:16,641 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:55:16,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [75956799] [2024-11-09 01:55:16,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [75956799] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:55:16,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:55:16,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2024-11-09 01:55:16,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345332303] [2024-11-09 01:55:16,642 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 01:55:16,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 01:55:16,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:55:16,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 01:55:16,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-09 01:55:16,645 INFO L87 Difference]: Start difference. First operand 137 states and 200 transitions. Second operand has 13 states, 11 states have (on average 9.0) internal successors, (99), 13 states have internal predecessors, (99), 4 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 2 states have call predecessors, (36), 4 states have call successors, (36) [2024-11-09 01:55:18,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:55:18,004 INFO L93 Difference]: Finished difference Result 279 states and 404 transitions. [2024-11-09 01:55:18,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 01:55:18,005 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 9.0) internal successors, (99), 13 states have internal predecessors, (99), 4 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 2 states have call predecessors, (36), 4 states have call successors, (36) Word has length 158 [2024-11-09 01:55:18,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:55:18,007 INFO L225 Difference]: With dead ends: 279 [2024-11-09 01:55:18,007 INFO L226 Difference]: Without dead ends: 145 [2024-11-09 01:55:18,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 304 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=153, Invalid=399, Unknown=0, NotChecked=0, Total=552 [2024-11-09 01:55:18,010 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 859 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 01:55:18,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 783 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 01:55:18,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-09 01:55:18,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 141. [2024-11-09 01:55:18,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 120 states have (on average 1.3833333333333333) internal successors, (166), 120 states have internal predecessors, (166), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 01:55:18,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 202 transitions. [2024-11-09 01:55:18,030 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 202 transitions. Word has length 158 [2024-11-09 01:55:18,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:55:18,031 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 202 transitions. [2024-11-09 01:55:18,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 9.0) internal successors, (99), 13 states have internal predecessors, (99), 4 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 2 states have call predecessors, (36), 4 states have call successors, (36) [2024-11-09 01:55:18,031 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 202 transitions. [2024-11-09 01:55:18,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-09 01:55:18,038 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:55:18,038 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:55:18,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-09 01:55:18,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:55:18,239 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:55:18,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:55:18,240 INFO L85 PathProgramCache]: Analyzing trace with hash -732950097, now seen corresponding path program 1 times [2024-11-09 01:55:18,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:55:18,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [489057073] [2024-11-09 01:55:18,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:55:18,241 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:55:18,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:55:18,244 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:55:18,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 01:55:18,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:18,856 INFO L255 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 01:55:18,867 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:55:19,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2024-11-09 01:55:19,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 01:55:20,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-09 01:55:20,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2024-11-09 01:55:20,125 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 13 proven. 263 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2024-11-09 01:55:20,125 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:55:21,286 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:55:21,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 52 [2024-11-09 01:55:21,557 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-09 01:55:21,557 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:55:21,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [489057073] [2024-11-09 01:55:21,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [489057073] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:55:21,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:55:21,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2024-11-09 01:55:21,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127777211] [2024-11-09 01:55:21,558 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 01:55:21,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-09 01:55:21,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:55:21,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-09 01:55:21,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2024-11-09 01:55:21,563 INFO L87 Difference]: Start difference. First operand 141 states and 202 transitions. Second operand has 20 states, 18 states have (on average 7.555555555555555) internal successors, (136), 19 states have internal predecessors, (136), 6 states have call successors, (36), 4 states have call predecessors, (36), 5 states have return successors, (36), 4 states have call predecessors, (36), 6 states have call successors, (36) [2024-11-09 01:55:23,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:55:23,894 INFO L93 Difference]: Finished difference Result 425 states and 608 transitions. [2024-11-09 01:55:23,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 01:55:23,895 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 7.555555555555555) internal successors, (136), 19 states have internal predecessors, (136), 6 states have call successors, (36), 4 states have call predecessors, (36), 5 states have return successors, (36), 4 states have call predecessors, (36), 6 states have call successors, (36) Word has length 158 [2024-11-09 01:55:23,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:55:23,899 INFO L225 Difference]: With dead ends: 425 [2024-11-09 01:55:23,899 INFO L226 Difference]: Without dead ends: 287 [2024-11-09 01:55:23,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=240, Invalid=816, Unknown=0, NotChecked=0, Total=1056 [2024-11-09 01:55:23,903 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 702 mSDsluCounter, 2216 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 2382 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-09 01:55:23,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 2382 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-09 01:55:23,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-11-09 01:55:23,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 273. [2024-11-09 01:55:23,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 232 states have (on average 1.3879310344827587) internal successors, (322), 232 states have internal predecessors, (322), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-09 01:55:23,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 394 transitions. [2024-11-09 01:55:23,948 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 394 transitions. Word has length 158 [2024-11-09 01:55:23,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:55:23,948 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 394 transitions. [2024-11-09 01:55:23,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 7.555555555555555) internal successors, (136), 19 states have internal predecessors, (136), 6 states have call successors, (36), 4 states have call predecessors, (36), 5 states have return successors, (36), 4 states have call predecessors, (36), 6 states have call successors, (36) [2024-11-09 01:55:23,949 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 394 transitions. [2024-11-09 01:55:23,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-09 01:55:23,951 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:55:23,951 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:55:23,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-09 01:55:24,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:55:24,152 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:55:24,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:55:24,152 INFO L85 PathProgramCache]: Analyzing trace with hash 414457706, now seen corresponding path program 1 times [2024-11-09 01:55:24,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:55:24,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1497891261] [2024-11-09 01:55:24,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:55:24,153 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:55:24,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:55:24,154 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:55:24,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-09 01:55:24,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:24,717 INFO L255 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 01:55:24,722 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:55:24,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-09 01:55:24,789 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:55:24,789 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:55:24,790 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:55:24,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1497891261] [2024-11-09 01:55:24,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1497891261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:55:24,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:55:24,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:55:24,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937229884] [2024-11-09 01:55:24,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:55:24,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:55:24,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:55:24,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:55:24,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:55:24,792 INFO L87 Difference]: Start difference. First operand 273 states and 394 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:55:24,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:55:24,900 INFO L93 Difference]: Finished difference Result 593 states and 852 transitions. [2024-11-09 01:55:24,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:55:24,901 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 160 [2024-11-09 01:55:24,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:55:24,904 INFO L225 Difference]: With dead ends: 593 [2024-11-09 01:55:24,904 INFO L226 Difference]: Without dead ends: 323 [2024-11-09 01:55:24,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:55:24,907 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 137 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:55:24,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 824 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:55:24,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2024-11-09 01:55:24,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 322. [2024-11-09 01:55:24,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 272 states have (on average 1.375) internal successors, (374), 273 states have internal predecessors, (374), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-09 01:55:24,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 458 transitions. [2024-11-09 01:55:24,945 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 458 transitions. Word has length 160 [2024-11-09 01:55:24,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:55:24,946 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 458 transitions. [2024-11-09 01:55:24,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:55:24,946 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 458 transitions. [2024-11-09 01:55:24,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-09 01:55:24,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:55:24,948 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:55:24,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-09 01:55:25,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:55:25,149 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:55:25,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:55:25,150 INFO L85 PathProgramCache]: Analyzing trace with hash -172348308, now seen corresponding path program 1 times [2024-11-09 01:55:25,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:55:25,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [584494062] [2024-11-09 01:55:25,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:55:25,151 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:55:25,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:55:25,154 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:55:25,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-09 01:55:25,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:25,725 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 01:55:25,729 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:55:25,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-09 01:55:25,804 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:55:25,804 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:55:25,805 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:55:25,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [584494062] [2024-11-09 01:55:25,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [584494062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:55:25,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:55:25,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:55:25,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643612585] [2024-11-09 01:55:25,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:55:25,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:55:25,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:55:25,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:55:25,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:55:25,807 INFO L87 Difference]: Start difference. First operand 322 states and 458 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:55:26,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:55:26,716 INFO L93 Difference]: Finished difference Result 844 states and 1193 transitions. [2024-11-09 01:55:26,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:55:26,717 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 160 [2024-11-09 01:55:26,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:55:26,722 INFO L225 Difference]: With dead ends: 844 [2024-11-09 01:55:26,722 INFO L226 Difference]: Without dead ends: 562 [2024-11-09 01:55:26,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:55:26,724 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 149 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1272 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 01:55:26,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1272 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 01:55:26,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2024-11-09 01:55:26,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 454. [2024-11-09 01:55:26,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 383 states have (on average 1.360313315926893) internal successors, (521), 385 states have internal predecessors, (521), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-09 01:55:26,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 641 transitions. [2024-11-09 01:55:26,769 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 641 transitions. Word has length 160 [2024-11-09 01:55:26,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:55:26,770 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 641 transitions. [2024-11-09 01:55:26,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:55:26,770 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 641 transitions. [2024-11-09 01:55:26,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-09 01:55:26,772 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:55:26,772 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:55:26,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-09 01:55:26,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:55:26,973 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:55:26,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:55:26,973 INFO L85 PathProgramCache]: Analyzing trace with hash 974105366, now seen corresponding path program 1 times [2024-11-09 01:55:26,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:55:26,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [56907704] [2024-11-09 01:55:26,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:55:26,974 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:55:26,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:55:26,975 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:55:26,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-09 01:55:27,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:27,504 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 01:55:27,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:55:27,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2024-11-09 01:55:27,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 01:55:27,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2024-11-09 01:55:27,907 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 13 proven. 263 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2024-11-09 01:55:27,907 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:55:28,137 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-09 01:55:28,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2024-11-09 01:55:28,222 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-09 01:55:28,222 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:55:28,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [56907704] [2024-11-09 01:55:28,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [56907704] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:55:28,222 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:55:28,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2024-11-09 01:55:28,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430159659] [2024-11-09 01:55:28,223 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 01:55:28,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 01:55:28,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:55:28,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 01:55:28,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-09 01:55:28,224 INFO L87 Difference]: Start difference. First operand 454 states and 641 transitions. Second operand has 13 states, 11 states have (on average 8.181818181818182) internal successors, (90), 13 states have internal predecessors, (90), 4 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 2 states have call predecessors, (36), 4 states have call successors, (36) [2024-11-09 01:55:29,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:55:29,188 INFO L93 Difference]: Finished difference Result 628 states and 880 transitions. [2024-11-09 01:55:29,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 01:55:29,189 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 8.181818181818182) internal successors, (90), 13 states have internal predecessors, (90), 4 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 2 states have call predecessors, (36), 4 states have call successors, (36) Word has length 160 [2024-11-09 01:55:29,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:55:29,192 INFO L225 Difference]: With dead ends: 628 [2024-11-09 01:55:29,192 INFO L226 Difference]: Without dead ends: 468 [2024-11-09 01:55:29,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 308 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=399, Unknown=0, NotChecked=0, Total=552 [2024-11-09 01:55:29,193 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 738 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 01:55:29,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [738 Valid, 786 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 01:55:29,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2024-11-09 01:55:29,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 454. [2024-11-09 01:55:29,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 383 states have (on average 1.3577023498694516) internal successors, (520), 385 states have internal predecessors, (520), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-09 01:55:29,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 640 transitions. [2024-11-09 01:55:29,230 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 640 transitions. Word has length 160 [2024-11-09 01:55:29,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:55:29,230 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 640 transitions. [2024-11-09 01:55:29,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 8.181818181818182) internal successors, (90), 13 states have internal predecessors, (90), 4 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 2 states have call predecessors, (36), 4 states have call successors, (36) [2024-11-09 01:55:29,231 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 640 transitions. [2024-11-09 01:55:29,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-09 01:55:29,232 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:55:29,233 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:55:29,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-09 01:55:29,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:55:29,434 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:55:29,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:55:29,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1675705240, now seen corresponding path program 1 times [2024-11-09 01:55:29,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:55:29,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1528843840] [2024-11-09 01:55:29,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:55:29,435 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:55:29,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:55:29,436 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:55:29,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-09 01:55:29,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:29,978 INFO L255 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 01:55:29,983 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:55:30,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2024-11-09 01:55:30,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 01:55:30,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-09 01:55:30,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-09 01:55:30,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2024-11-09 01:55:30,617 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 13 proven. 263 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2024-11-09 01:55:30,617 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:55:30,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2024-11-09 01:55:30,827 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:55:30,837 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:55:30,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 38 [2024-11-09 01:55:30,971 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:55:30,972 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:55:30,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1528843840] [2024-11-09 01:55:30,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1528843840] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 01:55:30,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:55:30,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 17 [2024-11-09 01:55:30,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846970917] [2024-11-09 01:55:30,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:55:30,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:55:30,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:55:30,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:55:30,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2024-11-09 01:55:30,974 INFO L87 Difference]: Start difference. First operand 454 states and 640 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:55:31,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:55:31,891 INFO L93 Difference]: Finished difference Result 803 states and 1126 transitions. [2024-11-09 01:55:31,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 01:55:31,892 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 160 [2024-11-09 01:55:31,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:55:31,896 INFO L225 Difference]: With dead ends: 803 [2024-11-09 01:55:31,896 INFO L226 Difference]: Without dead ends: 643 [2024-11-09 01:55:31,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2024-11-09 01:55:31,897 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 176 mSDsluCounter, 1226 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 1504 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 01:55:31,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 1504 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 01:55:31,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2024-11-09 01:55:31,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 412. [2024-11-09 01:55:31,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 349 states have (on average 1.3581661891117478) internal successors, (474), 350 states have internal predecessors, (474), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-09 01:55:31,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 582 transitions. [2024-11-09 01:55:31,939 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 582 transitions. Word has length 160 [2024-11-09 01:55:31,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:55:31,940 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 582 transitions. [2024-11-09 01:55:31,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:55:31,940 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 582 transitions. [2024-11-09 01:55:31,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-09 01:55:31,941 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:55:31,941 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:55:31,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-09 01:55:32,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:55:32,143 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:55:32,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:55:32,143 INFO L85 PathProgramCache]: Analyzing trace with hash 590692053, now seen corresponding path program 1 times [2024-11-09 01:55:32,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:55:32,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1130544851] [2024-11-09 01:55:32,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:55:32,144 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:55:32,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:55:32,147 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:55:32,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-09 01:55:32,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:32,795 INFO L255 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 01:55:32,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:55:33,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-09 01:55:33,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 44 [2024-11-09 01:55:33,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2024-11-09 01:55:33,270 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 13 proven. 263 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2024-11-09 01:55:33,271 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:55:33,495 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:55:33,495 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:55:33,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1130544851] [2024-11-09 01:55:33,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1130544851] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 01:55:33,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:55:33,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 14 [2024-11-09 01:55:33,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279705383] [2024-11-09 01:55:33,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:55:33,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:55:33,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:55:33,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:55:33,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-11-09 01:55:33,497 INFO L87 Difference]: Start difference. First operand 412 states and 582 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:55:34,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:55:34,385 INFO L93 Difference]: Finished difference Result 432 states and 600 transitions. [2024-11-09 01:55:34,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:55:34,386 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 163 [2024-11-09 01:55:34,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:55:34,388 INFO L225 Difference]: With dead ends: 432 [2024-11-09 01:55:34,388 INFO L226 Difference]: Without dead ends: 430 [2024-11-09 01:55:34,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2024-11-09 01:55:34,389 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 111 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 01:55:34,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 805 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 01:55:34,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2024-11-09 01:55:34,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 430. [2024-11-09 01:55:34,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 364 states have (on average 1.3434065934065933) internal successors, (489), 365 states have internal predecessors, (489), 54 states have call successors, (54), 11 states have call predecessors, (54), 11 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-09 01:55:34,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 597 transitions. [2024-11-09 01:55:34,441 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 597 transitions. Word has length 163 [2024-11-09 01:55:34,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:55:34,442 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 597 transitions. [2024-11-09 01:55:34,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:55:34,442 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 597 transitions. [2024-11-09 01:55:34,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-09 01:55:34,443 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:55:34,443 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:55:34,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-09 01:55:34,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:55:34,645 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:55:34,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:55:34,645 INFO L85 PathProgramCache]: Analyzing trace with hash 592539095, now seen corresponding path program 1 times [2024-11-09 01:55:34,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:55:34,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1078608933] [2024-11-09 01:55:34,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:55:34,646 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:55:34,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:55:34,649 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:55:34,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-09 01:55:35,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:35,266 INFO L255 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 01:55:35,270 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:55:36,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 34 [2024-11-09 01:55:36,815 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:55:36,815 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:55:36,815 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:55:36,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1078608933] [2024-11-09 01:55:36,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1078608933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:55:36,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:55:36,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 01:55:36,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352719321] [2024-11-09 01:55:36,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:55:36,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:55:36,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:55:36,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:55:36,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:55:36,817 INFO L87 Difference]: Start difference. First operand 430 states and 597 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:55:41,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:55:41,046 INFO L93 Difference]: Finished difference Result 1204 states and 1672 transitions. [2024-11-09 01:55:41,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 01:55:41,055 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 163 [2024-11-09 01:55:41,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:55:41,059 INFO L225 Difference]: With dead ends: 1204 [2024-11-09 01:55:41,059 INFO L226 Difference]: Without dead ends: 846 [2024-11-09 01:55:41,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-09 01:55:41,060 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 458 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:55:41,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 773 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-09 01:55:41,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2024-11-09 01:55:41,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 636. [2024-11-09 01:55:41,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 505 states have (on average 1.306930693069307) internal successors, (660), 507 states have internal predecessors, (660), 108 states have call successors, (108), 22 states have call predecessors, (108), 22 states have return successors, (108), 106 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-09 01:55:41,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 876 transitions. [2024-11-09 01:55:41,138 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 876 transitions. Word has length 163 [2024-11-09 01:55:41,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:55:41,138 INFO L471 AbstractCegarLoop]: Abstraction has 636 states and 876 transitions. [2024-11-09 01:55:41,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:55:41,139 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 876 transitions. [2024-11-09 01:55:41,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-09 01:55:41,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:55:41,140 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:55:41,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-09 01:55:41,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:55:41,341 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:55:41,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:55:41,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1252070617, now seen corresponding path program 1 times [2024-11-09 01:55:41,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:55:41,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1789940090] [2024-11-09 01:55:41,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:55:41,342 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:55:41,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:55:41,344 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:55:41,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-09 01:55:41,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:41,968 INFO L255 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 01:55:41,972 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:55:43,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 34 [2024-11-09 01:55:43,476 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:55:43,476 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:55:43,477 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:55:43,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1789940090] [2024-11-09 01:55:43,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1789940090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:55:43,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:55:43,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 01:55:43,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438574223] [2024-11-09 01:55:43,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:55:43,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:55:43,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:55:43,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:55:43,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:55:43,479 INFO L87 Difference]: Start difference. First operand 636 states and 876 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:55:48,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:55:48,363 INFO L93 Difference]: Finished difference Result 1346 states and 1860 transitions. [2024-11-09 01:55:48,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 01:55:48,375 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 163 [2024-11-09 01:55:48,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:55:48,379 INFO L225 Difference]: With dead ends: 1346 [2024-11-09 01:55:48,380 INFO L226 Difference]: Without dead ends: 846 [2024-11-09 01:55:48,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-09 01:55:48,382 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 446 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-09 01:55:48,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 771 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-09 01:55:48,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2024-11-09 01:55:48,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 714. [2024-11-09 01:55:48,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 714 states, 583 states have (on average 1.3259005145797598) internal successors, (773), 585 states have internal predecessors, (773), 108 states have call successors, (108), 22 states have call predecessors, (108), 22 states have return successors, (108), 106 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-09 01:55:48,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 989 transitions. [2024-11-09 01:55:48,467 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 989 transitions. Word has length 163 [2024-11-09 01:55:48,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:55:48,467 INFO L471 AbstractCegarLoop]: Abstraction has 714 states and 989 transitions. [2024-11-09 01:55:48,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:55:48,467 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 989 transitions. [2024-11-09 01:55:48,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-09 01:55:48,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:55:48,469 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:55:48,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-09 01:55:48,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:55:48,670 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:55:48,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:55:48,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1314110231, now seen corresponding path program 1 times [2024-11-09 01:55:48,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:55:48,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [180022756] [2024-11-09 01:55:48,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:55:48,671 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:55:48,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:55:48,672 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:55:48,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-09 01:55:49,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:55:49,322 INFO L255 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-09 01:55:49,327 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:55:55,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 34 [2024-11-09 01:55:55,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 43 [2024-11-09 01:55:55,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 34 [2024-11-09 01:55:56,161 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 284 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2024-11-09 01:55:56,161 INFO L311 TraceCheckSpWp]: Computing backward predicates...