./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety/960521-1-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 7e70badd Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743c86b-6773-4c52-8d4f-f13624eec11d/bin/uautomizer-wIGwrQj20G/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743c86b-6773-4c52-8d4f-f13624eec11d/bin/uautomizer-wIGwrQj20G/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743c86b-6773-4c52-8d4f-f13624eec11d/bin/uautomizer-wIGwrQj20G/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743c86b-6773-4c52-8d4f-f13624eec11d/bin/uautomizer-wIGwrQj20G/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/960521-1-3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743c86b-6773-4c52-8d4f-f13624eec11d/bin/uautomizer-wIGwrQj20G/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743c86b-6773-4c52-8d4f-f13624eec11d/bin/uautomizer-wIGwrQj20G --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c10f64ae1701d633846cd3dbd537781b9e2aef0b0b5befdebbc22e76d228933b --- Real Ultimate output --- This is Ultimate 0.2.1-dev-7e70bad [2021-11-23 13:06:54,404 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 13:06:54,407 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 13:06:54,451 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 13:06:54,452 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 13:06:54,456 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 13:06:54,459 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 13:06:54,463 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 13:06:54,466 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 13:06:54,471 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 13:06:54,472 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 13:06:54,474 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 13:06:54,475 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 13:06:54,478 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 13:06:54,480 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 13:06:54,482 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 13:06:54,484 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 13:06:54,485 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 13:06:54,491 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 13:06:54,499 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 13:06:54,502 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 13:06:54,503 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 13:06:54,507 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 13:06:54,508 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 13:06:54,517 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 13:06:54,518 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 13:06:54,518 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 13:06:54,520 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 13:06:54,521 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 13:06:54,522 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 13:06:54,523 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 13:06:54,524 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 13:06:54,526 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 13:06:54,527 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 13:06:54,529 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 13:06:54,529 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 13:06:54,530 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 13:06:54,530 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 13:06:54,530 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 13:06:54,531 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 13:06:54,532 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 13:06:54,533 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743c86b-6773-4c52-8d4f-f13624eec11d/bin/uautomizer-wIGwrQj20G/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-11-23 13:06:54,567 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 13:06:54,567 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 13:06:54,568 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-23 13:06:54,568 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-23 13:06:54,575 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-23 13:06:54,576 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-23 13:06:54,576 INFO L138 SettingsManager]: * Use SBE=true [2021-11-23 13:06:54,576 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 13:06:54,576 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-23 13:06:54,577 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-23 13:06:54,578 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-23 13:06:54,578 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-23 13:06:54,578 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 13:06:54,578 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-23 13:06:54,578 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-23 13:06:54,579 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-23 13:06:54,579 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-23 13:06:54,579 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-23 13:06:54,579 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-23 13:06:54,580 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 13:06:54,580 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 13:06:54,580 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-23 13:06:54,580 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-23 13:06:54,580 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 13:06:54,581 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 13:06:54,581 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-23 13:06:54,581 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-23 13:06:54,581 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-23 13:06:54,582 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-23 13:06:54,582 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_5743c86b-6773-4c52-8d4f-f13624eec11d/bin/uautomizer-wIGwrQj20G/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_5743c86b-6773-4c52-8d4f-f13624eec11d/bin/uautomizer-wIGwrQj20G Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> c10f64ae1701d633846cd3dbd537781b9e2aef0b0b5befdebbc22e76d228933b [2021-11-23 13:06:54,821 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 13:06:54,842 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 13:06:54,844 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 13:06:54,846 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 13:06:54,846 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 13:06:54,848 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743c86b-6773-4c52-8d4f-f13624eec11d/bin/uautomizer-wIGwrQj20G/../../sv-benchmarks/c/memsafety/960521-1-3.i [2021-11-23 13:06:54,920 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743c86b-6773-4c52-8d4f-f13624eec11d/bin/uautomizer-wIGwrQj20G/data/efb38dfaa/00581737cecc454692f4f7baab99d74f/FLAG742e7f6f0 [2021-11-23 13:06:55,463 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 13:06:55,463 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743c86b-6773-4c52-8d4f-f13624eec11d/sv-benchmarks/c/memsafety/960521-1-3.i [2021-11-23 13:06:55,490 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743c86b-6773-4c52-8d4f-f13624eec11d/bin/uautomizer-wIGwrQj20G/data/efb38dfaa/00581737cecc454692f4f7baab99d74f/FLAG742e7f6f0 [2021-11-23 13:06:55,779 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743c86b-6773-4c52-8d4f-f13624eec11d/bin/uautomizer-wIGwrQj20G/data/efb38dfaa/00581737cecc454692f4f7baab99d74f [2021-11-23 13:06:55,781 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 13:06:55,782 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 13:06:55,784 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 13:06:55,784 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 13:06:55,787 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 13:06:55,788 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:06:55" (1/1) ... [2021-11-23 13:06:55,789 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@121851e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:55, skipping insertion in model container [2021-11-23 13:06:55,789 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:06:55" (1/1) ... [2021-11-23 13:06:55,796 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 13:06:55,849 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 13:06:56,232 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 13:06:56,241 INFO L203 MainTranslator]: Completed pre-run [2021-11-23 13:06:56,309 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 13:06:56,344 INFO L208 MainTranslator]: Completed translation [2021-11-23 13:06:56,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:56 WrapperNode [2021-11-23 13:06:56,346 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 13:06:56,347 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-23 13:06:56,347 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-23 13:06:56,347 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-23 13:06:56,355 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:56" (1/1) ... [2021-11-23 13:06:56,390 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:56" (1/1) ... [2021-11-23 13:06:56,421 INFO L137 Inliner]: procedures = 121, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 65 [2021-11-23 13:06:56,421 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-23 13:06:56,422 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-23 13:06:56,423 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-23 13:06:56,423 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-23 13:06:56,432 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:56" (1/1) ... [2021-11-23 13:06:56,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:56" (1/1) ... [2021-11-23 13:06:56,441 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:56" (1/1) ... [2021-11-23 13:06:56,442 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:56" (1/1) ... [2021-11-23 13:06:56,459 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:56" (1/1) ... [2021-11-23 13:06:56,462 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:56" (1/1) ... [2021-11-23 13:06:56,463 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:56" (1/1) ... [2021-11-23 13:06:56,466 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-23 13:06:56,467 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-23 13:06:56,467 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-23 13:06:56,467 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-23 13:06:56,469 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:56" (1/1) ... [2021-11-23 13:06:56,476 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 13:06:56,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743c86b-6773-4c52-8d4f-f13624eec11d/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 13:06:56,501 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743c86b-6773-4c52-8d4f-f13624eec11d/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-23 13:06:56,532 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743c86b-6773-4c52-8d4f-f13624eec11d/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-23 13:06:56,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-23 13:06:56,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-23 13:06:56,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-23 13:06:56,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-23 13:06:56,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-23 13:06:56,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-23 13:06:56,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-23 13:06:56,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-23 13:06:56,664 INFO L236 CfgBuilder]: Building ICFG [2021-11-23 13:06:56,666 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-23 13:06:56,899 INFO L277 CfgBuilder]: Performing block encoding [2021-11-23 13:06:56,913 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-23 13:06:56,914 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-11-23 13:06:56,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:06:56 BoogieIcfgContainer [2021-11-23 13:06:56,916 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-23 13:06:56,918 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-23 13:06:56,918 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-23 13:06:56,929 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-23 13:06:56,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:06:55" (1/3) ... [2021-11-23 13:06:56,930 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@641c750d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:06:56, skipping insertion in model container [2021-11-23 13:06:56,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:56" (2/3) ... [2021-11-23 13:06:56,931 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@641c750d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:06:56, skipping insertion in model container [2021-11-23 13:06:56,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:06:56" (3/3) ... [2021-11-23 13:06:56,932 INFO L111 eAbstractionObserver]: Analyzing ICFG 960521-1-3.i [2021-11-23 13:06:56,937 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-23 13:06:56,937 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2021-11-23 13:06:57,000 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-23 13:06:57,011 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-23 13:06:57,011 INFO L340 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2021-11-23 13:06:57,024 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 29 states have (on average 1.896551724137931) internal successors, (55), 50 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:06:57,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-11-23 13:06:57,031 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:06:57,031 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-11-23 13:06:57,032 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-11-23 13:06:57,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:06:57,038 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-11-23 13:06:57,051 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:06:57,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662675314] [2021-11-23 13:06:57,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:06:57,053 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:06:57,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:06:57,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:06:57,211 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:06:57,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662675314] [2021-11-23 13:06:57,212 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662675314] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:06:57,212 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:06:57,212 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-23 13:06:57,214 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872547432] [2021-11-23 13:06:57,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:06:57,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 13:06:57,220 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:06:57,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 13:06:57,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:06:57,251 INFO L87 Difference]: Start difference. First operand has 51 states, 29 states have (on average 1.896551724137931) internal successors, (55), 50 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:06:57,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:06:57,328 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2021-11-23 13:06:57,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 13:06:57,331 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-11-23 13:06:57,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:06:57,337 INFO L225 Difference]: With dead ends: 50 [2021-11-23 13:06:57,338 INFO L226 Difference]: Without dead ends: 48 [2021-11-23 13:06:57,339 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:06:57,343 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 2 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 13:06:57,344 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 81 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 13:06:57,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2021-11-23 13:06:57,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2021-11-23 13:06:57,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 47 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:06:57,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2021-11-23 13:06:57,376 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 3 [2021-11-23 13:06:57,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:06:57,376 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2021-11-23 13:06:57,377 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:06:57,377 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2021-11-23 13:06:57,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-11-23 13:06:57,383 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:06:57,383 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-11-23 13:06:57,383 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-23 13:06:57,384 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-11-23 13:06:57,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:06:57,385 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-11-23 13:06:57,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:06:57,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249715153] [2021-11-23 13:06:57,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:06:57,386 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:06:57,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:06:57,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:06:57,492 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:06:57,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249715153] [2021-11-23 13:06:57,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249715153] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:06:57,494 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:06:57,494 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-23 13:06:57,494 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325141760] [2021-11-23 13:06:57,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:06:57,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 13:06:57,496 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:06:57,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 13:06:57,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:06:57,497 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:06:57,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:06:57,518 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2021-11-23 13:06:57,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 13:06:57,519 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-11-23 13:06:57,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:06:57,520 INFO L225 Difference]: With dead ends: 47 [2021-11-23 13:06:57,520 INFO L226 Difference]: Without dead ends: 47 [2021-11-23 13:06:57,521 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:06:57,522 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 1 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:06:57,523 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 87 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:06:57,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-11-23 13:06:57,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2021-11-23 13:06:57,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 28 states have (on average 1.75) internal successors, (49), 46 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:06:57,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2021-11-23 13:06:57,530 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 3 [2021-11-23 13:06:57,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:06:57,530 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2021-11-23 13:06:57,531 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:06:57,531 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2021-11-23 13:06:57,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-23 13:06:57,531 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:06:57,531 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-23 13:06:57,532 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-23 13:06:57,532 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-11-23 13:06:57,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:06:57,533 INFO L85 PathProgramCache]: Analyzing trace with hash 889446312, now seen corresponding path program 1 times [2021-11-23 13:06:57,533 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:06:57,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885688950] [2021-11-23 13:06:57,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:06:57,534 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:06:57,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:06:57,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:06:57,660 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:06:57,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885688950] [2021-11-23 13:06:57,660 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885688950] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:06:57,660 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:06:57,660 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 13:06:57,661 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842161672] [2021-11-23 13:06:57,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:06:57,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 13:06:57,661 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:06:57,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 13:06:57,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-23 13:06:57,663 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:06:57,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:06:57,707 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2021-11-23 13:06:57,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 13:06:57,707 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-11-23 13:06:57,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:06:57,708 INFO L225 Difference]: With dead ends: 44 [2021-11-23 13:06:57,709 INFO L226 Difference]: Without dead ends: 44 [2021-11-23 13:06:57,709 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-23 13:06:57,711 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 28 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:06:57,711 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 51 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:06:57,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-11-23 13:06:57,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2021-11-23 13:06:57,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 43 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:06:57,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2021-11-23 13:06:57,718 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 6 [2021-11-23 13:06:57,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:06:57,718 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2021-11-23 13:06:57,719 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:06:57,719 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2021-11-23 13:06:57,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-23 13:06:57,719 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:06:57,720 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-23 13:06:57,720 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-23 13:06:57,720 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-11-23 13:06:57,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:06:57,721 INFO L85 PathProgramCache]: Analyzing trace with hash 889446313, now seen corresponding path program 1 times [2021-11-23 13:06:57,721 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:06:57,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009173040] [2021-11-23 13:06:57,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:06:57,722 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:06:57,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:06:57,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:06:57,855 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:06:57,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009173040] [2021-11-23 13:06:57,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009173040] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:06:57,855 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:06:57,855 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 13:06:57,856 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479097549] [2021-11-23 13:06:57,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:06:57,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 13:06:57,857 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:06:57,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 13:06:57,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 13:06:57,860 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:06:57,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:06:57,998 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2021-11-23 13:06:58,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 13:06:58,001 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-11-23 13:06:58,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:06:58,002 INFO L225 Difference]: With dead ends: 50 [2021-11-23 13:06:58,002 INFO L226 Difference]: Without dead ends: 50 [2021-11-23 13:06:58,003 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 13:06:58,004 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 53 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 13:06:58,005 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 62 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 13:06:58,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-11-23 13:06:58,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2021-11-23 13:06:58,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 44 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:06:58,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2021-11-23 13:06:58,017 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 6 [2021-11-23 13:06:58,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:06:58,018 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2021-11-23 13:06:58,018 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:06:58,018 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2021-11-23 13:06:58,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-23 13:06:58,019 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:06:58,019 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:06:58,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-23 13:06:58,020 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-11-23 13:06:58,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:06:58,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1841820687, now seen corresponding path program 1 times [2021-11-23 13:06:58,024 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:06:58,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104561694] [2021-11-23 13:06:58,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:06:58,024 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:06:58,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:06:58,185 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:06:58,186 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:06:58,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104561694] [2021-11-23 13:06:58,186 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104561694] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 13:06:58,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773138724] [2021-11-23 13:06:58,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:06:58,187 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 13:06:58,188 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743c86b-6773-4c52-8d4f-f13624eec11d/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 13:06:58,193 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743c86b-6773-4c52-8d4f-f13624eec11d/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 13:06:58,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743c86b-6773-4c52-8d4f-f13624eec11d/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-23 13:06:58,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:06:58,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-23 13:06:58,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 13:06:58,326 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-11-23 13:06:58,327 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 18 [2021-11-23 13:06:58,571 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:06:58,572 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 13:06:58,705 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:06:58,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773138724] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 13:06:58,705 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 13:06:58,706 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2021-11-23 13:06:58,706 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242568376] [2021-11-23 13:06:58,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 13:06:58,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-23 13:06:58,707 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:06:58,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-23 13:06:58,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-11-23 13:06:58,714 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:06:58,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:06:58,981 INFO L93 Difference]: Finished difference Result 92 states and 95 transitions. [2021-11-23 13:06:58,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-23 13:06:58,982 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-11-23 13:06:58,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:06:58,983 INFO L225 Difference]: With dead ends: 92 [2021-11-23 13:06:58,983 INFO L226 Difference]: Without dead ends: 92 [2021-11-23 13:06:58,983 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2021-11-23 13:06:58,985 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 371 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 13:06:58,985 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [371 Valid, 80 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 13:06:58,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-11-23 13:06:58,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 57. [2021-11-23 13:06:58,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 43 states have (on average 1.4186046511627908) internal successors, (61), 56 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:06:58,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2021-11-23 13:06:58,992 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 9 [2021-11-23 13:06:58,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:06:58,993 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2021-11-23 13:06:58,993 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:06:58,993 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2021-11-23 13:06:58,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-23 13:06:58,994 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:06:58,994 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1] [2021-11-23 13:06:59,029 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743c86b-6773-4c52-8d4f-f13624eec11d/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-23 13:06:59,215 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743c86b-6773-4c52-8d4f-f13624eec11d/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 13:06:59,216 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-11-23 13:06:59,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:06:59,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1941957673, now seen corresponding path program 2 times [2021-11-23 13:06:59,216 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:06:59,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277617384] [2021-11-23 13:06:59,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:06:59,217 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:06:59,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:06:59,417 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:06:59,418 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:06:59,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277617384] [2021-11-23 13:06:59,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277617384] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 13:06:59,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980976671] [2021-11-23 13:06:59,418 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-23 13:06:59,418 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 13:06:59,419 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743c86b-6773-4c52-8d4f-f13624eec11d/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 13:06:59,419 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743c86b-6773-4c52-8d4f-f13624eec11d/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 13:06:59,424 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743c86b-6773-4c52-8d4f-f13624eec11d/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-23 13:06:59,479 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-23 13:06:59,480 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 13:06:59,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-23 13:06:59,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 13:06:59,517 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-11-23 13:06:59,517 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 15 [2021-11-23 13:06:59,790 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:06:59,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 13:07:00,515 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:07:00,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980976671] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 13:07:00,516 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 13:07:00,516 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2021-11-23 13:07:00,516 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734961657] [2021-11-23 13:07:00,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 13:07:00,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-23 13:07:00,518 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:07:00,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-23 13:07:00,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2021-11-23 13:07:00,520 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 23 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 23 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:07:00,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:07:00,969 INFO L93 Difference]: Finished difference Result 195 states and 201 transitions. [2021-11-23 13:07:00,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-23 13:07:00,970 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 23 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-11-23 13:07:00,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:07:00,975 INFO L225 Difference]: With dead ends: 195 [2021-11-23 13:07:00,975 INFO L226 Difference]: Without dead ends: 195 [2021-11-23 13:07:00,978 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=245, Invalid=457, Unknown=0, NotChecked=0, Total=702 [2021-11-23 13:07:00,981 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 855 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 855 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-23 13:07:00,982 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [855 Valid, 181 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-23 13:07:00,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-11-23 13:07:00,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 61. [2021-11-23 13:07:01,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 60 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:07:01,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2021-11-23 13:07:01,002 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 18 [2021-11-23 13:07:01,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:07:01,003 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2021-11-23 13:07:01,005 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 23 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:07:01,007 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2021-11-23 13:07:01,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-23 13:07:01,008 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:07:01,008 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:07:01,045 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743c86b-6773-4c52-8d4f-f13624eec11d/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-23 13:07:01,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743c86b-6773-4c52-8d4f-f13624eec11d/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-11-23 13:07:01,221 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-11-23 13:07:01,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:07:01,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1502042669, now seen corresponding path program 1 times [2021-11-23 13:07:01,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:07:01,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057769726] [2021-11-23 13:07:01,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:07:01,222 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:07:01,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:07:01,279 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2021-11-23 13:07:01,280 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:07:01,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057769726] [2021-11-23 13:07:01,280 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057769726] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:07:01,280 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:07:01,280 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 13:07:01,281 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604000959] [2021-11-23 13:07:01,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:07:01,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 13:07:01,281 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:07:01,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 13:07:01,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 13:07:01,282 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:07:01,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:07:01,318 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2021-11-23 13:07:01,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 13:07:01,319 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-23 13:07:01,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:07:01,319 INFO L225 Difference]: With dead ends: 59 [2021-11-23 13:07:01,320 INFO L226 Difference]: Without dead ends: 59 [2021-11-23 13:07:01,320 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 13:07:01,322 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 16 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:07:01,322 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 59 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:07:01,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-11-23 13:07:01,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2021-11-23 13:07:01,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 58 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:07:01,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2021-11-23 13:07:01,334 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 26 [2021-11-23 13:07:01,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:07:01,334 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2021-11-23 13:07:01,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:07:01,334 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2021-11-23 13:07:01,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-23 13:07:01,335 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:07:01,335 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:07:01,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-23 13:07:01,336 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-11-23 13:07:01,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:07:01,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1502042668, now seen corresponding path program 1 times [2021-11-23 13:07:01,337 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:07:01,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657430244] [2021-11-23 13:07:01,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:07:01,337 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:07:01,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:07:01,454 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:07:01,455 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:07:01,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657430244] [2021-11-23 13:07:01,456 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657430244] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 13:07:01,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998107114] [2021-11-23 13:07:01,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:07:01,465 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 13:07:01,465 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743c86b-6773-4c52-8d4f-f13624eec11d/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 13:07:01,466 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743c86b-6773-4c52-8d4f-f13624eec11d/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 13:07:01,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743c86b-6773-4c52-8d4f-f13624eec11d/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-23 13:07:01,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:07:01,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-23 13:07:01,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 13:07:01,718 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:07:01,718 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 13:07:01,867 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:07:01,868 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998107114] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 13:07:01,868 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 13:07:01,868 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2021-11-23 13:07:01,869 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196168969] [2021-11-23 13:07:01,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 13:07:01,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-23 13:07:01,870 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:07:01,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-23 13:07:01,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=341, Unknown=0, NotChecked=0, Total=600 [2021-11-23 13:07:01,875 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand has 25 states, 25 states have (on average 2.72) internal successors, (68), 25 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:07:02,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:07:02,185 INFO L93 Difference]: Finished difference Result 290 states and 298 transitions. [2021-11-23 13:07:02,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-23 13:07:02,185 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.72) internal successors, (68), 25 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-23 13:07:02,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:07:02,187 INFO L225 Difference]: With dead ends: 290 [2021-11-23 13:07:02,187 INFO L226 Difference]: Without dead ends: 290 [2021-11-23 13:07:02,188 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=392, Invalid=600, Unknown=0, NotChecked=0, Total=992 [2021-11-23 13:07:02,189 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 997 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 997 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 13:07:02,190 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [997 Valid, 306 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 13:07:02,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2021-11-23 13:07:02,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 98. [2021-11-23 13:07:02,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 87 states have (on average 1.2183908045977012) internal successors, (106), 97 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:07:02,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2021-11-23 13:07:02,215 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 26 [2021-11-23 13:07:02,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:07:02,216 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2021-11-23 13:07:02,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.72) internal successors, (68), 25 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:07:02,216 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2021-11-23 13:07:02,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-23 13:07:02,217 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:07:02,217 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:07:02,240 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743c86b-6773-4c52-8d4f-f13624eec11d/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-23 13:07:02,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743c86b-6773-4c52-8d4f-f13624eec11d/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2021-11-23 13:07:02,418 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-11-23 13:07:02,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:07:02,418 INFO L85 PathProgramCache]: Analyzing trace with hash -23363884, now seen corresponding path program 2 times [2021-11-23 13:07:02,418 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:07:02,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117296804] [2021-11-23 13:07:02,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:07:02,419 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:07:02,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:07:02,640 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:07:02,640 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:07:02,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117296804] [2021-11-23 13:07:02,640 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117296804] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 13:07:02,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995030596] [2021-11-23 13:07:02,641 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-23 13:07:02,641 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 13:07:02,641 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743c86b-6773-4c52-8d4f-f13624eec11d/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 13:07:02,642 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743c86b-6773-4c52-8d4f-f13624eec11d/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 13:07:02,662 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743c86b-6773-4c52-8d4f-f13624eec11d/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-23 13:07:02,692 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-23 13:07:02,693 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 13:07:02,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-23 13:07:02,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 13:07:02,721 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-11-23 13:07:02,722 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 18 [2021-11-23 13:07:03,155 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2021-11-23 13:07:03,155 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 13:07:03,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995030596] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:07:03,155 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 13:07:03,156 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [18] total 20 [2021-11-23 13:07:03,156 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466296783] [2021-11-23 13:07:03,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:07:03,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 13:07:03,157 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:07:03,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 13:07:03,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=236, Unknown=0, NotChecked=0, Total=380 [2021-11-23 13:07:03,158 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:07:03,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:07:03,186 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2021-11-23 13:07:03,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 13:07:03,187 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2021-11-23 13:07:03,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:07:03,189 INFO L225 Difference]: With dead ends: 74 [2021-11-23 13:07:03,189 INFO L226 Difference]: Without dead ends: 74 [2021-11-23 13:07:03,190 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=236, Unknown=0, NotChecked=0, Total=380 [2021-11-23 13:07:03,191 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 13 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:07:03,191 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 8 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:07:03,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-11-23 13:07:03,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2021-11-23 13:07:03,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 72 states have (on average 1.1111111111111112) internal successors, (80), 73 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:07:03,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2021-11-23 13:07:03,196 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 50 [2021-11-23 13:07:03,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:07:03,196 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2021-11-23 13:07:03,197 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:07:03,197 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2021-11-23 13:07:03,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-23 13:07:03,198 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:07:03,199 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 14, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:07:03,236 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743c86b-6773-4c52-8d4f-f13624eec11d/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-23 13:07:03,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743c86b-6773-4c52-8d4f-f13624eec11d/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 13:07:03,424 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-11-23 13:07:03,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:07:03,424 INFO L85 PathProgramCache]: Analyzing trace with hash -248790283, now seen corresponding path program 1 times [2021-11-23 13:07:03,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:07:03,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854171037] [2021-11-23 13:07:03,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:07:03,425 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:07:03,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:07:03,646 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-23 13:07:03,646 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:07:03,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854171037] [2021-11-23 13:07:03,647 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854171037] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 13:07:03,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723369540] [2021-11-23 13:07:03,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:07:03,647 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 13:07:03,647 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743c86b-6773-4c52-8d4f-f13624eec11d/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 13:07:03,648 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743c86b-6773-4c52-8d4f-f13624eec11d/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 13:07:03,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743c86b-6773-4c52-8d4f-f13624eec11d/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-23 13:07:03,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:07:03,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-23 13:07:03,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 13:07:04,114 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-23 13:07:04,114 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 13:07:04,599 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-23 13:07:04,599 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723369540] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 13:07:04,600 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 13:07:04,600 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 49 [2021-11-23 13:07:04,600 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607577285] [2021-11-23 13:07:04,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 13:07:04,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2021-11-23 13:07:04,601 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:07:04,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-11-23 13:07:04,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1027, Invalid=1325, Unknown=0, NotChecked=0, Total=2352 [2021-11-23 13:07:04,603 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand has 49 states, 49 states have (on average 2.8979591836734695) internal successors, (142), 49 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:07:05,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:07:05,372 INFO L93 Difference]: Finished difference Result 257 states and 258 transitions. [2021-11-23 13:07:05,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-11-23 13:07:05,373 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.8979591836734695) internal successors, (142), 49 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-11-23 13:07:05,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:07:05,375 INFO L225 Difference]: With dead ends: 257 [2021-11-23 13:07:05,375 INFO L226 Difference]: Without dead ends: 257 [2021-11-23 13:07:05,377 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1377 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1552, Invalid=2480, Unknown=0, NotChecked=0, Total=4032 [2021-11-23 13:07:05,378 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 567 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-23 13:07:05,379 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [567 Valid, 52 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-23 13:07:05,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2021-11-23 13:07:05,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 146. [2021-11-23 13:07:05,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 144 states have (on average 1.1111111111111112) internal successors, (160), 145 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:07:05,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 160 transitions. [2021-11-23 13:07:05,387 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 160 transitions. Word has length 53 [2021-11-23 13:07:05,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:07:05,389 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 160 transitions. [2021-11-23 13:07:05,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.8979591836734695) internal successors, (142), 49 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:07:05,389 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 160 transitions. [2021-11-23 13:07:05,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-11-23 13:07:05,398 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:07:05,398 INFO L514 BasicCegarLoop]: trace histogram [30, 30, 30, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:07:05,436 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743c86b-6773-4c52-8d4f-f13624eec11d/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-23 13:07:05,611 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743c86b-6773-4c52-8d4f-f13624eec11d/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-23 13:07:05,612 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-11-23 13:07:05,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:07:05,612 INFO L85 PathProgramCache]: Analyzing trace with hash -2038312715, now seen corresponding path program 2 times [2021-11-23 13:07:05,612 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:07:05,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917643561] [2021-11-23 13:07:05,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:07:05,612 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:07:05,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:07:06,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1337 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-23 13:07:06,270 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:07:06,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917643561] [2021-11-23 13:07:06,270 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917643561] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 13:07:06,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896482827] [2021-11-23 13:07:06,271 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-23 13:07:06,271 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 13:07:06,271 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743c86b-6773-4c52-8d4f-f13624eec11d/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 13:07:06,275 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743c86b-6773-4c52-8d4f-f13624eec11d/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 13:07:06,295 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743c86b-6773-4c52-8d4f-f13624eec11d/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-23 13:07:06,360 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-23 13:07:06,360 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 13:07:06,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-23 13:07:06,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 13:07:07,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1337 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-23 13:07:07,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 13:07:09,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1337 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-23 13:07:09,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896482827] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 13:07:09,049 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 13:07:09,049 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 97 [2021-11-23 13:07:09,049 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630343570] [2021-11-23 13:07:09,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 13:07:09,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2021-11-23 13:07:09,050 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:07:09,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2021-11-23 13:07:09,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4099, Invalid=5213, Unknown=0, NotChecked=0, Total=9312 [2021-11-23 13:07:09,057 INFO L87 Difference]: Start difference. First operand 146 states and 160 transitions. Second operand has 97 states, 97 states have (on average 2.948453608247423) internal successors, (286), 97 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:07:11,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:07:11,420 INFO L93 Difference]: Finished difference Result 529 states and 530 transitions. [2021-11-23 13:07:11,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2021-11-23 13:07:11,421 INFO L78 Accepts]: Start accepts. Automaton has has 97 states, 97 states have (on average 2.948453608247423) internal successors, (286), 97 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2021-11-23 13:07:11,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:07:11,424 INFO L225 Difference]: With dead ends: 529 [2021-11-23 13:07:11,424 INFO L226 Difference]: Without dead ends: 529 [2021-11-23 13:07:11,431 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5825 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=6176, Invalid=10080, Unknown=0, NotChecked=0, Total=16256 [2021-11-23 13:07:11,432 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 1823 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 530 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1823 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 530 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-23 13:07:11,433 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1823 Valid, 86 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [530 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-23 13:07:11,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2021-11-23 13:07:11,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 290. [2021-11-23 13:07:11,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 288 states have (on average 1.1111111111111112) internal successors, (320), 289 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:07:11,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 320 transitions. [2021-11-23 13:07:11,442 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 320 transitions. Word has length 101 [2021-11-23 13:07:11,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:07:11,443 INFO L470 AbstractCegarLoop]: Abstraction has 290 states and 320 transitions. [2021-11-23 13:07:11,443 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 97 states, 97 states have (on average 2.948453608247423) internal successors, (286), 97 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:07:11,444 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 320 transitions. [2021-11-23 13:07:11,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2021-11-23 13:07:11,446 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:07:11,446 INFO L514 BasicCegarLoop]: trace histogram [62, 62, 62, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:07:11,480 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743c86b-6773-4c52-8d4f-f13624eec11d/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-23 13:07:11,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743c86b-6773-4c52-8d4f-f13624eec11d/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-11-23 13:07:11,672 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-11-23 13:07:11,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:07:11,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1886514421, now seen corresponding path program 3 times [2021-11-23 13:07:11,672 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:07:11,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816756022] [2021-11-23 13:07:11,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:07:11,673 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:07:11,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:07:13,708 INFO L134 CoverageAnalysis]: Checked inductivity of 5737 backedges. 0 proven. 5735 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-23 13:07:13,709 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:07:13,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816756022] [2021-11-23 13:07:13,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816756022] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 13:07:13,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847847157] [2021-11-23 13:07:13,709 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-23 13:07:13,709 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 13:07:13,709 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743c86b-6773-4c52-8d4f-f13624eec11d/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 13:07:13,710 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743c86b-6773-4c52-8d4f-f13624eec11d/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 13:07:13,712 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743c86b-6773-4c52-8d4f-f13624eec11d/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-23 13:07:13,766 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-23 13:07:13,767 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 13:07:13,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-23 13:07:13,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 13:07:13,794 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-11-23 13:07:13,794 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 18 [2021-11-23 13:07:15,543 INFO L134 CoverageAnalysis]: Checked inductivity of 5737 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5735 trivial. 0 not checked. [2021-11-23 13:07:15,543 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 13:07:15,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847847157] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:07:15,544 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 13:07:15,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [66] total 70 [2021-11-23 13:07:15,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693313835] [2021-11-23 13:07:15,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:07:15,545 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 13:07:15,545 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:07:15,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 13:07:15,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2097, Invalid=2733, Unknown=0, NotChecked=0, Total=4830 [2021-11-23 13:07:15,547 INFO L87 Difference]: Start difference. First operand 290 states and 320 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:07:15,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:07:15,583 INFO L93 Difference]: Finished difference Result 289 states and 290 transitions. [2021-11-23 13:07:15,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 13:07:15,583 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 197 [2021-11-23 13:07:15,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:07:15,585 INFO L225 Difference]: With dead ends: 289 [2021-11-23 13:07:15,586 INFO L226 Difference]: Without dead ends: 289 [2021-11-23 13:07:15,587 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2097, Invalid=2733, Unknown=0, NotChecked=0, Total=4830 [2021-11-23 13:07:15,588 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 20 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:07:15,588 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 6 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:07:15,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-11-23 13:07:15,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2021-11-23 13:07:15,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 288 states have (on average 1.0069444444444444) internal successors, (290), 288 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:07:15,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 290 transitions. [2021-11-23 13:07:15,595 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 290 transitions. Word has length 197 [2021-11-23 13:07:15,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:07:15,595 INFO L470 AbstractCegarLoop]: Abstraction has 289 states and 290 transitions. [2021-11-23 13:07:15,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:07:15,596 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 290 transitions. [2021-11-23 13:07:15,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2021-11-23 13:07:15,600 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:07:15,600 INFO L514 BasicCegarLoop]: trace histogram [62, 62, 62, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:07:15,636 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743c86b-6773-4c52-8d4f-f13624eec11d/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-23 13:07:15,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743c86b-6773-4c52-8d4f-f13624eec11d/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-11-23 13:07:15,820 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-11-23 13:07:15,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:07:15,820 INFO L85 PathProgramCache]: Analyzing trace with hash -2434898, now seen corresponding path program 1 times [2021-11-23 13:07:15,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:07:15,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741958325] [2021-11-23 13:07:15,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:07:15,821 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:07:15,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:07:16,505 INFO L134 CoverageAnalysis]: Checked inductivity of 7161 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 5735 trivial. 0 not checked. [2021-11-23 13:07:16,506 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:07:16,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741958325] [2021-11-23 13:07:16,506 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741958325] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 13:07:16,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829777882] [2021-11-23 13:07:16,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:07:16,507 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 13:07:16,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743c86b-6773-4c52-8d4f-f13624eec11d/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 13:07:16,512 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743c86b-6773-4c52-8d4f-f13624eec11d/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 13:07:16,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743c86b-6773-4c52-8d4f-f13624eec11d/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-23 13:07:16,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:07:16,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 65 conjunts are in the unsatisfiable core [2021-11-23 13:07:16,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 13:07:19,364 INFO L134 CoverageAnalysis]: Checked inductivity of 7161 backedges. 0 proven. 5735 refuted. 0 times theorem prover too weak. 1426 trivial. 0 not checked. [2021-11-23 13:07:19,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 13:07:23,515 INFO L134 CoverageAnalysis]: Checked inductivity of 7161 backedges. 0 proven. 5735 refuted. 0 times theorem prover too weak. 1426 trivial. 0 not checked. [2021-11-23 13:07:23,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [829777882] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 13:07:23,516 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 13:07:23,516 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 66, 66] total 162 [2021-11-23 13:07:23,516 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843085722] [2021-11-23 13:07:23,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 13:07:23,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 162 states [2021-11-23 13:07:23,518 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:07:23,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2021-11-23 13:07:23,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9346, Invalid=16736, Unknown=0, NotChecked=0, Total=26082 [2021-11-23 13:07:23,527 INFO L87 Difference]: Start difference. First operand 289 states and 290 transitions. Second operand has 162 states, 162 states have (on average 3.0246913580246915) internal successors, (490), 162 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:07:31,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:07:31,964 INFO L93 Difference]: Finished difference Result 949 states and 950 transitions. [2021-11-23 13:07:31,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2021-11-23 13:07:31,965 INFO L78 Accepts]: Start accepts. Automaton has has 162 states, 162 states have (on average 3.0246913580246915) internal successors, (490), 162 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 288 [2021-11-23 13:07:31,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:07:31,970 INFO L225 Difference]: With dead ends: 949 [2021-11-23 13:07:31,970 INFO L226 Difference]: Without dead ends: 949 [2021-11-23 13:07:31,976 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 736 GetRequests, 512 SyntacticMatches, 0 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16093 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=17761, Invalid=33089, Unknown=0, NotChecked=0, Total=50850 [2021-11-23 13:07:31,976 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 2826 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 874 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2826 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 1824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 874 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-23 13:07:31,977 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2826 Valid, 165 Invalid, 1824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [874 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-23 13:07:31,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2021-11-23 13:07:31,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 577. [2021-11-23 13:07:31,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 576 states have (on average 1.0034722222222223) internal successors, (578), 576 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:07:31,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 578 transitions. [2021-11-23 13:07:31,993 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 578 transitions. Word has length 288 [2021-11-23 13:07:31,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:07:31,994 INFO L470 AbstractCegarLoop]: Abstraction has 577 states and 578 transitions. [2021-11-23 13:07:31,995 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 162 states, 162 states have (on average 3.0246913580246915) internal successors, (490), 162 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:07:31,995 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 578 transitions. [2021-11-23 13:07:32,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2021-11-23 13:07:32,028 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:07:32,029 INFO L514 BasicCegarLoop]: trace histogram [126, 126, 126, 63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:07:32,064 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743c86b-6773-4c52-8d4f-f13624eec11d/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-11-23 13:07:32,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743c86b-6773-4c52-8d4f-f13624eec11d/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-11-23 13:07:32,256 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-11-23 13:07:32,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:07:32,256 INFO L85 PathProgramCache]: Analyzing trace with hash -2038208850, now seen corresponding path program 2 times [2021-11-23 13:07:32,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:07:32,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163981967] [2021-11-23 13:07:32,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:07:32,257 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:07:32,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:07:34,342 INFO L134 CoverageAnalysis]: Checked inductivity of 29673 backedges. 0 proven. 5922 refuted. 0 times theorem prover too weak. 23751 trivial. 0 not checked. [2021-11-23 13:07:34,343 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:07:34,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163981967] [2021-11-23 13:07:34,343 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163981967] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 13:07:34,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562721981] [2021-11-23 13:07:34,343 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-23 13:07:34,344 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 13:07:34,344 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743c86b-6773-4c52-8d4f-f13624eec11d/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 13:07:34,345 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743c86b-6773-4c52-8d4f-f13624eec11d/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 13:07:34,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743c86b-6773-4c52-8d4f-f13624eec11d/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-23 13:07:34,627 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-23 13:07:34,627 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 13:07:34,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 1577 conjuncts, 129 conjunts are in the unsatisfiable core [2021-11-23 13:07:34,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 13:07:42,783 INFO L134 CoverageAnalysis]: Checked inductivity of 29673 backedges. 0 proven. 23751 refuted. 0 times theorem prover too weak. 5922 trivial. 0 not checked. [2021-11-23 13:07:42,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 13:07:53,347 INFO L134 CoverageAnalysis]: Checked inductivity of 29673 backedges. 0 proven. 23751 refuted. 0 times theorem prover too weak. 5922 trivial. 0 not checked. [2021-11-23 13:07:53,348 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562721981] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 13:07:53,348 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 13:07:53,349 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 130, 130] total 322 [2021-11-23 13:07:53,349 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241231311] [2021-11-23 13:07:53,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 13:07:53,352 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 322 states [2021-11-23 13:07:53,352 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:07:53,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 322 interpolants. [2021-11-23 13:07:53,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29247, Invalid=74115, Unknown=0, NotChecked=0, Total=103362 [2021-11-23 13:07:53,371 INFO L87 Difference]: Start difference. First operand 577 states and 578 transitions. Second operand has 322 states, 322 states have (on average 3.012422360248447) internal successors, (970), 322 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:08:05,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:08:05,670 INFO L93 Difference]: Finished difference Result 775 states and 776 transitions. [2021-11-23 13:08:05,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2021-11-23 13:08:05,671 INFO L78 Accepts]: Start accepts. Automaton has has 322 states, 322 states have (on average 3.012422360248447) internal successors, (970), 322 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 576 [2021-11-23 13:08:05,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:08:05,678 INFO L225 Difference]: With dead ends: 775 [2021-11-23 13:08:05,678 INFO L226 Difference]: Without dead ends: 775 [2021-11-23 13:08:05,685 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1220 GetRequests, 898 SyntacticMatches, 0 SemanticMatches, 322 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56640 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=29702, Invalid=74950, Unknown=0, NotChecked=0, Total=104652 [2021-11-23 13:08:05,686 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 3744 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 1476 mSolverCounterSat, 1683 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3744 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 3159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1683 IncrementalHoareTripleChecker+Valid, 1476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-11-23 13:08:05,686 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3744 Valid, 73 Invalid, 3159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1683 Valid, 1476 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-11-23 13:08:05,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2021-11-23 13:08:05,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 775. [2021-11-23 13:08:05,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 774 states have (on average 1.0025839793281655) internal successors, (776), 774 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:08:05,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 776 transitions. [2021-11-23 13:08:05,707 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 776 transitions. Word has length 576 [2021-11-23 13:08:05,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:08:05,708 INFO L470 AbstractCegarLoop]: Abstraction has 775 states and 776 transitions. [2021-11-23 13:08:05,709 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 322 states, 322 states have (on average 3.012422360248447) internal successors, (970), 322 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:08:05,709 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 776 transitions. [2021-11-23 13:08:05,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 775 [2021-11-23 13:08:05,732 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:08:05,732 INFO L514 BasicCegarLoop]: trace histogram [128, 128, 128, 127, 127, 127, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:08:05,771 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743c86b-6773-4c52-8d4f-f13624eec11d/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-23 13:08:05,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743c86b-6773-4c52-8d4f-f13624eec11d/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-11-23 13:08:05,952 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-11-23 13:08:05,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:08:05,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1306820846, now seen corresponding path program 3 times [2021-11-23 13:08:05,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:08:05,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795466132] [2021-11-23 13:08:05,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:08:05,953 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:08:06,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 13:08:06,710 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 13:08:07,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 13:08:07,758 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-23 13:08:07,758 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-23 13:08:07,759 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr7REQUIRES_VIOLATION (20 of 21 remaining) [2021-11-23 13:08:07,760 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (19 of 21 remaining) [2021-11-23 13:08:07,761 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (18 of 21 remaining) [2021-11-23 13:08:07,761 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (17 of 21 remaining) [2021-11-23 13:08:07,761 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (16 of 21 remaining) [2021-11-23 13:08:07,761 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (15 of 21 remaining) [2021-11-23 13:08:07,761 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (14 of 21 remaining) [2021-11-23 13:08:07,761 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (13 of 21 remaining) [2021-11-23 13:08:07,762 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE (12 of 21 remaining) [2021-11-23 13:08:07,762 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE (11 of 21 remaining) [2021-11-23 13:08:07,762 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE (10 of 21 remaining) [2021-11-23 13:08:07,762 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE (9 of 21 remaining) [2021-11-23 13:08:07,762 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE (8 of 21 remaining) [2021-11-23 13:08:07,762 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE (7 of 21 remaining) [2021-11-23 13:08:07,762 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE (6 of 21 remaining) [2021-11-23 13:08:07,763 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE (5 of 21 remaining) [2021-11-23 13:08:07,763 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (4 of 21 remaining) [2021-11-23 13:08:07,763 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (3 of 21 remaining) [2021-11-23 13:08:07,763 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (2 of 21 remaining) [2021-11-23 13:08:07,763 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE (1 of 21 remaining) [2021-11-23 13:08:07,763 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK (0 of 21 remaining) [2021-11-23 13:08:07,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-23 13:08:07,766 INFO L732 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 1, 1, 1, 1, 1] [2021-11-23 13:08:07,771 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-23 13:08:08,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:08:08 BoogieIcfgContainer [2021-11-23 13:08:08,073 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-23 13:08:08,074 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-23 13:08:08,074 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-23 13:08:08,075 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-23 13:08:08,075 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:06:56" (3/4) ... [2021-11-23 13:08:08,077 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-23 13:08:08,300 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743c86b-6773-4c52-8d4f-f13624eec11d/bin/uautomizer-wIGwrQj20G/witness.graphml [2021-11-23 13:08:08,300 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-23 13:08:08,301 INFO L158 Benchmark]: Toolchain (without parser) took 72518.60ms. Allocated memory was 107.0MB in the beginning and 1.0GB in the end (delta: 897.6MB). Free memory was 77.0MB in the beginning and 653.0MB in the end (delta: -576.1MB). Peak memory consumption was 322.6MB. Max. memory is 16.1GB. [2021-11-23 13:08:08,301 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 107.0MB. Free memory is still 62.2MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-23 13:08:08,302 INFO L158 Benchmark]: CACSL2BoogieTranslator took 562.34ms. Allocated memory was 107.0MB in the beginning and 153.1MB in the end (delta: 46.1MB). Free memory was 76.7MB in the beginning and 122.5MB in the end (delta: -45.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-23 13:08:08,302 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.80ms. Allocated memory is still 153.1MB. Free memory was 122.5MB in the beginning and 120.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-23 13:08:08,303 INFO L158 Benchmark]: Boogie Preprocessor took 43.40ms. Allocated memory is still 153.1MB. Free memory was 120.2MB in the beginning and 118.8MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-23 13:08:08,303 INFO L158 Benchmark]: RCFGBuilder took 449.27ms. Allocated memory is still 153.1MB. Free memory was 118.8MB in the beginning and 107.0MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-23 13:08:08,304 INFO L158 Benchmark]: TraceAbstraction took 71155.83ms. Allocated memory was 153.1MB in the beginning and 1.0GB in the end (delta: 851.4MB). Free memory was 106.3MB in the beginning and 689.7MB in the end (delta: -583.5MB). Peak memory consumption was 268.6MB. Max. memory is 16.1GB. [2021-11-23 13:08:08,304 INFO L158 Benchmark]: Witness Printer took 226.32ms. Allocated memory is still 1.0GB. Free memory was 689.7MB in the beginning and 653.0MB in the end (delta: 36.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2021-11-23 13:08:08,306 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 107.0MB. Free memory is still 62.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 562.34ms. Allocated memory was 107.0MB in the beginning and 153.1MB in the end (delta: 46.1MB). Free memory was 76.7MB in the beginning and 122.5MB in the end (delta: -45.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.80ms. Allocated memory is still 153.1MB. Free memory was 122.5MB in the beginning and 120.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.40ms. Allocated memory is still 153.1MB. Free memory was 120.2MB in the beginning and 118.8MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 449.27ms. Allocated memory is still 153.1MB. Free memory was 118.8MB in the beginning and 107.0MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 71155.83ms. Allocated memory was 153.1MB in the beginning and 1.0GB in the end (delta: 851.4MB). Free memory was 106.3MB in the beginning and 689.7MB in the end (delta: -583.5MB). Peak memory consumption was 268.6MB. Max. memory is 16.1GB. * Witness Printer took 226.32ms. Allocated memory is still 1.0GB. Free memory was 689.7MB in the beginning and 653.0MB in the end (delta: 36.7MB). Peak memory consumption was 37.7MB. 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 - CounterExampleResult [Line: 540]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L523] int *a, *b; [L524] int n; VAL [a={0:0}, b={0:0}, n=0] [L535] n = 128 [L536] a = malloc (n * sizeof(*a)) [L537] b = malloc (n * sizeof(*b)) [L538] EXPR b++ VAL [a={-2:0}, b={-3:4}, b++={-3:0}, n=128] [L538] *b++ = 0 VAL [a={-2:0}, b={-3:4}, b++={-3:0}, n=128] [L539] CALL foo () [L527] int i; [L528] i = 0 VAL [a={-2:0}, b={-3:4}, i=0, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=0, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=0, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=1, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=1, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=1, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=2, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=2, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=2, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=3, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=3, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=3, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=4, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=4, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=4, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=5, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=5, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=5, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=6, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=6, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=6, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=7, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=7, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=7, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=8, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=8, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=8, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=9, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=9, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=9, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=10, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=10, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=10, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=11, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=11, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=11, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=12, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=12, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=12, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=13, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=13, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=13, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=14, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=14, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=14, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=15, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=15, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=15, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=16, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=16, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=16, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=17, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=17, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=17, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=18, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=18, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=18, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=19, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=19, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=19, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=20, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=20, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=20, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=21, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=21, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=21, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=22, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=22, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=22, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=23, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=23, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=23, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=24, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=24, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=24, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=25, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=25, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=25, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=26, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=26, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=26, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=27, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=27, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=27, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=28, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=28, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=28, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=29, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=29, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=29, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=30, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=30, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=30, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=31, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=31, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=31, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=32, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=32, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=32, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=33, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=33, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=33, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=34, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=34, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=34, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=35, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=35, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=35, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=36, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=36, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=36, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=37, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=37, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=37, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=38, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=38, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=38, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=39, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=39, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=39, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=40, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=40, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=40, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=41, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=41, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=41, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=42, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=42, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=42, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=43, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=43, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=43, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=44, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=44, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=44, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=45, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=45, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=45, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=46, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=46, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=46, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=47, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=47, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=47, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=48, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=48, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=48, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=49, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=49, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=49, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=50, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=50, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=50, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=51, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=51, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=51, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=52, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=52, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=52, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=53, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=53, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=53, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=54, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=54, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=54, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=55, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=55, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=55, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=56, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=56, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=56, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=57, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=57, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=57, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=58, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=58, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=58, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=59, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=59, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=59, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=60, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=60, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=60, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=61, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=61, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=61, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=62, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=62, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=62, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=63, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=63, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=63, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=64, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=64, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=64, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=65, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=65, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=65, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=66, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=66, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=66, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=67, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=67, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=67, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=68, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=68, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=68, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=69, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=69, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=69, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=70, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=70, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=70, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=71, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=71, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=71, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=72, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=72, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=72, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=73, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=73, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=73, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=74, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=74, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=74, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=75, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=75, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=75, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=76, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=76, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=76, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=77, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=77, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=77, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=78, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=78, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=78, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=79, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=79, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=79, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=80, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=80, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=80, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=81, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=81, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=81, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=82, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=82, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=82, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=83, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=83, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=83, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=84, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=84, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=84, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=85, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=85, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=85, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=86, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=86, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=86, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=87, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=87, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=87, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=88, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=88, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=88, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=89, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=89, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=89, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=90, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=90, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=90, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=91, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=91, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=91, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=92, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=92, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=92, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=93, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=93, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=93, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=94, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=94, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=94, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=95, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=95, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=95, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=96, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=96, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=96, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=97, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=97, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=97, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=98, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=98, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=98, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=99, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=99, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=99, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=100, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=100, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=100, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=101, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=101, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=101, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=102, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=102, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=102, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=103, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=103, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=103, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=104, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=104, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=104, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=105, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=105, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=105, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=106, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=106, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=106, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=107, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=107, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=107, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=108, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=108, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=108, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=109, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=109, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=109, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=110, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=110, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=110, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=111, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=111, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=111, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=112, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=112, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=112, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=113, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=113, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=113, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=114, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=114, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=114, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=115, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=115, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=115, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=116, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=116, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=116, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=117, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=117, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=117, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=118, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=118, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=118, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=119, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=119, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=119, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=120, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=120, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=120, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=121, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=121, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=121, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=122, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=122, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=122, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=123, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=123, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=123, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=124, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=124, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=124, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=125, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=125, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=125, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=126, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=126, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=126, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=127, n=128] [L528] COND TRUE i < n VAL [a={-2:0}, b={-3:4}, i=127, n=128] [L529] a[i] = -1 VAL [a={-2:0}, b={-3:4}, i=127, n=128] [L528] i++ VAL [a={-2:0}, b={-3:4}, i=128, n=128] [L528] COND FALSE !(i < n) VAL [a={-2:0}, b={-3:4}, i=128, n=128] [L530] i = 0 VAL [a={-2:0}, b={-3:4}, i=0, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=0, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=0, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=1, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=1, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=1, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=2, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=2, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=2, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=3, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=3, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=3, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=4, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=4, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=4, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=5, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=5, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=5, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=6, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=6, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=6, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=7, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=7, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=7, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=8, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=8, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=8, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=9, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=9, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=9, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=10, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=10, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=10, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=11, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=11, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=11, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=12, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=12, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=12, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=13, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=13, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=13, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=14, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=14, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=14, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=15, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=15, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=15, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=16, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=16, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=16, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=17, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=17, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=17, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=18, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=18, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=18, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=19, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=19, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=19, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=20, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=20, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=20, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=21, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=21, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=21, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=22, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=22, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=22, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=23, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=23, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=23, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=24, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=24, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=24, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=25, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=25, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=25, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=26, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=26, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=26, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=27, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=27, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=27, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=28, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=28, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=28, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=29, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=29, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=29, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=30, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=30, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=30, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=31, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=31, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=31, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=32, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=32, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=32, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=33, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=33, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=33, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=34, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=34, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=34, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=35, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=35, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=35, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=36, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=36, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=36, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=37, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=37, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=37, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=38, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=38, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=38, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=39, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=39, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=39, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=40, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=40, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=40, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=41, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=41, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=41, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=42, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=42, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=42, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=43, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=43, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=43, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=44, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=44, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=44, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=45, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=45, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=45, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=46, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=46, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=46, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=47, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=47, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=47, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=48, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=48, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=48, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=49, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=49, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=49, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=50, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=50, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=50, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=51, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=51, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=51, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=52, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=52, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=52, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=53, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=53, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=53, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=54, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=54, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=54, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=55, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=55, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=55, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=56, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=56, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=56, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=57, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=57, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=57, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=58, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=58, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=58, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=59, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=59, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=59, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=60, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=60, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=60, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=61, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=61, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=61, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=62, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=62, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=62, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=63, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=63, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=63, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=64, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=64, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=64, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=65, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=65, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=65, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=66, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=66, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=66, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=67, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=67, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=67, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=68, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=68, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=68, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=69, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=69, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=69, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=70, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=70, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=70, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=71, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=71, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=71, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=72, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=72, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=72, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=73, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=73, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=73, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=74, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=74, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=74, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=75, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=75, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=75, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=76, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=76, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=76, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=77, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=77, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=77, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=78, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=78, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=78, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=79, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=79, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=79, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=80, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=80, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=80, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=81, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=81, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=81, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=82, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=82, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=82, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=83, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=83, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=83, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=84, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=84, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=84, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=85, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=85, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=85, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=86, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=86, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=86, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=87, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=87, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=87, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=88, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=88, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=88, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=89, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=89, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=89, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=90, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=90, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=90, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=91, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=91, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=91, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=92, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=92, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=92, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=93, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=93, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=93, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=94, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=94, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=94, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=95, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=95, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=95, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=96, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=96, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=96, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=97, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=97, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=97, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=98, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=98, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=98, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=99, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=99, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=99, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=100, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=100, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=100, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=101, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=101, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=101, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=102, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=102, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=102, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=103, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=103, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=103, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=104, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=104, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=104, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=105, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=105, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=105, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=106, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=106, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=106, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=107, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=107, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=107, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=108, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=108, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=108, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=109, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=109, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=109, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=110, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=110, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=110, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=111, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=111, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=111, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=112, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=112, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=112, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=113, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=113, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=113, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=114, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=114, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=114, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=115, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=115, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=115, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=116, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=116, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=116, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=117, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=117, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=117, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=118, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=118, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=118, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=119, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=119, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=119, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=120, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=120, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=120, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=121, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=121, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=121, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=122, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=122, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=122, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=123, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=123, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=123, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=124, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=124, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=124, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=125, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=125, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=125, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=126, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-2:0}, b={-3:4}, i=126, n=128] [L531] b[i] = -1 VAL [a={-2:0}, b={-3:4}, i=126, n=128] [L530] i++ VAL [a={-2:0}, b={-3:4}, i=127, n=128] [L530] COND FALSE !(i < 128 - 1) VAL [a={-2:0}, b={-3:4}, i=127, n=128] [L539] RET foo () [L540] b[-2] - UnprovableResult [Line: 538]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 529]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 529]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 531]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 531]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 540]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 543]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 543]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 543]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 543]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 543]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 543]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 533]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 51 locations, 21 error locations. Started 1 CEGAR loops. OverallTime: 70.8s, OverallIterations: 15, TraceHistogramMax: 128, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 25.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11316 SdHoareTripleChecker+Valid, 5.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11316 mSDsluCounter, 1297 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 987 mSDsCounter, 3479 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4159 IncrementalHoareTripleChecker+Invalid, 7638 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3479 mSolverCounterUnsat, 310 mSDtfsCounter, 4159 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2839 GetRequests, 1941 SyntacticMatches, 0 SemanticMatches, 898 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80832 ImplicationChecksByTransitivity, 34.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=775occurred in iteration=14, InterpolantAutomatonStates: 422, 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, 14 MinimizatonAttempts, 1088 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 39.4s InterpolantComputationTime, 3454 NumberOfCodeBlocks, 3229 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 3721 ConstructedInterpolants, 0 QuantifiedInterpolants, 18780 SizeOfPredicates, 24 NumberOfNonLiveVariables, 3300 ConjunctsInSsa, 295 ConjunctsInUnsatCore, 30 InterpolantComputations, 7 PerfectInterpolantSequences, 50311/127716 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 proved your program to be incorrect! [2021-11-23 13:08:08,374 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5743c86b-6773-4c52-8d4f-f13624eec11d/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)