./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-67.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a22e9702-cfde-4469-bc9e-d2be64eb75db/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a22e9702-cfde-4469-bc9e-d2be64eb75db/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a22e9702-cfde-4469-bc9e-d2be64eb75db/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a22e9702-cfde-4469-bc9e-d2be64eb75db/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-67.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a22e9702-cfde-4469-bc9e-d2be64eb75db/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a22e9702-cfde-4469-bc9e-d2be64eb75db/bin/uautomizer-verify-4GaUIPS5ZU --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 acedb713d8fb6ee88e504476b1a8afa9aad0050a29ab1fa7a298d11252db5c53 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:13:38,502 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:13:38,599 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a22e9702-cfde-4469-bc9e-d2be64eb75db/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-31 22:13:38,606 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:13:38,610 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:13:38,653 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:13:38,654 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:13:38,655 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:13:38,656 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:13:38,657 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:13:38,657 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:13:38,658 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:13:38,659 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:13:38,660 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:13:38,660 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:13:38,661 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:13:38,661 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:13:38,661 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:13:38,662 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:13:38,662 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:13:38,663 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:13:38,667 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:13:38,667 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:13:38,668 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:13:38,668 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:13:38,668 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:13:38,668 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:13:38,669 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:13:38,669 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:13:38,669 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:13:38,669 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:13:38,670 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:13:38,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:13:38,670 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:13:38,671 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:13:38,672 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:13:38,673 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:13:38,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:13:38,674 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:13:38,674 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:13:38,675 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:13:38,675 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:13:38,675 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a22e9702-cfde-4469-bc9e-d2be64eb75db/bin/uautomizer-verify-4GaUIPS5ZU/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a22e9702-cfde-4469-bc9e-d2be64eb75db/bin/uautomizer-verify-4GaUIPS5ZU 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 -> acedb713d8fb6ee88e504476b1a8afa9aad0050a29ab1fa7a298d11252db5c53 [2024-10-31 22:13:39,024 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:13:39,053 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:13:39,056 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:13:39,057 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:13:39,058 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:13:39,059 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a22e9702-cfde-4469-bc9e-d2be64eb75db/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-67.i Unable to find full path for "g++" [2024-10-31 22:13:41,112 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:13:41,399 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:13:41,400 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a22e9702-cfde-4469-bc9e-d2be64eb75db/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-67.i [2024-10-31 22:13:41,410 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a22e9702-cfde-4469-bc9e-d2be64eb75db/bin/uautomizer-verify-4GaUIPS5ZU/data/1d18cfd1a/93c3daec26ad41a69a05817aa13b0e6d/FLAG7c5bd37a9 [2024-10-31 22:13:41,426 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a22e9702-cfde-4469-bc9e-d2be64eb75db/bin/uautomizer-verify-4GaUIPS5ZU/data/1d18cfd1a/93c3daec26ad41a69a05817aa13b0e6d [2024-10-31 22:13:41,430 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:13:41,432 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:13:41,433 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:13:41,434 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:13:41,442 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:13:41,443 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:13:41" (1/1) ... [2024-10-31 22:13:41,447 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50577b12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:41, skipping insertion in model container [2024-10-31 22:13:41,447 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:13:41" (1/1) ... [2024-10-31 22:13:41,495 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:13:41,723 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a22e9702-cfde-4469-bc9e-d2be64eb75db/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-67.i[916,929] [2024-10-31 22:13:41,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:13:41,815 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:13:41,826 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a22e9702-cfde-4469-bc9e-d2be64eb75db/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-67.i[916,929] [2024-10-31 22:13:41,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:13:41,905 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:13:41,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:41 WrapperNode [2024-10-31 22:13:41,906 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:13:41,907 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:13:41,908 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:13:41,908 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:13:41,915 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:41" (1/1) ... [2024-10-31 22:13:41,928 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:41" (1/1) ... [2024-10-31 22:13:41,975 INFO L138 Inliner]: procedures = 29, calls = 141, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 433 [2024-10-31 22:13:41,975 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:13:41,976 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:13:41,976 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:13:41,976 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:13:41,992 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:41" (1/1) ... [2024-10-31 22:13:41,992 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:41" (1/1) ... [2024-10-31 22:13:41,997 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:41" (1/1) ... [2024-10-31 22:13:42,026 INFO L175 MemorySlicer]: Split 106 memory accesses to 13 slices as follows [2, 6, 14, 10, 14, 16, 10, 6, 7, 3, 10, 3, 5]. 15 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 16 writes are split as follows [0, 1, 1, 1, 2, 1, 4, 1, 1, 1, 1, 1, 1]. [2024-10-31 22:13:42,031 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:41" (1/1) ... [2024-10-31 22:13:42,031 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:41" (1/1) ... [2024-10-31 22:13:42,069 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:41" (1/1) ... [2024-10-31 22:13:42,082 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:41" (1/1) ... [2024-10-31 22:13:42,090 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:41" (1/1) ... [2024-10-31 22:13:42,097 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:41" (1/1) ... [2024-10-31 22:13:42,110 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:13:42,111 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:13:42,112 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:13:42,112 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:13:42,117 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:41" (1/1) ... [2024-10-31 22:13:42,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:13:42,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a22e9702-cfde-4469-bc9e-d2be64eb75db/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:13:42,161 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a22e9702-cfde-4469-bc9e-d2be64eb75db/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:13:42,165 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a22e9702-cfde-4469-bc9e-d2be64eb75db/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:13:42,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:13:42,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-31 22:13:42,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-31 22:13:42,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-31 22:13:42,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-31 22:13:42,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-31 22:13:42,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-31 22:13:42,210 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-10-31 22:13:42,210 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-10-31 22:13:42,210 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-10-31 22:13:42,211 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-10-31 22:13:42,211 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-10-31 22:13:42,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2024-10-31 22:13:42,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2024-10-31 22:13:42,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-31 22:13:42,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-31 22:13:42,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-31 22:13:42,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-31 22:13:42,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-31 22:13:42,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-31 22:13:42,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-31 22:13:42,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-31 22:13:42,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-31 22:13:42,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-31 22:13:42,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-10-31 22:13:42,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-10-31 22:13:42,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-10-31 22:13:42,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-31 22:13:42,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-31 22:13:42,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-31 22:13:42,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-31 22:13:42,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-31 22:13:42,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-31 22:13:42,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-10-31 22:13:42,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-10-31 22:13:42,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-10-31 22:13:42,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-10-31 22:13:42,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-10-31 22:13:42,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2024-10-31 22:13:42,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2024-10-31 22:13:42,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-31 22:13:42,222 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-31 22:13:42,222 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-31 22:13:42,222 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-31 22:13:42,222 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-31 22:13:42,222 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-31 22:13:42,222 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-31 22:13:42,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-31 22:13:42,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-31 22:13:42,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-31 22:13:42,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-10-31 22:13:42,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-10-31 22:13:42,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-10-31 22:13:42,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-31 22:13:42,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-31 22:13:42,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-31 22:13:42,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-31 22:13:42,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-31 22:13:42,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-31 22:13:42,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-10-31 22:13:42,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-10-31 22:13:42,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-10-31 22:13:42,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-10-31 22:13:42,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-10-31 22:13:42,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2024-10-31 22:13:42,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2024-10-31 22:13:42,227 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 22:13:42,227 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 22:13:42,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:13:42,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-31 22:13:42,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-31 22:13:42,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-31 22:13:42,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-31 22:13:42,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-31 22:13:42,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-31 22:13:42,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-31 22:13:42,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-31 22:13:42,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-31 22:13:42,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-31 22:13:42,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-31 22:13:42,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-31 22:13:42,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:13:42,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:13:42,494 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:13:42,497 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:13:43,192 INFO L? ?]: Removed 96 outVars from TransFormulas that were not future-live. [2024-10-31 22:13:43,192 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:13:43,216 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:13:43,217 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 22:13:43,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:13:43 BoogieIcfgContainer [2024-10-31 22:13:43,218 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:13:43,221 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:13:43,221 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:13:43,228 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:13:43,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:13:41" (1/3) ... [2024-10-31 22:13:43,230 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16f52f7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:13:43, skipping insertion in model container [2024-10-31 22:13:43,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:41" (2/3) ... [2024-10-31 22:13:43,233 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16f52f7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:13:43, skipping insertion in model container [2024-10-31 22:13:43,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:13:43" (3/3) ... [2024-10-31 22:13:43,235 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-67.i [2024-10-31 22:13:43,265 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:13:43,266 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 22:13:43,356 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:13:43,363 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;@279b809a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:13:43,364 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 22:13:43,369 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 79 states have internal predecessors, (109), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-31 22:13:43,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-31 22:13:43,385 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:13:43,386 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:43,387 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:13:43,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:43,394 INFO L85 PathProgramCache]: Analyzing trace with hash -681937091, now seen corresponding path program 1 times [2024-10-31 22:13:43,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:43,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661546518] [2024-10-31 22:13:43,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:43,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:43,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:43,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:13:43,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:43,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:13:43,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:43,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:13:43,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:43,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:13:43,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:43,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:13:43,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:43,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:13:43,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:43,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:13:43,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:43,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:13:43,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:43,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:13:43,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:43,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:13:43,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:43,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:13:43,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:43,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 22:13:43,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:43,962 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 22:13:43,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:13:43,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661546518] [2024-10-31 22:13:43,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661546518] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:13:43,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:13:43,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:13:43,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711187830] [2024-10-31 22:13:43,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:13:43,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 22:13:43,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:13:44,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 22:13:44,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:13:44,021 INFO L87 Difference]: Start difference. First operand has 93 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 79 states have internal predecessors, (109), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-31 22:13:44,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:13:44,069 INFO L93 Difference]: Finished difference Result 179 states and 272 transitions. [2024-10-31 22:13:44,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 22:13:44,073 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 104 [2024-10-31 22:13:44,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:13:44,087 INFO L225 Difference]: With dead ends: 179 [2024-10-31 22:13:44,088 INFO L226 Difference]: Without dead ends: 89 [2024-10-31 22:13:44,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:13:44,102 INFO L432 NwaCegarLoop]: 126 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, 126 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-10-31 22:13:44,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:13:44,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-31 22:13:44,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-10-31 22:13:44,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 75 states have (on average 1.36) internal successors, (102), 75 states have internal predecessors, (102), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-31 22:13:44,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 126 transitions. [2024-10-31 22:13:44,181 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 126 transitions. Word has length 104 [2024-10-31 22:13:44,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:13:44,185 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 126 transitions. [2024-10-31 22:13:44,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-31 22:13:44,186 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 126 transitions. [2024-10-31 22:13:44,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-31 22:13:44,192 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:13:44,192 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:44,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:13:44,193 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:13:44,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:44,194 INFO L85 PathProgramCache]: Analyzing trace with hash 553584785, now seen corresponding path program 1 times [2024-10-31 22:13:44,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:44,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061464912] [2024-10-31 22:13:44,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:44,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:44,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:44,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:13:44,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:44,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:13:44,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:44,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:13:44,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:44,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:13:44,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:44,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:13:44,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:44,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:13:44,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:44,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:13:44,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:44,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:13:44,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:44,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:13:44,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:44,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:13:44,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:44,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:13:44,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:44,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 22:13:44,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:44,767 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 22:13:44,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:13:44,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061464912] [2024-10-31 22:13:44,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061464912] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:13:44,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:13:44,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:13:44,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951729051] [2024-10-31 22:13:44,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:13:44,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:13:44,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:13:44,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:13:44,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:13:44,772 INFO L87 Difference]: Start difference. First operand 89 states and 126 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:13:44,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:13:44,827 INFO L93 Difference]: Finished difference Result 178 states and 253 transitions. [2024-10-31 22:13:44,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:13:44,828 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2024-10-31 22:13:44,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:13:44,830 INFO L225 Difference]: With dead ends: 178 [2024-10-31 22:13:44,831 INFO L226 Difference]: Without dead ends: 92 [2024-10-31 22:13:44,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 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-10-31 22:13:44,833 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 1 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 358 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-10-31 22:13:44,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 358 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:13:44,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-31 22:13:44,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2024-10-31 22:13:44,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 77 states have (on average 1.3506493506493507) internal successors, (104), 77 states have internal predecessors, (104), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-31 22:13:44,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 128 transitions. [2024-10-31 22:13:44,847 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 128 transitions. Word has length 104 [2024-10-31 22:13:44,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:13:44,849 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 128 transitions. [2024-10-31 22:13:44,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:13:44,850 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 128 transitions. [2024-10-31 22:13:44,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-31 22:13:44,852 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:13:44,852 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:44,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:13:44,853 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:13:44,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:44,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1233643155, now seen corresponding path program 1 times [2024-10-31 22:13:44,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:44,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039360921] [2024-10-31 22:13:44,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:44,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:44,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:45,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:13:45,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:45,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:13:45,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:45,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:13:45,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:45,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:13:45,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:45,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:13:45,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:45,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:13:45,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:45,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:13:45,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:45,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:13:45,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:45,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:13:45,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:45,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:13:45,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:45,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:13:45,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:45,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 22:13:45,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:45,225 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 22:13:45,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:13:45,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039360921] [2024-10-31 22:13:45,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039360921] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:13:45,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:13:45,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:13:45,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913893376] [2024-10-31 22:13:45,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:13:45,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:13:45,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:13:45,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:13:45,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:13:45,232 INFO L87 Difference]: Start difference. First operand 91 states and 128 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:13:45,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:13:45,286 INFO L93 Difference]: Finished difference Result 182 states and 257 transitions. [2024-10-31 22:13:45,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:13:45,290 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2024-10-31 22:13:45,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:13:45,292 INFO L225 Difference]: With dead ends: 182 [2024-10-31 22:13:45,292 INFO L226 Difference]: Without dead ends: 94 [2024-10-31 22:13:45,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 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-10-31 22:13:45,298 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 1 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 359 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-10-31 22:13:45,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 359 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:13:45,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-31 22:13:45,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2024-10-31 22:13:45,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 79 states have (on average 1.3417721518987342) internal successors, (106), 79 states have internal predecessors, (106), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-31 22:13:45,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 130 transitions. [2024-10-31 22:13:45,320 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 130 transitions. Word has length 104 [2024-10-31 22:13:45,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:13:45,320 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 130 transitions. [2024-10-31 22:13:45,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:13:45,321 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 130 transitions. [2024-10-31 22:13:45,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-31 22:13:45,323 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:13:45,323 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:45,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:13:45,324 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:13:45,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:45,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1286316779, now seen corresponding path program 1 times [2024-10-31 22:13:45,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:45,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965894893] [2024-10-31 22:13:45,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:45,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:45,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:45,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:13:45,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:45,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:13:45,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:45,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:13:45,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:45,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:13:45,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:45,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:13:45,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:45,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:13:45,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:45,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:13:45,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:45,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:13:45,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:45,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:13:45,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:45,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:13:45,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:45,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:13:45,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:45,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 22:13:45,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:45,691 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 22:13:45,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:13:45,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965894893] [2024-10-31 22:13:45,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965894893] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:13:45,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:13:45,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:13:45,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177792829] [2024-10-31 22:13:45,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:13:45,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:13:45,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:13:45,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:13:45,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:13:45,698 INFO L87 Difference]: Start difference. First operand 93 states and 130 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:13:45,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:13:45,743 INFO L93 Difference]: Finished difference Result 186 states and 261 transitions. [2024-10-31 22:13:45,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:13:45,747 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2024-10-31 22:13:45,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:13:45,749 INFO L225 Difference]: With dead ends: 186 [2024-10-31 22:13:45,749 INFO L226 Difference]: Without dead ends: 96 [2024-10-31 22:13:45,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 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-10-31 22:13:45,755 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 1 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 361 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-10-31 22:13:45,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 361 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:13:45,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-31 22:13:45,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2024-10-31 22:13:45,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 81 states have (on average 1.3333333333333333) internal successors, (108), 81 states have internal predecessors, (108), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-31 22:13:45,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 132 transitions. [2024-10-31 22:13:45,772 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 132 transitions. Word has length 104 [2024-10-31 22:13:45,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:13:45,773 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 132 transitions. [2024-10-31 22:13:45,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:13:45,773 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 132 transitions. [2024-10-31 22:13:45,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-31 22:13:45,778 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:13:45,779 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:45,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:13:45,779 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:13:45,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:45,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1284469737, now seen corresponding path program 1 times [2024-10-31 22:13:45,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:45,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134446233] [2024-10-31 22:13:45,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:45,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:46,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:51,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:13:51,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:51,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:13:51,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:51,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:13:51,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:51,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:13:51,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:51,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:13:51,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:51,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:13:51,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:51,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:13:51,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:51,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:13:51,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:51,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:13:51,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:51,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:13:51,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:51,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:13:51,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:51,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 22:13:51,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:51,203 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 22:13:51,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:13:51,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134446233] [2024-10-31 22:13:51,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134446233] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:13:51,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:13:51,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-31 22:13:51,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257456911] [2024-10-31 22:13:51,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:13:51,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-31 22:13:51,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:13:51,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-31 22:13:51,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-31 22:13:51,207 INFO L87 Difference]: Start difference. First operand 95 states and 132 transitions. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-31 22:13:53,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:13:53,404 INFO L93 Difference]: Finished difference Result 300 states and 418 transitions. [2024-10-31 22:13:53,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-31 22:13:53,404 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 104 [2024-10-31 22:13:53,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:13:53,406 INFO L225 Difference]: With dead ends: 300 [2024-10-31 22:13:53,407 INFO L226 Difference]: Without dead ends: 208 [2024-10-31 22:13:53,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2024-10-31 22:13:53,409 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 471 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-31 22:13:53,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 820 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-31 22:13:53,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-10-31 22:13:53,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 113. [2024-10-31 22:13:53,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 99 states have (on average 1.3636363636363635) internal successors, (135), 99 states have internal predecessors, (135), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-31 22:13:53,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 159 transitions. [2024-10-31 22:13:53,425 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 159 transitions. Word has length 104 [2024-10-31 22:13:53,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:13:53,425 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 159 transitions. [2024-10-31 22:13:53,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-31 22:13:53,426 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 159 transitions. [2024-10-31 22:13:53,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-31 22:13:53,428 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:13:53,428 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:53,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:13:53,429 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:13:53,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:53,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1205059225, now seen corresponding path program 1 times [2024-10-31 22:13:53,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:53,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440707923] [2024-10-31 22:13:53,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:53,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:53,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:53,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:13:53,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:53,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:13:53,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:53,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:13:53,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:53,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:13:53,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:53,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:13:53,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:53,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:13:53,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:53,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:13:53,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:53,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:13:53,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:53,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:13:53,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:53,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:13:53,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:53,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:13:53,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:53,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 22:13:53,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:53,559 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 22:13:53,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:13:53,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440707923] [2024-10-31 22:13:53,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440707923] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:13:53,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:13:53,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:13:53,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406299341] [2024-10-31 22:13:53,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:13:53,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:13:53,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:13:53,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:13:53,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:13:53,563 INFO L87 Difference]: Start difference. First operand 113 states and 159 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:13:53,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:13:53,593 INFO L93 Difference]: Finished difference Result 261 states and 364 transitions. [2024-10-31 22:13:53,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:13:53,594 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2024-10-31 22:13:53,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:13:53,595 INFO L225 Difference]: With dead ends: 261 [2024-10-31 22:13:53,595 INFO L226 Difference]: Without dead ends: 151 [2024-10-31 22:13:53,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:13:53,597 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 61 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:13:53,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 313 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:13:53,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-10-31 22:13:53,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 111. [2024-10-31 22:13:53,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 97 states have (on average 1.3505154639175259) internal successors, (131), 97 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-31 22:13:53,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 155 transitions. [2024-10-31 22:13:53,620 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 155 transitions. Word has length 104 [2024-10-31 22:13:53,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:13:53,621 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 155 transitions. [2024-10-31 22:13:53,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:13:53,621 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 155 transitions. [2024-10-31 22:13:53,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-31 22:13:53,626 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:13:53,626 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:53,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:13:53,627 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:13:53,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:53,627 INFO L85 PathProgramCache]: Analyzing trace with hash 102314982, now seen corresponding path program 1 times [2024-10-31 22:13:53,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:53,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653787356] [2024-10-31 22:13:53,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:53,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:53,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:54,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:13:54,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:54,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:13:54,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:54,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:13:54,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:54,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:13:54,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:54,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:13:54,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:54,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:13:54,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:54,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:13:54,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:54,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:13:54,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:54,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:13:54,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:54,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:13:54,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:54,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:13:54,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:54,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 22:13:54,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:54,189 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 22:13:54,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:13:54,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653787356] [2024-10-31 22:13:54,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653787356] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:13:54,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:13:54,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 22:13:54,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952970237] [2024-10-31 22:13:54,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:13:54,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:13:54,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:13:54,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:13:54,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:13:54,195 INFO L87 Difference]: Start difference. First operand 111 states and 155 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:13:54,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:13:54,405 INFO L93 Difference]: Finished difference Result 295 states and 410 transitions. [2024-10-31 22:13:54,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:13:54,405 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2024-10-31 22:13:54,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:13:54,408 INFO L225 Difference]: With dead ends: 295 [2024-10-31 22:13:54,409 INFO L226 Difference]: Without dead ends: 187 [2024-10-31 22:13:54,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 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-10-31 22:13:54,411 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 71 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:13:54,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 619 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:13:54,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-10-31 22:13:54,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 184. [2024-10-31 22:13:54,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 165 states have (on average 1.3515151515151516) internal successors, (223), 166 states have internal predecessors, (223), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-31 22:13:54,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 255 transitions. [2024-10-31 22:13:54,440 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 255 transitions. Word has length 108 [2024-10-31 22:13:54,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:13:54,441 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 255 transitions. [2024-10-31 22:13:54,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:13:54,441 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 255 transitions. [2024-10-31 22:13:54,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-31 22:13:54,445 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:13:54,445 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:54,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:13:54,446 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:13:54,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:54,446 INFO L85 PathProgramCache]: Analyzing trace with hash -738292373, now seen corresponding path program 1 times [2024-10-31 22:13:54,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:54,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620269538] [2024-10-31 22:13:54,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:54,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:54,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:54,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:13:54,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:54,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:13:54,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:54,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:13:54,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:54,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:13:54,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:54,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:13:54,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:54,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:13:54,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:54,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:13:54,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:54,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:13:54,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:54,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:13:54,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:54,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:13:54,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:54,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:13:54,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:54,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 22:13:54,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:54,912 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 22:13:54,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:13:54,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620269538] [2024-10-31 22:13:54,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620269538] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:13:54,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:13:54,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 22:13:54,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385318062] [2024-10-31 22:13:54,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:13:54,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 22:13:54,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:13:54,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 22:13:54,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:13:54,916 INFO L87 Difference]: Start difference. First operand 184 states and 255 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:13:55,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:13:55,213 INFO L93 Difference]: Finished difference Result 434 states and 604 transitions. [2024-10-31 22:13:55,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 22:13:55,214 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2024-10-31 22:13:55,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:13:55,217 INFO L225 Difference]: With dead ends: 434 [2024-10-31 22:13:55,217 INFO L226 Difference]: Without dead ends: 253 [2024-10-31 22:13:55,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-31 22:13:55,219 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 64 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 1011 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:13:55,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 1011 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:13:55,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-10-31 22:13:55,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 215. [2024-10-31 22:13:55,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 196 states have (on average 1.3775510204081634) internal successors, (270), 197 states have internal predecessors, (270), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-31 22:13:55,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 302 transitions. [2024-10-31 22:13:55,244 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 302 transitions. Word has length 110 [2024-10-31 22:13:55,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:13:55,244 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 302 transitions. [2024-10-31 22:13:55,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:13:55,245 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 302 transitions. [2024-10-31 22:13:55,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-31 22:13:55,246 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:13:55,246 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:55,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 22:13:55,247 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:13:55,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:55,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1287339029, now seen corresponding path program 1 times [2024-10-31 22:13:55,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:55,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591832460] [2024-10-31 22:13:55,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:55,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:55,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:55,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:13:55,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:55,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:13:55,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:55,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:13:55,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:55,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:13:55,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:55,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:13:55,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:55,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:13:55,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:55,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:13:55,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:55,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:13:55,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:55,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:13:55,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:55,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:13:55,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:55,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:13:55,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:55,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 22:13:55,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:55,696 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 22:13:55,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:13:55,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591832460] [2024-10-31 22:13:55,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591832460] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:13:55,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:13:55,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 22:13:55,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958171418] [2024-10-31 22:13:55,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:13:55,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 22:13:55,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:13:55,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 22:13:55,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:13:55,701 INFO L87 Difference]: Start difference. First operand 215 states and 302 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:13:55,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:13:55,964 INFO L93 Difference]: Finished difference Result 484 states and 679 transitions. [2024-10-31 22:13:55,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 22:13:55,964 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2024-10-31 22:13:55,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:13:55,966 INFO L225 Difference]: With dead ends: 484 [2024-10-31 22:13:55,966 INFO L226 Difference]: Without dead ends: 272 [2024-10-31 22:13:55,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-31 22:13:55,968 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 54 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:13:55,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 777 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:13:55,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-10-31 22:13:55,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 241. [2024-10-31 22:13:55,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 222 states have (on average 1.3873873873873874) internal successors, (308), 223 states have internal predecessors, (308), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-31 22:13:55,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 340 transitions. [2024-10-31 22:13:55,989 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 340 transitions. Word has length 110 [2024-10-31 22:13:55,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:13:55,990 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 340 transitions. [2024-10-31 22:13:55,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:13:55,990 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 340 transitions. [2024-10-31 22:13:55,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-31 22:13:55,992 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:13:55,992 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:55,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 22:13:55,993 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:13:55,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:55,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1972765401, now seen corresponding path program 1 times [2024-10-31 22:13:55,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:55,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071294040] [2024-10-31 22:13:55,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:55,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:56,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:56,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:13:56,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:56,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:13:56,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:56,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:13:56,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:56,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:13:56,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:56,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:13:56,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:56,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:13:56,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:56,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:13:56,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:56,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:13:56,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:56,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:13:56,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:56,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:13:56,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:56,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:13:56,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:56,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 22:13:56,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:56,243 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 22:13:56,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:13:56,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071294040] [2024-10-31 22:13:56,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071294040] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:13:56,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:13:56,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:13:56,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632716362] [2024-10-31 22:13:56,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:13:56,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:13:56,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:13:56,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:13:56,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:13:56,247 INFO L87 Difference]: Start difference. First operand 241 states and 340 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:13:56,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:13:56,394 INFO L93 Difference]: Finished difference Result 562 states and 782 transitions. [2024-10-31 22:13:56,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:13:56,397 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2024-10-31 22:13:56,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:13:56,399 INFO L225 Difference]: With dead ends: 562 [2024-10-31 22:13:56,399 INFO L226 Difference]: Without dead ends: 324 [2024-10-31 22:13:56,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:13:56,403 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 68 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:13:56,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 610 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:13:56,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-10-31 22:13:56,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 320. [2024-10-31 22:13:56,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 295 states have (on average 1.3559322033898304) internal successors, (400), 298 states have internal predecessors, (400), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 17 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-31 22:13:56,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 440 transitions. [2024-10-31 22:13:56,428 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 440 transitions. Word has length 111 [2024-10-31 22:13:56,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:13:56,429 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 440 transitions. [2024-10-31 22:13:56,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:13:56,429 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 440 transitions. [2024-10-31 22:13:56,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-31 22:13:56,432 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:13:56,432 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:56,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 22:13:56,432 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:13:56,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:56,433 INFO L85 PathProgramCache]: Analyzing trace with hash 278360998, now seen corresponding path program 1 times [2024-10-31 22:13:56,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:56,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504877279] [2024-10-31 22:13:56,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:56,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:56,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:56,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:13:56,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:56,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:13:56,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:56,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:13:56,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:56,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:13:56,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:56,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:13:56,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:56,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:13:56,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:56,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:13:56,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:56,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:13:56,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:56,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:13:56,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:56,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:13:56,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:56,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:13:56,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:56,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 22:13:56,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:56,705 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 22:13:56,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:13:56,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504877279] [2024-10-31 22:13:56,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504877279] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:13:56,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:13:56,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:13:56,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105145021] [2024-10-31 22:13:56,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:13:56,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:13:56,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:13:56,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:13:56,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:13:56,708 INFO L87 Difference]: Start difference. First operand 320 states and 440 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:13:56,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:13:56,840 INFO L93 Difference]: Finished difference Result 645 states and 881 transitions. [2024-10-31 22:13:56,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:13:56,841 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2024-10-31 22:13:56,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:13:56,843 INFO L225 Difference]: With dead ends: 645 [2024-10-31 22:13:56,843 INFO L226 Difference]: Without dead ends: 328 [2024-10-31 22:13:56,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:13:56,845 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 65 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:13:56,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 522 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:13:56,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2024-10-31 22:13:56,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 248. [2024-10-31 22:13:56,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 227 states have (on average 1.3612334801762114) internal successors, (309), 228 states have internal predecessors, (309), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-31 22:13:56,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 341 transitions. [2024-10-31 22:13:56,865 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 341 transitions. Word has length 111 [2024-10-31 22:13:56,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:13:56,866 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 341 transitions. [2024-10-31 22:13:56,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:13:56,866 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 341 transitions. [2024-10-31 22:13:56,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-31 22:13:56,868 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:13:56,868 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:56,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-31 22:13:56,868 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:13:56,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:56,869 INFO L85 PathProgramCache]: Analyzing trace with hash 664402794, now seen corresponding path program 1 times [2024-10-31 22:13:56,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:56,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868952722] [2024-10-31 22:13:56,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:56,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:56,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-31 22:13:57,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1169045074] [2024-10-31 22:13:57,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:57,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:13:57,003 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a22e9702-cfde-4469-bc9e-d2be64eb75db/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:13:57,005 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a22e9702-cfde-4469-bc9e-d2be64eb75db/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:13:57,007 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a22e9702-cfde-4469-bc9e-d2be64eb75db/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-31 22:13:57,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:13:57,574 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:13:58,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:13:58,252 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:13:58,252 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 22:13:58,254 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-31 22:13:58,282 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a22e9702-cfde-4469-bc9e-d2be64eb75db/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-31 22:13:58,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a22e9702-cfde-4469-bc9e-d2be64eb75db/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-31 22:13:58,461 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:58,675 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-31 22:13:58,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.10 10:13:58 BoogieIcfgContainer [2024-10-31 22:13:58,680 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-31 22:13:58,681 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-31 22:13:58,681 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-31 22:13:58,682 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-31 22:13:58,682 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:13:43" (3/4) ... [2024-10-31 22:13:58,686 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-10-31 22:13:58,687 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-31 22:13:58,688 INFO L158 Benchmark]: Toolchain (without parser) took 17256.68ms. Allocated memory was 138.4MB in the beginning and 333.4MB in the end (delta: 195.0MB). Free memory was 105.8MB in the beginning and 149.6MB in the end (delta: -43.8MB). Peak memory consumption was 152.8MB. Max. memory is 16.1GB. [2024-10-31 22:13:58,688 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 138.4MB. Free memory is still 109.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:13:58,689 INFO L158 Benchmark]: CACSL2BoogieTranslator took 472.97ms. Allocated memory is still 138.4MB. Free memory was 105.3MB in the beginning and 90.0MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-31 22:13:58,689 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.98ms. Allocated memory is still 138.4MB. Free memory was 90.0MB in the beginning and 86.6MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-31 22:13:58,689 INFO L158 Benchmark]: Boogie Preprocessor took 134.77ms. Allocated memory is still 138.4MB. Free memory was 86.6MB in the beginning and 81.2MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-31 22:13:58,690 INFO L158 Benchmark]: RCFGBuilder took 1106.60ms. Allocated memory was 138.4MB in the beginning and 190.8MB in the end (delta: 52.4MB). Free memory was 81.2MB in the beginning and 153.4MB in the end (delta: -72.2MB). Peak memory consumption was 44.2MB. Max. memory is 16.1GB. [2024-10-31 22:13:58,691 INFO L158 Benchmark]: TraceAbstraction took 15459.09ms. Allocated memory was 190.8MB in the beginning and 333.4MB in the end (delta: 142.6MB). Free memory was 152.3MB in the beginning and 149.6MB in the end (delta: 2.7MB). Peak memory consumption was 144.2MB. Max. memory is 16.1GB. [2024-10-31 22:13:58,691 INFO L158 Benchmark]: Witness Printer took 6.80ms. Allocated memory is still 333.4MB. Free memory is still 149.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:13:58,693 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.32ms. Allocated memory is still 138.4MB. Free memory is still 109.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 472.97ms. Allocated memory is still 138.4MB. Free memory was 105.3MB in the beginning and 90.0MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.98ms. Allocated memory is still 138.4MB. Free memory was 90.0MB in the beginning and 86.6MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 134.77ms. Allocated memory is still 138.4MB. Free memory was 86.6MB in the beginning and 81.2MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1106.60ms. Allocated memory was 138.4MB in the beginning and 190.8MB in the end (delta: 52.4MB). Free memory was 81.2MB in the beginning and 153.4MB in the end (delta: -72.2MB). Peak memory consumption was 44.2MB. Max. memory is 16.1GB. * TraceAbstraction took 15459.09ms. Allocated memory was 190.8MB in the beginning and 333.4MB in the end (delta: 142.6MB). Free memory was 152.3MB in the beginning and 149.6MB in the end (delta: 2.7MB). Peak memory consumption was 144.2MB. Max. memory is 16.1GB. * Witness Printer took 6.80ms. Allocated memory is still 333.4MB. Free memory is still 149.6MB. 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 98, overapproximation of shiftRight at line 106. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 2; [L22] signed short int var_1_1 = 2; [L23] signed short int* var_1_1_Pointer = &(var_1_1); [L24] signed short int var_1_4 = -64; [L24] signed short int var_1_4 = -64; [L25] signed short int* var_1_4_Pointer = &(var_1_4); [L26] signed short int var_1_5 = 256; [L26] signed short int var_1_5 = 256; [L27] signed short int* var_1_5_Pointer = &(var_1_5); [L28] unsigned short int var_1_6 = 128; [L28] unsigned short int var_1_6 = 128; [L29] unsigned short int* var_1_6_Pointer = &(var_1_6); [L30] unsigned short int var_1_7 = 256; [L30] unsigned short int var_1_7 = 256; [L31] unsigned short int* var_1_7_Pointer = &(var_1_7); [L32] signed long int var_1_8 = 50; [L32] signed long int var_1_8 = 50; [L33] signed long int* var_1_8_Pointer = &(var_1_8); [L34] unsigned char var_1_9 = 0; [L34] unsigned char var_1_9 = 0; [L35] unsigned char* var_1_9_Pointer = &(var_1_9); [L36] signed long int var_1_10 = -4; [L36] signed long int var_1_10 = -4; [L37] signed long int* var_1_10_Pointer = &(var_1_10); [L38] float var_1_11 = 15.125; [L38] float var_1_11 = 15.125; [L39] float* var_1_11_Pointer = &(var_1_11); [L40] float var_1_12 = 0.9; [L40] float var_1_12 = 0.9; [L41] float* var_1_12_Pointer = &(var_1_12); [L42] double var_1_13 = 25.875; [L42] double var_1_13 = 25.875; [L43] double* var_1_13_Pointer = &(var_1_13); [L44] unsigned short int var_1_14 = 50; [L44] unsigned short int var_1_14 = 50; [L45] unsigned short int* var_1_14_Pointer = &(var_1_14); [L46] signed short int last_1_var_1_1 = 2; [L47] unsigned short int last_1_var_1_6 = 128; [L48] signed long int last_1_var_1_8 = 50; VAL [isInitial=0, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L110] isInitial = 1 [L111] FCALL initially() [L112] COND TRUE 1 [L113] CALL updateLastVariables() [L101] EXPR \read(var_1_1) [L101] last_1_var_1_1 = var_1_1 [L102] EXPR \read(var_1_6) [L102] last_1_var_1_6 = var_1_6 [L103] EXPR \read(var_1_8) [L103] last_1_var_1_8 = var_1_8 [L113] RET updateLastVariables() [L114] CALL updateVariables() [L81] var_1_4 = __VERIFIER_nondet_short() [L82] EXPR \read(var_1_4) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L82] CALL assume_abort_if_not(var_1_4 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L82] RET assume_abort_if_not(var_1_4 >= -16383) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L83] EXPR \read(var_1_4) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L83] CALL assume_abort_if_not(var_1_4 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L83] RET assume_abort_if_not(var_1_4 <= 16383) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L84] var_1_5 = __VERIFIER_nondet_short() [L85] EXPR \read(var_1_5) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] CALL assume_abort_if_not(var_1_5 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] RET assume_abort_if_not(var_1_5 >= -16383) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L86] EXPR \read(var_1_5) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L86] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L86] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] var_1_7 = __VERIFIER_nondet_ushort() [L88] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L89] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L89] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L89] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] var_1_9 = __VERIFIER_nondet_uchar() [L91] EXPR \read(var_1_9) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L92] EXPR \read(var_1_9) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L92] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L92] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L93] var_1_10 = __VERIFIER_nondet_long() [L94] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] CALL assume_abort_if_not(var_1_10 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] RET assume_abort_if_not(var_1_10 >= -2147483648) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L95] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L95] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L95] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L96] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L96] CALL assume_abort_if_not(var_1_10 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L96] RET assume_abort_if_not(var_1_10 != 0) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] var_1_12 = __VERIFIER_nondet_float() [L98] EXPR \read(var_1_12) [L98] EXPR var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L98] EXPR var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F [L98] EXPR \read(var_1_12) [L98] EXPR var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L98] EXPR (var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L98] EXPR (var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L98] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L98] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L114] RET updateVariables() [L115] CALL step() [L52] COND TRUE ! (last_1_var_1_6 <= last_1_var_1_1) [L53] EXPR \read(*var_1_4_Pointer) [L53] EXPR \read(*var_1_5_Pointer) [L53] (*(var_1_1_Pointer)) = ((*(var_1_4_Pointer)) + (*(var_1_5_Pointer))) [L55] EXPR \read(*var_1_4_Pointer) [L55] signed long int stepLocal_0 = 1 * (*(var_1_4_Pointer)); [L56] EXPR \read(*var_1_1_Pointer) [L56] EXPR \read(*var_1_5_Pointer) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L56] EXPR (*(var_1_1_Pointer)) >> (*(var_1_5_Pointer)) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, stepLocal_0=16383, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L56] COND TRUE ((*(var_1_1_Pointer)) >> (*(var_1_5_Pointer))) > stepLocal_0 [L57] EXPR \read(*var_1_7_Pointer) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L57] EXPR (((42286 - (*(var_1_7_Pointer)))) > (0)) ? ((42286 - (*(var_1_7_Pointer)))) : (0) [L57] EXPR \read(*var_1_7_Pointer) [L57] EXPR (((42286 - (*(var_1_7_Pointer)))) > (0)) ? ((42286 - (*(var_1_7_Pointer)))) : (0) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L57] (*(var_1_6_Pointer)) = (((((42286 - (*(var_1_7_Pointer)))) > (0)) ? ((42286 - (*(var_1_7_Pointer)))) : (0))) [L61] EXPR \read(*var_1_12_Pointer) [L61] (*(var_1_11_Pointer)) = (*(var_1_12_Pointer)) [L62] EXPR \read(*var_1_12_Pointer) [L62] (*(var_1_13_Pointer)) = (*(var_1_12_Pointer)) [L63] EXPR \read(*var_1_7_Pointer) [L63] (*(var_1_14_Pointer)) = (*(var_1_7_Pointer)) [L64] EXPR \read(*var_1_4_Pointer) [L64] EXPR \read(*var_1_10_Pointer) [L64] signed long int stepLocal_2 = (*(var_1_4_Pointer)) / (*(var_1_10_Pointer)); [L65] EXPR \read(*var_1_7_Pointer) [L65] unsigned short int stepLocal_1 = (*(var_1_7_Pointer)); [L66] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L66] COND FALSE !((*(var_1_9_Pointer))) [L69] EXPR \read(*var_1_14_Pointer) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L69] COND FALSE !((*(var_1_14_Pointer)) > stepLocal_2) [L76] EXPR \read(*var_1_6_Pointer) [L76] EXPR \read(*var_1_5_Pointer) [L76] (*(var_1_8_Pointer)) = ((*(var_1_6_Pointer)) + (*(var_1_5_Pointer))) [L115] RET step() [L116] CALL, EXPR property() [L106] EXPR (! (last_1_var_1_6 <= last_1_var_1_1)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_4_Pointer)) + (*(var_1_5_Pointer))))) : 1 [L106] EXPR \read(*var_1_1_Pointer) [L106] EXPR \read(*var_1_4_Pointer) [L106] EXPR \read(*var_1_5_Pointer) [L106] EXPR (! (last_1_var_1_6 <= last_1_var_1_1)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_4_Pointer)) + (*(var_1_5_Pointer))))) : 1 VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR ((! (last_1_var_1_6 <= last_1_var_1_1)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_4_Pointer)) + (*(var_1_5_Pointer))))) : 1) && ((((*(var_1_1_Pointer)) >> (*(var_1_5_Pointer))) > (1 * (*(var_1_4_Pointer)))) ? ((*(var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(var_1_7_Pointer)))) > (0)) ? ((42286 - (*(var_1_7_Pointer)))) : (0))))) : ((*(var_1_6_Pointer)) == ((unsigned short int) (*(var_1_7_Pointer))))) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR ((! (last_1_var_1_6 <= last_1_var_1_1)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_4_Pointer)) + (*(var_1_5_Pointer))))) : 1) && ((((*(var_1_1_Pointer)) >> (*(var_1_5_Pointer))) > (1 * (*(var_1_4_Pointer)))) ? ((*(var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(var_1_7_Pointer)))) > (0)) ? ((42286 - (*(var_1_7_Pointer)))) : (0))))) : ((*(var_1_6_Pointer)) == ((unsigned short int) (*(var_1_7_Pointer))))) [L106] EXPR \read(*var_1_1_Pointer) [L106] EXPR \read(*var_1_5_Pointer) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR (*(var_1_1_Pointer)) >> (*(var_1_5_Pointer)) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR \read(*var_1_4_Pointer) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR (((*(var_1_1_Pointer)) >> (*(var_1_5_Pointer))) > (1 * (*(var_1_4_Pointer)))) ? ((*(var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(var_1_7_Pointer)))) > (0)) ? ((42286 - (*(var_1_7_Pointer)))) : (0))))) : ((*(var_1_6_Pointer)) == ((unsigned short int) (*(var_1_7_Pointer)))) [L106] EXPR \read(*var_1_6_Pointer) [L106] EXPR \read(*var_1_7_Pointer) [L106] EXPR (((*(var_1_1_Pointer)) >> (*(var_1_5_Pointer))) > (1 * (*(var_1_4_Pointer)))) ? ((*(var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(var_1_7_Pointer)))) > (0)) ? ((42286 - (*(var_1_7_Pointer)))) : (0))))) : ((*(var_1_6_Pointer)) == ((unsigned short int) (*(var_1_7_Pointer)))) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR ((! (last_1_var_1_6 <= last_1_var_1_1)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_4_Pointer)) + (*(var_1_5_Pointer))))) : 1) && ((((*(var_1_1_Pointer)) >> (*(var_1_5_Pointer))) > (1 * (*(var_1_4_Pointer)))) ? ((*(var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(var_1_7_Pointer)))) > (0)) ? ((42286 - (*(var_1_7_Pointer)))) : (0))))) : ((*(var_1_6_Pointer)) == ((unsigned short int) (*(var_1_7_Pointer))))) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR (((! (last_1_var_1_6 <= last_1_var_1_1)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_4_Pointer)) + (*(var_1_5_Pointer))))) : 1) && ((((*(var_1_1_Pointer)) >> (*(var_1_5_Pointer))) > (1 * (*(var_1_4_Pointer)))) ? ((*(var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(var_1_7_Pointer)))) > (0)) ? ((42286 - (*(var_1_7_Pointer)))) : (0))))) : ((*(var_1_6_Pointer)) == ((unsigned short int) (*(var_1_7_Pointer)))))) && ((*(var_1_9_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed long int) (((((*(var_1_6_Pointer))) < (last_1_var_1_8)) ? ((*(var_1_6_Pointer))) : (last_1_var_1_8))))) : (((*(var_1_14_Pointer)) > ((*(var_1_4_Pointer)) / (*(var_1_10_Pointer)))) ? (((*(var_1_7_Pointer)) > (*(var_1_6_Pointer))) ? ((*(var_1_8_Pointer)) == ((signed long int) (((((*(var_1_4_Pointer))) < (100)) ? ((*(var_1_4_Pointer))) : (100))))) : ((*(var_1_8_Pointer)) == ((signed long int) (last_1_var_1_8 - (*(var_1_7_Pointer)))))) : ((*(var_1_8_Pointer)) == ((signed long int) ((*(var_1_6_Pointer)) + (*(var_1_5_Pointer))))))) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR (((! (last_1_var_1_6 <= last_1_var_1_1)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_4_Pointer)) + (*(var_1_5_Pointer))))) : 1) && ((((*(var_1_1_Pointer)) >> (*(var_1_5_Pointer))) > (1 * (*(var_1_4_Pointer)))) ? ((*(var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(var_1_7_Pointer)))) > (0)) ? ((42286 - (*(var_1_7_Pointer)))) : (0))))) : ((*(var_1_6_Pointer)) == ((unsigned short int) (*(var_1_7_Pointer)))))) && ((*(var_1_9_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed long int) (((((*(var_1_6_Pointer))) < (last_1_var_1_8)) ? ((*(var_1_6_Pointer))) : (last_1_var_1_8))))) : (((*(var_1_14_Pointer)) > ((*(var_1_4_Pointer)) / (*(var_1_10_Pointer)))) ? (((*(var_1_7_Pointer)) > (*(var_1_6_Pointer))) ? ((*(var_1_8_Pointer)) == ((signed long int) (((((*(var_1_4_Pointer))) < (100)) ? ((*(var_1_4_Pointer))) : (100))))) : ((*(var_1_8_Pointer)) == ((signed long int) (last_1_var_1_8 - (*(var_1_7_Pointer)))))) : ((*(var_1_8_Pointer)) == ((signed long int) ((*(var_1_6_Pointer)) + (*(var_1_5_Pointer))))))) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR ((((! (last_1_var_1_6 <= last_1_var_1_1)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_4_Pointer)) + (*(var_1_5_Pointer))))) : 1) && ((((*(var_1_1_Pointer)) >> (*(var_1_5_Pointer))) > (1 * (*(var_1_4_Pointer)))) ? ((*(var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(var_1_7_Pointer)))) > (0)) ? ((42286 - (*(var_1_7_Pointer)))) : (0))))) : ((*(var_1_6_Pointer)) == ((unsigned short int) (*(var_1_7_Pointer)))))) && ((*(var_1_9_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed long int) (((((*(var_1_6_Pointer))) < (last_1_var_1_8)) ? ((*(var_1_6_Pointer))) : (last_1_var_1_8))))) : (((*(var_1_14_Pointer)) > ((*(var_1_4_Pointer)) / (*(var_1_10_Pointer)))) ? (((*(var_1_7_Pointer)) > (*(var_1_6_Pointer))) ? ((*(var_1_8_Pointer)) == ((signed long int) (((((*(var_1_4_Pointer))) < (100)) ? ((*(var_1_4_Pointer))) : (100))))) : ((*(var_1_8_Pointer)) == ((signed long int) (last_1_var_1_8 - (*(var_1_7_Pointer)))))) : ((*(var_1_8_Pointer)) == ((signed long int) ((*(var_1_6_Pointer)) + (*(var_1_5_Pointer)))))))) && ((*(var_1_11_Pointer)) == ((float) (*(var_1_12_Pointer)))) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR ((((! (last_1_var_1_6 <= last_1_var_1_1)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_4_Pointer)) + (*(var_1_5_Pointer))))) : 1) && ((((*(var_1_1_Pointer)) >> (*(var_1_5_Pointer))) > (1 * (*(var_1_4_Pointer)))) ? ((*(var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(var_1_7_Pointer)))) > (0)) ? ((42286 - (*(var_1_7_Pointer)))) : (0))))) : ((*(var_1_6_Pointer)) == ((unsigned short int) (*(var_1_7_Pointer)))))) && ((*(var_1_9_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed long int) (((((*(var_1_6_Pointer))) < (last_1_var_1_8)) ? ((*(var_1_6_Pointer))) : (last_1_var_1_8))))) : (((*(var_1_14_Pointer)) > ((*(var_1_4_Pointer)) / (*(var_1_10_Pointer)))) ? (((*(var_1_7_Pointer)) > (*(var_1_6_Pointer))) ? ((*(var_1_8_Pointer)) == ((signed long int) (((((*(var_1_4_Pointer))) < (100)) ? ((*(var_1_4_Pointer))) : (100))))) : ((*(var_1_8_Pointer)) == ((signed long int) (last_1_var_1_8 - (*(var_1_7_Pointer)))))) : ((*(var_1_8_Pointer)) == ((signed long int) ((*(var_1_6_Pointer)) + (*(var_1_5_Pointer)))))))) && ((*(var_1_11_Pointer)) == ((float) (*(var_1_12_Pointer)))) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR (((((! (last_1_var_1_6 <= last_1_var_1_1)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_4_Pointer)) + (*(var_1_5_Pointer))))) : 1) && ((((*(var_1_1_Pointer)) >> (*(var_1_5_Pointer))) > (1 * (*(var_1_4_Pointer)))) ? ((*(var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(var_1_7_Pointer)))) > (0)) ? ((42286 - (*(var_1_7_Pointer)))) : (0))))) : ((*(var_1_6_Pointer)) == ((unsigned short int) (*(var_1_7_Pointer)))))) && ((*(var_1_9_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed long int) (((((*(var_1_6_Pointer))) < (last_1_var_1_8)) ? ((*(var_1_6_Pointer))) : (last_1_var_1_8))))) : (((*(var_1_14_Pointer)) > ((*(var_1_4_Pointer)) / (*(var_1_10_Pointer)))) ? (((*(var_1_7_Pointer)) > (*(var_1_6_Pointer))) ? ((*(var_1_8_Pointer)) == ((signed long int) (((((*(var_1_4_Pointer))) < (100)) ? ((*(var_1_4_Pointer))) : (100))))) : ((*(var_1_8_Pointer)) == ((signed long int) (last_1_var_1_8 - (*(var_1_7_Pointer)))))) : ((*(var_1_8_Pointer)) == ((signed long int) ((*(var_1_6_Pointer)) + (*(var_1_5_Pointer)))))))) && ((*(var_1_11_Pointer)) == ((float) (*(var_1_12_Pointer))))) && ((*(var_1_13_Pointer)) == ((double) (*(var_1_12_Pointer)))) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR (((((! (last_1_var_1_6 <= last_1_var_1_1)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_4_Pointer)) + (*(var_1_5_Pointer))))) : 1) && ((((*(var_1_1_Pointer)) >> (*(var_1_5_Pointer))) > (1 * (*(var_1_4_Pointer)))) ? ((*(var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(var_1_7_Pointer)))) > (0)) ? ((42286 - (*(var_1_7_Pointer)))) : (0))))) : ((*(var_1_6_Pointer)) == ((unsigned short int) (*(var_1_7_Pointer)))))) && ((*(var_1_9_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed long int) (((((*(var_1_6_Pointer))) < (last_1_var_1_8)) ? ((*(var_1_6_Pointer))) : (last_1_var_1_8))))) : (((*(var_1_14_Pointer)) > ((*(var_1_4_Pointer)) / (*(var_1_10_Pointer)))) ? (((*(var_1_7_Pointer)) > (*(var_1_6_Pointer))) ? ((*(var_1_8_Pointer)) == ((signed long int) (((((*(var_1_4_Pointer))) < (100)) ? ((*(var_1_4_Pointer))) : (100))))) : ((*(var_1_8_Pointer)) == ((signed long int) (last_1_var_1_8 - (*(var_1_7_Pointer)))))) : ((*(var_1_8_Pointer)) == ((signed long int) ((*(var_1_6_Pointer)) + (*(var_1_5_Pointer)))))))) && ((*(var_1_11_Pointer)) == ((float) (*(var_1_12_Pointer))))) && ((*(var_1_13_Pointer)) == ((double) (*(var_1_12_Pointer)))) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR ((((((! (last_1_var_1_6 <= last_1_var_1_1)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_4_Pointer)) + (*(var_1_5_Pointer))))) : 1) && ((((*(var_1_1_Pointer)) >> (*(var_1_5_Pointer))) > (1 * (*(var_1_4_Pointer)))) ? ((*(var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(var_1_7_Pointer)))) > (0)) ? ((42286 - (*(var_1_7_Pointer)))) : (0))))) : ((*(var_1_6_Pointer)) == ((unsigned short int) (*(var_1_7_Pointer)))))) && ((*(var_1_9_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed long int) (((((*(var_1_6_Pointer))) < (last_1_var_1_8)) ? ((*(var_1_6_Pointer))) : (last_1_var_1_8))))) : (((*(var_1_14_Pointer)) > ((*(var_1_4_Pointer)) / (*(var_1_10_Pointer)))) ? (((*(var_1_7_Pointer)) > (*(var_1_6_Pointer))) ? ((*(var_1_8_Pointer)) == ((signed long int) (((((*(var_1_4_Pointer))) < (100)) ? ((*(var_1_4_Pointer))) : (100))))) : ((*(var_1_8_Pointer)) == ((signed long int) (last_1_var_1_8 - (*(var_1_7_Pointer)))))) : ((*(var_1_8_Pointer)) == ((signed long int) ((*(var_1_6_Pointer)) + (*(var_1_5_Pointer)))))))) && ((*(var_1_11_Pointer)) == ((float) (*(var_1_12_Pointer))))) && ((*(var_1_13_Pointer)) == ((double) (*(var_1_12_Pointer))))) && ((*(var_1_14_Pointer)) == ((unsigned short int) (*(var_1_7_Pointer)))) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR ((((((! (last_1_var_1_6 <= last_1_var_1_1)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_4_Pointer)) + (*(var_1_5_Pointer))))) : 1) && ((((*(var_1_1_Pointer)) >> (*(var_1_5_Pointer))) > (1 * (*(var_1_4_Pointer)))) ? ((*(var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(var_1_7_Pointer)))) > (0)) ? ((42286 - (*(var_1_7_Pointer)))) : (0))))) : ((*(var_1_6_Pointer)) == ((unsigned short int) (*(var_1_7_Pointer)))))) && ((*(var_1_9_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed long int) (((((*(var_1_6_Pointer))) < (last_1_var_1_8)) ? ((*(var_1_6_Pointer))) : (last_1_var_1_8))))) : (((*(var_1_14_Pointer)) > ((*(var_1_4_Pointer)) / (*(var_1_10_Pointer)))) ? (((*(var_1_7_Pointer)) > (*(var_1_6_Pointer))) ? ((*(var_1_8_Pointer)) == ((signed long int) (((((*(var_1_4_Pointer))) < (100)) ? ((*(var_1_4_Pointer))) : (100))))) : ((*(var_1_8_Pointer)) == ((signed long int) (last_1_var_1_8 - (*(var_1_7_Pointer)))))) : ((*(var_1_8_Pointer)) == ((signed long int) ((*(var_1_6_Pointer)) + (*(var_1_5_Pointer)))))))) && ((*(var_1_11_Pointer)) == ((float) (*(var_1_12_Pointer))))) && ((*(var_1_13_Pointer)) == ((double) (*(var_1_12_Pointer))))) && ((*(var_1_14_Pointer)) == ((unsigned short int) (*(var_1_7_Pointer)))) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106-L107] return ((((((! (last_1_var_1_6 <= last_1_var_1_1)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_4_Pointer)) + (*(var_1_5_Pointer))))) : 1) && ((((*(var_1_1_Pointer)) >> (*(var_1_5_Pointer))) > (1 * (*(var_1_4_Pointer)))) ? ((*(var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(var_1_7_Pointer)))) > (0)) ? ((42286 - (*(var_1_7_Pointer)))) : (0))))) : ((*(var_1_6_Pointer)) == ((unsigned short int) (*(var_1_7_Pointer)))))) && ((*(var_1_9_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed long int) (((((*(var_1_6_Pointer))) < (last_1_var_1_8)) ? ((*(var_1_6_Pointer))) : (last_1_var_1_8))))) : (((*(var_1_14_Pointer)) > ((*(var_1_4_Pointer)) / (*(var_1_10_Pointer)))) ? (((*(var_1_7_Pointer)) > (*(var_1_6_Pointer))) ? ((*(var_1_8_Pointer)) == ((signed long int) (((((*(var_1_4_Pointer))) < (100)) ? ((*(var_1_4_Pointer))) : (100))))) : ((*(var_1_8_Pointer)) == ((signed long int) (last_1_var_1_8 - (*(var_1_7_Pointer)))))) : ((*(var_1_8_Pointer)) == ((signed long int) ((*(var_1_6_Pointer)) + (*(var_1_5_Pointer)))))))) && ((*(var_1_11_Pointer)) == ((float) (*(var_1_12_Pointer))))) && ((*(var_1_13_Pointer)) == ((double) (*(var_1_12_Pointer))))) && ((*(var_1_14_Pointer)) == ((unsigned short int) (*(var_1_7_Pointer)))) ; [L116] RET, EXPR property() [L116] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 93 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.1s, OverallIterations: 12, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 857 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 857 mSDsluCounter, 5876 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4310 mSDsCounter, 58 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1019 IncrementalHoareTripleChecker+Invalid, 1077 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 58 mSolverCounterUnsat, 1566 mSDtfsCounter, 1019 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 359 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=320occurred in iteration=10, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 294 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 8.3s InterpolantComputationTime, 1398 NumberOfCodeBlocks, 1398 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1163 ConstructedInterpolants, 0 QuantifiedInterpolants, 3952 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 2904/2904 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-10-31 22:13:58,805 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a22e9702-cfde-4469-bc9e-d2be64eb75db/bin/uautomizer-verify-4GaUIPS5ZU/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: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a22e9702-cfde-4469-bc9e-d2be64eb75db/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a22e9702-cfde-4469-bc9e-d2be64eb75db/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a22e9702-cfde-4469-bc9e-d2be64eb75db/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a22e9702-cfde-4469-bc9e-d2be64eb75db/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-67.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a22e9702-cfde-4469-bc9e-d2be64eb75db/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a22e9702-cfde-4469-bc9e-d2be64eb75db/bin/uautomizer-verify-4GaUIPS5ZU --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 acedb713d8fb6ee88e504476b1a8afa9aad0050a29ab1fa7a298d11252db5c53 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:14:01,741 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:14:01,874 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a22e9702-cfde-4469-bc9e-d2be64eb75db/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-31 22:14:01,881 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:14:01,881 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:14:01,912 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:14:01,913 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:14:01,914 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:14:01,915 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:14:01,916 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:14:01,917 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:14:01,917 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:14:01,918 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:14:01,919 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:14:01,921 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:14:01,922 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:14:01,922 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:14:01,922 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:14:01,923 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:14:01,923 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:14:01,923 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:14:01,929 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:14:01,929 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:14:01,930 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-31 22:14:01,930 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-31 22:14:01,930 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:14:01,931 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-31 22:14:01,931 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:14:01,931 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:14:01,932 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:14:01,932 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:14:01,932 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:14:01,932 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:14:01,933 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:14:01,933 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:14:01,933 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:14:01,933 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:14:01,934 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:14:01,934 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-31 22:14:01,934 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-31 22:14:01,934 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:14:01,935 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:14:01,935 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:14:01,936 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:14:01,936 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-31 22:14:01,936 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a22e9702-cfde-4469-bc9e-d2be64eb75db/bin/uautomizer-verify-4GaUIPS5ZU/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a22e9702-cfde-4469-bc9e-d2be64eb75db/bin/uautomizer-verify-4GaUIPS5ZU 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 -> acedb713d8fb6ee88e504476b1a8afa9aad0050a29ab1fa7a298d11252db5c53 [2024-10-31 22:14:02,390 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:14:02,423 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:14:02,426 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:14:02,427 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:14:02,427 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:14:02,430 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a22e9702-cfde-4469-bc9e-d2be64eb75db/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-67.i Unable to find full path for "g++" [2024-10-31 22:14:04,852 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:14:05,176 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:14:05,178 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a22e9702-cfde-4469-bc9e-d2be64eb75db/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-67.i [2024-10-31 22:14:05,188 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a22e9702-cfde-4469-bc9e-d2be64eb75db/bin/uautomizer-verify-4GaUIPS5ZU/data/8d88bb2a4/0257891c85644fe38c9d3f8cd4d43d3d/FLAG167f4b548 [2024-10-31 22:14:05,206 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a22e9702-cfde-4469-bc9e-d2be64eb75db/bin/uautomizer-verify-4GaUIPS5ZU/data/8d88bb2a4/0257891c85644fe38c9d3f8cd4d43d3d [2024-10-31 22:14:05,208 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:14:05,210 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:14:05,211 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:14:05,212 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:14:05,218 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:14:05,219 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:14:05" (1/1) ... [2024-10-31 22:14:05,220 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f657b88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:14:05, skipping insertion in model container [2024-10-31 22:14:05,221 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:14:05" (1/1) ... [2024-10-31 22:14:05,251 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:14:05,476 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a22e9702-cfde-4469-bc9e-d2be64eb75db/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-67.i[916,929] [2024-10-31 22:14:05,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:14:05,574 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:14:05,593 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a22e9702-cfde-4469-bc9e-d2be64eb75db/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-67.i[916,929] [2024-10-31 22:14:05,679 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:14:05,729 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:14:05,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:14:05 WrapperNode [2024-10-31 22:14:05,730 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:14:05,732 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:14:05,732 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:14:05,732 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:14:05,741 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:14:05" (1/1) ... [2024-10-31 22:14:05,768 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:14:05" (1/1) ... [2024-10-31 22:14:05,844 INFO L138 Inliner]: procedures = 39, calls = 141, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 416 [2024-10-31 22:14:05,845 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:14:05,849 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:14:05,849 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:14:05,850 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:14:05,877 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:14:05" (1/1) ... [2024-10-31 22:14:05,881 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:14:05" (1/1) ... [2024-10-31 22:14:05,892 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:14:05" (1/1) ... [2024-10-31 22:14:05,994 INFO L175 MemorySlicer]: Split 106 memory accesses to 13 slices as follows [2, 6, 14, 10, 14, 16, 10, 6, 7, 3, 10, 3, 5]. 15 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 16 writes are split as follows [0, 1, 1, 1, 2, 1, 4, 1, 1, 1, 1, 1, 1]. [2024-10-31 22:14:05,999 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:14:05" (1/1) ... [2024-10-31 22:14:05,999 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:14:05" (1/1) ... [2024-10-31 22:14:06,052 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:14:05" (1/1) ... [2024-10-31 22:14:06,057 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:14:05" (1/1) ... [2024-10-31 22:14:06,073 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:14:05" (1/1) ... [2024-10-31 22:14:06,080 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:14:05" (1/1) ... [2024-10-31 22:14:06,099 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:14:06,100 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:14:06,104 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:14:06,104 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:14:06,105 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:14:05" (1/1) ... [2024-10-31 22:14:06,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:14:06,127 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a22e9702-cfde-4469-bc9e-d2be64eb75db/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:14:06,145 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a22e9702-cfde-4469-bc9e-d2be64eb75db/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:14:06,150 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a22e9702-cfde-4469-bc9e-d2be64eb75db/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:14:06,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:14:06,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-31 22:14:06,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-31 22:14:06,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-10-31 22:14:06,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-10-31 22:14:06,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-10-31 22:14:06,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-10-31 22:14:06,183 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-10-31 22:14:06,183 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#7 [2024-10-31 22:14:06,183 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#8 [2024-10-31 22:14:06,183 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#9 [2024-10-31 22:14:06,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#10 [2024-10-31 22:14:06,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#11 [2024-10-31 22:14:06,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#12 [2024-10-31 22:14:06,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-31 22:14:06,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-31 22:14:06,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-10-31 22:14:06,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-10-31 22:14:06,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-10-31 22:14:06,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-10-31 22:14:06,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-10-31 22:14:06,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#7 [2024-10-31 22:14:06,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#8 [2024-10-31 22:14:06,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#9 [2024-10-31 22:14:06,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#10 [2024-10-31 22:14:06,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#11 [2024-10-31 22:14:06,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#12 [2024-10-31 22:14:06,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-31 22:14:06,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-31 22:14:06,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-31 22:14:06,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-31 22:14:06,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-31 22:14:06,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-10-31 22:14:06,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-10-31 22:14:06,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-10-31 22:14:06,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-10-31 22:14:06,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-10-31 22:14:06,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-10-31 22:14:06,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2024-10-31 22:14:06,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2024-10-31 22:14:06,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-31 22:14:06,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-31 22:14:06,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-10-31 22:14:06,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-10-31 22:14:06,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-10-31 22:14:06,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-10-31 22:14:06,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-10-31 22:14:06,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2024-10-31 22:14:06,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2024-10-31 22:14:06,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2024-10-31 22:14:06,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2024-10-31 22:14:06,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2024-10-31 22:14:06,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2024-10-31 22:14:06,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-31 22:14:06,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-31 22:14:06,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-31 22:14:06,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-31 22:14:06,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-31 22:14:06,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-10-31 22:14:06,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-10-31 22:14:06,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-10-31 22:14:06,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-10-31 22:14:06,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-10-31 22:14:06,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-10-31 22:14:06,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2024-10-31 22:14:06,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2024-10-31 22:14:06,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-31 22:14:06,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-31 22:14:06,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-10-31 22:14:06,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-10-31 22:14:06,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-10-31 22:14:06,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-10-31 22:14:06,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-10-31 22:14:06,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2024-10-31 22:14:06,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2024-10-31 22:14:06,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2024-10-31 22:14:06,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2024-10-31 22:14:06,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2024-10-31 22:14:06,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2024-10-31 22:14:06,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-31 22:14:06,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-31 22:14:06,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-31 22:14:06,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-10-31 22:14:06,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-10-31 22:14:06,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-10-31 22:14:06,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-10-31 22:14:06,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2024-10-31 22:14:06,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2024-10-31 22:14:06,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2024-10-31 22:14:06,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2024-10-31 22:14:06,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#11 [2024-10-31 22:14:06,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#12 [2024-10-31 22:14:06,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-31 22:14:06,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-31 22:14:06,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-10-31 22:14:06,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-10-31 22:14:06,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-10-31 22:14:06,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-10-31 22:14:06,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-10-31 22:14:06,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#7 [2024-10-31 22:14:06,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#8 [2024-10-31 22:14:06,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#9 [2024-10-31 22:14:06,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#10 [2024-10-31 22:14:06,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#11 [2024-10-31 22:14:06,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#12 [2024-10-31 22:14:06,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-31 22:14:06,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-31 22:14:06,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-31 22:14:06,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-31 22:14:06,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-10-31 22:14:06,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-10-31 22:14:06,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-10-31 22:14:06,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2024-10-31 22:14:06,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2024-10-31 22:14:06,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2024-10-31 22:14:06,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2024-10-31 22:14:06,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2024-10-31 22:14:06,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2024-10-31 22:14:06,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-31 22:14:06,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-31 22:14:06,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-10-31 22:14:06,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-10-31 22:14:06,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-10-31 22:14:06,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-10-31 22:14:06,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-10-31 22:14:06,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2024-10-31 22:14:06,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2024-10-31 22:14:06,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2024-10-31 22:14:06,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2024-10-31 22:14:06,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#11 [2024-10-31 22:14:06,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#12 [2024-10-31 22:14:06,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-31 22:14:06,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-31 22:14:06,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-31 22:14:06,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-10-31 22:14:06,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-10-31 22:14:06,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-10-31 22:14:06,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-10-31 22:14:06,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2024-10-31 22:14:06,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2024-10-31 22:14:06,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2024-10-31 22:14:06,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2024-10-31 22:14:06,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#11 [2024-10-31 22:14:06,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#12 [2024-10-31 22:14:06,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-31 22:14:06,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-31 22:14:06,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-10-31 22:14:06,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-10-31 22:14:06,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-10-31 22:14:06,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-10-31 22:14:06,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-10-31 22:14:06,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2024-10-31 22:14:06,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2024-10-31 22:14:06,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2024-10-31 22:14:06,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2024-10-31 22:14:06,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#11 [2024-10-31 22:14:06,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#12 [2024-10-31 22:14:06,210 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 22:14:06,211 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 22:14:06,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:14:06,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:14:06,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-31 22:14:06,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-31 22:14:06,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-31 22:14:06,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-31 22:14:06,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-31 22:14:06,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-10-31 22:14:06,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-10-31 22:14:06,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-10-31 22:14:06,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-10-31 22:14:06,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-10-31 22:14:06,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-10-31 22:14:06,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2024-10-31 22:14:06,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2024-10-31 22:14:06,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-31 22:14:06,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-31 22:14:06,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-10-31 22:14:06,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-10-31 22:14:06,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-10-31 22:14:06,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-10-31 22:14:06,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-10-31 22:14:06,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2024-10-31 22:14:06,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2024-10-31 22:14:06,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2024-10-31 22:14:06,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2024-10-31 22:14:06,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#11 [2024-10-31 22:14:06,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#12 [2024-10-31 22:14:06,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-31 22:14:06,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-31 22:14:06,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-31 22:14:06,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-31 22:14:06,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-10-31 22:14:06,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-10-31 22:14:06,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-10-31 22:14:06,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2024-10-31 22:14:06,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2024-10-31 22:14:06,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2024-10-31 22:14:06,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2024-10-31 22:14:06,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2024-10-31 22:14:06,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2024-10-31 22:14:06,597 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:14:06,600 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation