./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 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/960521-1-3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN --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 --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 10:51:56,960 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:51:56,962 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:51:56,996 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:51:56,996 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:51:56,997 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:51:56,999 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:51:57,001 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:51:57,002 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:51:57,003 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:51:57,004 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:51:57,006 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:51:57,006 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:51:57,007 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:51:57,009 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:51:57,010 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:51:57,011 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:51:57,012 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:51:57,014 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:51:57,016 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:51:57,018 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:51:57,019 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:51:57,020 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:51:57,021 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:51:57,026 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:51:57,026 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:51:57,026 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:51:57,027 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:51:57,028 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:51:57,029 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:51:57,030 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:51:57,030 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:51:57,031 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:51:57,032 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:51:57,033 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:51:57,034 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:51:57,035 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:51:57,035 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:51:57,035 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:51:57,036 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:51:57,037 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:51:57,039 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-20 10:51:57,079 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:51:57,080 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:51:57,081 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:51:57,081 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:51:57,082 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 10:51:57,082 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 10:51:57,083 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:51:57,083 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:51:57,083 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:51:57,084 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:51:57,085 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 10:51:57,085 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 10:51:57,085 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 10:51:57,085 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 10:51:57,085 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:51:57,086 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-20 10:51:57,086 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-20 10:51:57,086 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-20 10:51:57,086 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 10:51:57,086 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 10:51:57,087 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 10:51:57,087 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:51:57,087 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:51:57,087 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:51:57,087 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 10:51:57,088 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:51:57,088 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:51:57,088 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 10:51:57,089 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 10:51:57,089 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 10:51:57,089 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_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/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_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN 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 [2022-11-20 10:51:57,375 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:51:57,404 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:51:57,407 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:51:57,408 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:51:57,409 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:51:57,410 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/memsafety/960521-1-3.i [2022-11-20 10:52:00,478 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:52:00,748 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:52:00,748 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/sv-benchmarks/c/memsafety/960521-1-3.i [2022-11-20 10:52:00,780 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/data/d94fc9753/b6e45c25b2864569a7068c5a4aa7005c/FLAG0ef4f8f2b [2022-11-20 10:52:00,804 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/data/d94fc9753/b6e45c25b2864569a7068c5a4aa7005c [2022-11-20 10:52:00,810 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:52:00,812 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:52:00,815 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:52:00,815 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:52:00,819 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:52:00,820 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:52:00" (1/1) ... [2022-11-20 10:52:00,821 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ec0ac30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:52:00, skipping insertion in model container [2022-11-20 10:52:00,822 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:52:00" (1/1) ... [2022-11-20 10:52:00,830 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:52:00,886 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:52:01,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:52:01,282 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:52:01,342 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:52:01,373 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:52:01,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:52:01 WrapperNode [2022-11-20 10:52:01,374 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:52:01,375 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:52:01,376 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:52:01,376 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:52:01,384 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:52:01" (1/1) ... [2022-11-20 10:52:01,419 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:52:01" (1/1) ... [2022-11-20 10:52:01,447 INFO L138 Inliner]: procedures = 121, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 65 [2022-11-20 10:52:01,448 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:52:01,448 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:52:01,448 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:52:01,449 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:52:01,458 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:52:01" (1/1) ... [2022-11-20 10:52:01,458 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:52:01" (1/1) ... [2022-11-20 10:52:01,469 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:52:01" (1/1) ... [2022-11-20 10:52:01,470 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:52:01" (1/1) ... [2022-11-20 10:52:01,483 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:52:01" (1/1) ... [2022-11-20 10:52:01,493 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:52:01" (1/1) ... [2022-11-20 10:52:01,494 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:52:01" (1/1) ... [2022-11-20 10:52:01,501 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:52:01" (1/1) ... [2022-11-20 10:52:01,503 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:52:01,504 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:52:01,504 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:52:01,504 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:52:01,505 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:52:01" (1/1) ... [2022-11-20 10:52:01,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:52:01,523 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:52:01,542 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 10:52:01,569 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 10:52:01,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 10:52:01,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 10:52:01,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 10:52:01,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 10:52:01,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 10:52:01,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 10:52:01,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:52:01,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:52:01,701 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:52:01,703 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:52:01,915 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:52:01,920 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:52:01,920 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-20 10:52:01,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:52:01 BoogieIcfgContainer [2022-11-20 10:52:01,922 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:52:01,924 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 10:52:01,924 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 10:52:01,927 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 10:52:01,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:52:00" (1/3) ... [2022-11-20 10:52:01,928 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f8c74e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:52:01, skipping insertion in model container [2022-11-20 10:52:01,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:52:01" (2/3) ... [2022-11-20 10:52:01,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f8c74e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:52:01, skipping insertion in model container [2022-11-20 10:52:01,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:52:01" (3/3) ... [2022-11-20 10:52:01,930 INFO L112 eAbstractionObserver]: Analyzing ICFG 960521-1-3.i [2022-11-20 10:52:01,964 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 10:52:01,964 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2022-11-20 10:52:02,047 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:52:02,060 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7ded91c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:52:02,060 INFO L358 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2022-11-20 10:52:02,065 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) [2022-11-20 10:52:02,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-20 10:52:02,071 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:52:02,071 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-20 10:52:02,072 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-20 10:52:02,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:52:02,083 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-11-20 10:52:02,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:52:02,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875955551] [2022-11-20 10:52:02,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:02,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:52:02,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:02,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:52:02,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:52:02,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875955551] [2022-11-20 10:52:02,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875955551] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:52:02,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:52:02,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:52:02,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982332459] [2022-11-20 10:52:02,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:52:02,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:52:02,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:52:02,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:52:02,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:52:02,434 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) [2022-11-20 10:52:02,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:52:02,484 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2022-11-20 10:52:02,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:52:02,487 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 [2022-11-20 10:52:02,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:52:02,495 INFO L225 Difference]: With dead ends: 50 [2022-11-20 10:52:02,495 INFO L226 Difference]: Without dead ends: 48 [2022-11-20 10:52:02,497 INFO L412 NwaCegarLoop]: 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 [2022-11-20 10:52:02,500 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 2 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:52:02,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 81 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:52:02,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-11-20 10:52:02,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-11-20 10:52:02,532 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) [2022-11-20 10:52:02,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2022-11-20 10:52:02,534 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 3 [2022-11-20 10:52:02,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:52:02,535 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2022-11-20 10:52:02,535 INFO L496 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) [2022-11-20 10:52:02,535 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2022-11-20 10:52:02,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-20 10:52:02,536 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:52:02,536 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-20 10:52:02,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 10:52:02,537 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-20 10:52:02,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:52:02,538 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-11-20 10:52:02,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:52:02,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61741375] [2022-11-20 10:52:02,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:02,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:52:02,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:02,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:52:02,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:52:02,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61741375] [2022-11-20 10:52:02,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61741375] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:52:02,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:52:02,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:52:02,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539632050] [2022-11-20 10:52:02,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:52:02,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:52:02,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:52:02,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:52:02,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:52:02,710 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) [2022-11-20 10:52:02,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:52:02,747 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-11-20 10:52:02,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:52:02,749 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 [2022-11-20 10:52:02,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:52:02,750 INFO L225 Difference]: With dead ends: 47 [2022-11-20 10:52:02,752 INFO L226 Difference]: Without dead ends: 47 [2022-11-20 10:52:02,752 INFO L412 NwaCegarLoop]: 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 [2022-11-20 10:52:02,754 INFO L413 NwaCegarLoop]: 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 [2022-11-20 10:52:02,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 87 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:52:02,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-20 10:52:02,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-11-20 10:52:02,764 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) [2022-11-20 10:52:02,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2022-11-20 10:52:02,767 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 3 [2022-11-20 10:52:02,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:52:02,769 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2022-11-20 10:52:02,769 INFO L496 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) [2022-11-20 10:52:02,770 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-11-20 10:52:02,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-20 10:52:02,772 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:52:02,773 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-20 10:52:02,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 10:52:02,775 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-20 10:52:02,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:52:02,782 INFO L85 PathProgramCache]: Analyzing trace with hash 889446312, now seen corresponding path program 1 times [2022-11-20 10:52:02,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:52:02,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206636266] [2022-11-20 10:52:02,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:02,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:52:02,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:02,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:52:02,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:52:02,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206636266] [2022-11-20 10:52:02,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206636266] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:52:02,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:52:02,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:52:02,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595545634] [2022-11-20 10:52:02,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:52:02,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:52:02,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:52:02,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:52:02,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:52:02,905 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) [2022-11-20 10:52:02,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:52:02,957 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-11-20 10:52:02,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:52:02,958 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 [2022-11-20 10:52:02,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:52:02,959 INFO L225 Difference]: With dead ends: 44 [2022-11-20 10:52:02,959 INFO L226 Difference]: Without dead ends: 44 [2022-11-20 10:52:02,960 INFO L412 NwaCegarLoop]: 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 [2022-11-20 10:52:02,961 INFO L413 NwaCegarLoop]: 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 [2022-11-20 10:52:02,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 51 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:52:02,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-20 10:52:02,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-11-20 10:52:02,967 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) [2022-11-20 10:52:02,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2022-11-20 10:52:02,968 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 6 [2022-11-20 10:52:02,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:52:02,968 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2022-11-20 10:52:02,969 INFO L496 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) [2022-11-20 10:52:02,969 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-11-20 10:52:02,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-20 10:52:02,970 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:52:02,970 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-20 10:52:02,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 10:52:02,970 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-20 10:52:02,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:52:02,971 INFO L85 PathProgramCache]: Analyzing trace with hash 889446313, now seen corresponding path program 1 times [2022-11-20 10:52:02,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:52:02,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137915564] [2022-11-20 10:52:02,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:02,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:52:02,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:03,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:52:03,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:52:03,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137915564] [2022-11-20 10:52:03,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137915564] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:52:03,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:52:03,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:52:03,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174525736] [2022-11-20 10:52:03,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:52:03,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:52:03,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:52:03,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:52:03,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:52:03,293 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 6 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) [2022-11-20 10:52:03,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:52:03,497 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2022-11-20 10:52:03,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:52:03,498 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 6 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 [2022-11-20 10:52:03,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:52:03,499 INFO L225 Difference]: With dead ends: 51 [2022-11-20 10:52:03,499 INFO L226 Difference]: Without dead ends: 51 [2022-11-20 10:52:03,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:52:03,510 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 65 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:52:03,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 64 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:52:03,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-20 10:52:03,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2022-11-20 10:52:03,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 44 states have internal predecessors, (48), 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) [2022-11-20 10:52:03,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2022-11-20 10:52:03,515 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 6 [2022-11-20 10:52:03,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:52:03,516 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2022-11-20 10:52:03,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 6 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) [2022-11-20 10:52:03,516 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2022-11-20 10:52:03,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-20 10:52:03,517 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:52:03,517 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:52:03,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 10:52:03,517 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-20 10:52:03,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:52:03,518 INFO L85 PathProgramCache]: Analyzing trace with hash 59362067, now seen corresponding path program 1 times [2022-11-20 10:52:03,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:52:03,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850461742] [2022-11-20 10:52:03,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:03,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:52:03,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:03,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:52:03,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:52:03,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850461742] [2022-11-20 10:52:03,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850461742] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:52:03,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:52:03,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:52:03,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048203825] [2022-11-20 10:52:03,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:52:03,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:52:03,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:52:03,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:52:03,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:52:03,620 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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) [2022-11-20 10:52:03,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:52:03,662 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2022-11-20 10:52:03,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:52:03,664 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2022-11-20 10:52:03,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:52:03,666 INFO L225 Difference]: With dead ends: 50 [2022-11-20 10:52:03,667 INFO L226 Difference]: Without dead ends: 50 [2022-11-20 10:52:03,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:52:03,672 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 55 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:52:03,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 66 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:52:03,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-20 10:52:03,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2022-11-20 10:52:03,683 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) [2022-11-20 10:52:03,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2022-11-20 10:52:03,684 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 8 [2022-11-20 10:52:03,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:52:03,684 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2022-11-20 10:52:03,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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) [2022-11-20 10:52:03,685 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-11-20 10:52:03,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 10:52:03,685 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:52:03,685 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:52:03,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 10:52:03,686 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-20 10:52:03,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:52:03,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1841820687, now seen corresponding path program 1 times [2022-11-20 10:52:03,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:52:03,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016670226] [2022-11-20 10:52:03,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:03,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:52:03,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:04,058 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:52:04,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:52:04,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016670226] [2022-11-20 10:52:04,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016670226] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:52:04,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427174378] [2022-11-20 10:52:04,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:04,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:52:04,060 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:52:04,067 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:52:04,069 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 10:52:04,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:04,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-20 10:52:04,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:52:04,250 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:52:04,251 INFO L350 Elim1Store]: Elim1 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 9 treesize of output 11 [2022-11-20 10:52:04,393 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:52:04,394 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:52:04,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:52:04,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427174378] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:52:04,541 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:52:04,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2022-11-20 10:52:04,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825224428] [2022-11-20 10:52:04,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:52:04,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 10:52:04,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:52:04,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 10:52:04,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-11-20 10:52:04,547 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 13 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) [2022-11-20 10:52:04,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:52:04,944 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2022-11-20 10:52:04,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 10:52:04,945 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 13 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 [2022-11-20 10:52:04,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:52:04,946 INFO L225 Difference]: With dead ends: 67 [2022-11-20 10:52:04,947 INFO L226 Difference]: Without dead ends: 67 [2022-11-20 10:52:04,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2022-11-20 10:52:04,948 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 194 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:52:04,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 120 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:52:04,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-20 10:52:04,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 60. [2022-11-20 10:52:04,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 46 states have (on average 1.5) internal successors, (69), 59 states have internal predecessors, (69), 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) [2022-11-20 10:52:04,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2022-11-20 10:52:04,954 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 9 [2022-11-20 10:52:04,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:52:04,954 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2022-11-20 10:52:04,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 13 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) [2022-11-20 10:52:04,955 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2022-11-20 10:52:04,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 10:52:04,955 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:52:04,955 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:52:04,968 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 10:52:05,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-20 10:52:05,169 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-20 10:52:05,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:52:05,170 INFO L85 PathProgramCache]: Analyzing trace with hash 463101433, now seen corresponding path program 1 times [2022-11-20 10:52:05,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:52:05,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714108109] [2022-11-20 10:52:05,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:05,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:52:05,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:05,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:52:05,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:52:05,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714108109] [2022-11-20 10:52:05,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714108109] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:52:05,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:52:05,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:52:05,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897727354] [2022-11-20 10:52:05,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:52:05,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:52:05,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:52:05,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:52:05,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:52:05,234 INFO L87 Difference]: Start difference. First operand 60 states and 69 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) [2022-11-20 10:52:05,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:52:05,302 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2022-11-20 10:52:05,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:52:05,302 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 11 [2022-11-20 10:52:05,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:52:05,303 INFO L225 Difference]: With dead ends: 58 [2022-11-20 10:52:05,303 INFO L226 Difference]: Without dead ends: 58 [2022-11-20 10:52:05,304 INFO L412 NwaCegarLoop]: 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 [2022-11-20 10:52:05,304 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 17 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 61 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.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:52:05,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 61 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:52:05,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-20 10:52:05,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-11-20 10:52:05,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.4130434782608696) internal successors, (65), 57 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) [2022-11-20 10:52:05,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2022-11-20 10:52:05,310 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 11 [2022-11-20 10:52:05,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:52:05,311 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2022-11-20 10:52:05,311 INFO L496 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) [2022-11-20 10:52:05,311 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2022-11-20 10:52:05,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 10:52:05,312 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:52:05,312 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:52:05,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 10:52:05,312 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-20 10:52:05,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:52:05,313 INFO L85 PathProgramCache]: Analyzing trace with hash 463101434, now seen corresponding path program 1 times [2022-11-20 10:52:05,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:52:05,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21517197] [2022-11-20 10:52:05,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:05,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:52:05,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:05,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:52:05,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:52:05,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21517197] [2022-11-20 10:52:05,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21517197] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:52:05,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438996781] [2022-11-20 10:52:05,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:05,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:52:05,407 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:52:05,408 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:52:05,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 10:52:05,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:05,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 10:52:05,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:52:05,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:52:05,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:52:05,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:52:05,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438996781] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:52:05,594 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:52:05,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-20 10:52:05,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866019920] [2022-11-20 10:52:05,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:52:05,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 10:52:05,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:52:05,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 10:52:05,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2022-11-20 10:52:05,605 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 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) [2022-11-20 10:52:05,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:52:05,706 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2022-11-20 10:52:05,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:52:05,706 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 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 11 [2022-11-20 10:52:05,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:52:05,707 INFO L225 Difference]: With dead ends: 60 [2022-11-20 10:52:05,707 INFO L226 Difference]: Without dead ends: 60 [2022-11-20 10:52:05,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2022-11-20 10:52:05,708 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 160 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:52:05,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 142 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:52:05,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-11-20 10:52:05,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2022-11-20 10:52:05,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 57 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) [2022-11-20 10:52:05,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2022-11-20 10:52:05,712 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 11 [2022-11-20 10:52:05,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:52:05,713 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2022-11-20 10:52:05,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 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) [2022-11-20 10:52:05,713 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2022-11-20 10:52:05,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 10:52:05,714 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:52:05,714 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1] [2022-11-20 10:52:05,720 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 10:52:05,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:52:05,919 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-20 10:52:05,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:52:05,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1941957673, now seen corresponding path program 2 times [2022-11-20 10:52:05,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:52:05,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739172276] [2022-11-20 10:52:05,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:05,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:52:05,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:06,342 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:52:06,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:52:06,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739172276] [2022-11-20 10:52:06,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739172276] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:52:06,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926364584] [2022-11-20 10:52:06,343 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:52:06,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:52:06,343 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:52:06,345 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:52:06,367 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 10:52:06,434 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 10:52:06,434 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:52:06,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-20 10:52:06,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:52:06,467 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:52:06,467 INFO L350 Elim1Store]: Elim1 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 9 treesize of output 11 [2022-11-20 10:52:06,833 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:52:06,834 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:52:07,115 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:52:07,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926364584] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:52:07,116 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:52:07,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2022-11-20 10:52:07,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615638529] [2022-11-20 10:52:07,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:52:07,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-20 10:52:07,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:52:07,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-20 10:52:07,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2022-11-20 10:52:07,119 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand has 24 states, 23 states have (on average 2.260869565217391) internal successors, (52), 24 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) [2022-11-20 10:52:08,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:52:08,202 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2022-11-20 10:52:08,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 10:52:08,203 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.260869565217391) internal successors, (52), 24 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 [2022-11-20 10:52:08,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:52:08,204 INFO L225 Difference]: With dead ends: 108 [2022-11-20 10:52:08,204 INFO L226 Difference]: Without dead ends: 108 [2022-11-20 10:52:08,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=314, Invalid=946, Unknown=0, NotChecked=0, Total=1260 [2022-11-20 10:52:08,205 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 339 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 10:52:08,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 142 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 10:52:08,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-11-20 10:52:08,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 94. [2022-11-20 10:52:08,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 82 states have (on average 1.3414634146341464) internal successors, (110), 93 states have internal predecessors, (110), 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) [2022-11-20 10:52:08,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 110 transitions. [2022-11-20 10:52:08,219 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 110 transitions. Word has length 18 [2022-11-20 10:52:08,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:52:08,220 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 110 transitions. [2022-11-20 10:52:08,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.260869565217391) internal successors, (52), 24 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) [2022-11-20 10:52:08,220 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 110 transitions. [2022-11-20 10:52:08,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 10:52:08,221 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:52:08,221 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:52:08,231 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 10:52:08,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:52:08,422 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-20 10:52:08,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:52:08,423 INFO L85 PathProgramCache]: Analyzing trace with hash -2089502828, now seen corresponding path program 2 times [2022-11-20 10:52:08,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:52:08,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708562485] [2022-11-20 10:52:08,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:08,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:52:08,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:08,535 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:52:08,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:52:08,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708562485] [2022-11-20 10:52:08,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708562485] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:52:08,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062191997] [2022-11-20 10:52:08,536 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:52:08,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:52:08,536 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:52:08,537 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:52:08,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 10:52:08,618 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-20 10:52:08,618 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:52:08,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-20 10:52:08,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:52:08,654 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 10:52:08,663 INFO L350 Elim1Store]: Elim1 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 9 treesize of output 15 [2022-11-20 10:52:08,784 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-20 10:52:08,784 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:52:08,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2062191997] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:52:08,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:52:08,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2022-11-20 10:52:08,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384931390] [2022-11-20 10:52:08,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:52:08,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:52:08,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:52:08,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:52:08,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-11-20 10:52:08,786 INFO L87 Difference]: Start difference. First operand 94 states and 110 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) [2022-11-20 10:52:08,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:52:08,818 INFO L93 Difference]: Finished difference Result 70 states and 84 transitions. [2022-11-20 10:52:08,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:52:08,818 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 20 [2022-11-20 10:52:08,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:52:08,819 INFO L225 Difference]: With dead ends: 70 [2022-11-20 10:52:08,819 INFO L226 Difference]: Without dead ends: 70 [2022-11-20 10:52:08,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-11-20 10:52:08,820 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 14 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:52:08,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 8 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:52:08,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-20 10:52:08,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-11-20 10:52:08,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 67 states have (on average 1.2537313432835822) internal successors, (84), 69 states have internal predecessors, (84), 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) [2022-11-20 10:52:08,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 84 transitions. [2022-11-20 10:52:08,824 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 84 transitions. Word has length 20 [2022-11-20 10:52:08,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:52:08,825 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 84 transitions. [2022-11-20 10:52:08,825 INFO L496 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) [2022-11-20 10:52:08,825 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 84 transitions. [2022-11-20 10:52:08,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-20 10:52:08,826 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:52:08,826 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:52:08,840 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 10:52:09,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-20 10:52:09,032 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-20 10:52:09,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:52:09,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1417752011, now seen corresponding path program 1 times [2022-11-20 10:52:09,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:52:09,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597278059] [2022-11-20 10:52:09,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:09,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:52:09,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:09,198 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 10:52:09,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:52:09,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597278059] [2022-11-20 10:52:09,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597278059] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:52:09,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036902566] [2022-11-20 10:52:09,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:09,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:52:09,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:52:09,203 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:52:09,206 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 10:52:09,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:09,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 10:52:09,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:52:09,399 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 10:52:09,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:52:09,494 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 10:52:09,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036902566] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:52:09,494 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:52:09,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2022-11-20 10:52:09,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498346465] [2022-11-20 10:52:09,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:52:09,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-20 10:52:09,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:52:09,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-20 10:52:09,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=195, Unknown=0, NotChecked=0, Total=342 [2022-11-20 10:52:09,500 INFO L87 Difference]: Start difference. First operand 70 states and 84 transitions. Second operand has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 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) [2022-11-20 10:52:09,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:52:09,728 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2022-11-20 10:52:09,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 10:52:09,728 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 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 23 [2022-11-20 10:52:09,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:52:09,729 INFO L225 Difference]: With dead ends: 77 [2022-11-20 10:52:09,729 INFO L226 Difference]: Without dead ends: 77 [2022-11-20 10:52:09,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=222, Invalid=330, Unknown=0, NotChecked=0, Total=552 [2022-11-20 10:52:09,730 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 151 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:52:09,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 18 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:52:09,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-20 10:52:09,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 70. [2022-11-20 10:52:09,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 67 states have (on average 1.164179104477612) internal successors, (78), 69 states have internal predecessors, (78), 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) [2022-11-20 10:52:09,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2022-11-20 10:52:09,734 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 23 [2022-11-20 10:52:09,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:52:09,734 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2022-11-20 10:52:09,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 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) [2022-11-20 10:52:09,735 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2022-11-20 10:52:09,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-20 10:52:09,735 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:52:09,736 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1] [2022-11-20 10:52:09,746 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 10:52:09,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-20 10:52:09,941 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-20 10:52:09,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:52:09,942 INFO L85 PathProgramCache]: Analyzing trace with hash 820795113, now seen corresponding path program 3 times [2022-11-20 10:52:09,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:52:09,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158136452] [2022-11-20 10:52:09,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:09,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:52:09,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:10,864 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:52:10,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:52:10,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158136452] [2022-11-20 10:52:10,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158136452] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:52:10,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750403505] [2022-11-20 10:52:10,864 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 10:52:10,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:52:10,865 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:52:10,871 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:52:10,895 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 10:52:10,958 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 10:52:10,958 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:52:10,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-20 10:52:10,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:52:10,994 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-20 10:52:10,994 INFO L350 Elim1Store]: Elim1 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 19 [2022-11-20 10:52:11,354 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-11-20 10:52:11,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:52:11,734 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-11-20 10:52:11,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1750403505] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:52:11,734 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:52:11,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5, 5] total 23 [2022-11-20 10:52:11,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491976283] [2022-11-20 10:52:11,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:52:11,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-20 10:52:11,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:52:11,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-20 10:52:11,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2022-11-20 10:52:11,736 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand has 24 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 24 states have internal predecessors, (56), 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) [2022-11-20 10:52:13,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:52:13,146 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2022-11-20 10:52:13,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 10:52:13,147 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 24 states have internal predecessors, (56), 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 36 [2022-11-20 10:52:13,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:52:13,151 INFO L225 Difference]: With dead ends: 96 [2022-11-20 10:52:13,151 INFO L226 Difference]: Without dead ends: 96 [2022-11-20 10:52:13,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=272, Invalid=1134, Unknown=0, NotChecked=0, Total=1406 [2022-11-20 10:52:13,154 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 280 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 1094 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 1175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 10:52:13,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 20 Invalid, 1175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1094 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-20 10:52:13,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-20 10:52:13,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 80. [2022-11-20 10:52:13,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 78 states have (on average 1.1538461538461537) internal successors, (90), 79 states have internal predecessors, (90), 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) [2022-11-20 10:52:13,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2022-11-20 10:52:13,176 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 36 [2022-11-20 10:52:13,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:52:13,177 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2022-11-20 10:52:13,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 24 states have internal predecessors, (56), 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) [2022-11-20 10:52:13,177 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2022-11-20 10:52:13,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-20 10:52:13,178 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:52:13,178 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:52:13,191 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 10:52:13,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:52:13,385 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-20 10:52:13,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:52:13,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1425185077, now seen corresponding path program 2 times [2022-11-20 10:52:13,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:52:13,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371272300] [2022-11-20 10:52:13,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:13,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:52:13,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:13,747 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 10:52:13,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:52:13,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371272300] [2022-11-20 10:52:13,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371272300] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:52:13,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421844335] [2022-11-20 10:52:13,748 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:52:13,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:52:13,748 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:52:13,750 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:52:13,760 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 10:52:13,854 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 10:52:13,854 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:52:13,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-20 10:52:13,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:52:14,211 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 10:52:14,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:52:14,617 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 10:52:14,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421844335] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:52:14,618 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:52:14,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 43 [2022-11-20 10:52:14,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464571555] [2022-11-20 10:52:14,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:52:14,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-20 10:52:14,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:52:14,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-20 10:52:14,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=787, Invalid=1019, Unknown=0, NotChecked=0, Total=1806 [2022-11-20 10:52:14,621 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand has 43 states, 43 states have (on average 2.883720930232558) internal successors, (124), 43 states have internal predecessors, (124), 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) [2022-11-20 10:52:15,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:52:15,409 INFO L93 Difference]: Finished difference Result 223 states and 224 transitions. [2022-11-20 10:52:15,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-20 10:52:15,411 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.883720930232558) internal successors, (124), 43 states have internal predecessors, (124), 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 47 [2022-11-20 10:52:15,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:52:15,412 INFO L225 Difference]: With dead ends: 223 [2022-11-20 10:52:15,413 INFO L226 Difference]: Without dead ends: 223 [2022-11-20 10:52:15,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1037 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1190, Invalid=1890, Unknown=0, NotChecked=0, Total=3080 [2022-11-20 10:52:15,416 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 716 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 10:52:15,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 49 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 10:52:15,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-11-20 10:52:15,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 128. [2022-11-20 10:52:15,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 126 states have (on average 1.1111111111111112) internal successors, (140), 127 states have internal predecessors, (140), 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) [2022-11-20 10:52:15,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 140 transitions. [2022-11-20 10:52:15,422 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 140 transitions. Word has length 47 [2022-11-20 10:52:15,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:52:15,423 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 140 transitions. [2022-11-20 10:52:15,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.883720930232558) internal successors, (124), 43 states have internal predecessors, (124), 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) [2022-11-20 10:52:15,423 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 140 transitions. [2022-11-20 10:52:15,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-20 10:52:15,432 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:52:15,433 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:52:15,447 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-20 10:52:15,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:52:15,640 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-20 10:52:15,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:52:15,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1050815861, now seen corresponding path program 3 times [2022-11-20 10:52:15,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:52:15,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708744152] [2022-11-20 10:52:15,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:15,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:52:15,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:16,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1003 backedges. 0 proven. 1001 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 10:52:16,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:52:16,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708744152] [2022-11-20 10:52:16,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708744152] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:52:16,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68510089] [2022-11-20 10:52:16,732 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 10:52:16,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:52:16,732 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:52:16,733 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:52:16,757 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 10:52:16,857 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 10:52:16,858 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:52:16,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-20 10:52:16,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:52:16,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-20 10:52:16,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-20 10:52:19,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1003 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2022-11-20 10:52:19,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:52:20,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1003 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2022-11-20 10:52:20,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68510089] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:52:20,107 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:52:20,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 7, 7] total 42 [2022-11-20 10:52:20,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714304452] [2022-11-20 10:52:20,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:52:20,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-20 10:52:20,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:52:20,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-20 10:52:20,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=518, Invalid=1204, Unknown=0, NotChecked=0, Total=1722 [2022-11-20 10:52:20,110 INFO L87 Difference]: Start difference. First operand 128 states and 140 transitions. Second operand has 42 states, 42 states have (on average 2.8095238095238093) internal successors, (118), 42 states have internal predecessors, (118), 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) [2022-11-20 10:52:25,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:52:25,502 INFO L93 Difference]: Finished difference Result 131 states and 141 transitions. [2022-11-20 10:52:25,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2022-11-20 10:52:25,503 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.8095238095238093) internal successors, (118), 42 states have internal predecessors, (118), 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 89 [2022-11-20 10:52:25,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:52:25,503 INFO L225 Difference]: With dead ends: 131 [2022-11-20 10:52:25,504 INFO L226 Difference]: Without dead ends: 131 [2022-11-20 10:52:25,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4323 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=4457, Invalid=10549, Unknown=0, NotChecked=0, Total=15006 [2022-11-20 10:52:25,509 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 86 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:52:25,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 28 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 80 Invalid, 0 Unknown, 50 Unchecked, 0.1s Time] [2022-11-20 10:52:25,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-11-20 10:52:25,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2022-11-20 10:52:25,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 129 states have (on average 1.0930232558139534) internal successors, (141), 130 states have internal predecessors, (141), 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) [2022-11-20 10:52:25,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 141 transitions. [2022-11-20 10:52:25,513 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 141 transitions. Word has length 89 [2022-11-20 10:52:25,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:52:25,514 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 141 transitions. [2022-11-20 10:52:25,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.8095238095238093) internal successors, (118), 42 states have internal predecessors, (118), 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) [2022-11-20 10:52:25,514 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 141 transitions. [2022-11-20 10:52:25,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-11-20 10:52:25,516 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:52:25,516 INFO L195 NwaCegarLoop]: trace histogram [27, 27, 27, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:52:25,526 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-20 10:52:25,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:52:25,727 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-20 10:52:25,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:52:25,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1593650031, now seen corresponding path program 4 times [2022-11-20 10:52:25,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:52:25,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533033718] [2022-11-20 10:52:25,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:25,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:52:25,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:26,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1095 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-20 10:52:26,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:52:26,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533033718] [2022-11-20 10:52:26,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533033718] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:52:26,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775623276] [2022-11-20 10:52:26,891 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 10:52:26,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:52:26,892 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:52:26,894 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:52:26,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 10:52:28,141 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 10:52:28,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:52:28,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-20 10:52:28,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:52:29,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1095 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-20 10:52:29,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:52:30,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1095 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-20 10:52:30,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775623276] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:52:30,720 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:52:30,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 88 [2022-11-20 10:52:30,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93760636] [2022-11-20 10:52:30,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:52:30,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2022-11-20 10:52:30,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:52:30,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2022-11-20 10:52:30,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3367, Invalid=4289, Unknown=0, NotChecked=0, Total=7656 [2022-11-20 10:52:30,728 INFO L87 Difference]: Start difference. First operand 131 states and 141 transitions. Second operand has 88 states, 88 states have (on average 2.9431818181818183) internal successors, (259), 88 states have internal predecessors, (259), 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) [2022-11-20 10:52:33,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:52:33,105 INFO L93 Difference]: Finished difference Result 476 states and 477 transitions. [2022-11-20 10:52:33,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-11-20 10:52:33,106 INFO L78 Accepts]: Start accepts. Automaton has has 88 states, 88 states have (on average 2.9431818181818183) internal successors, (259), 88 states have internal predecessors, (259), 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 98 [2022-11-20 10:52:33,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:52:33,108 INFO L225 Difference]: With dead ends: 476 [2022-11-20 10:52:33,108 INFO L226 Difference]: Without dead ends: 476 [2022-11-20 10:52:33,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4757 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5075, Invalid=8265, Unknown=0, NotChecked=0, Total=13340 [2022-11-20 10:52:33,112 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 1385 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1385 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 10:52:33,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1385 Valid, 89 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-20 10:52:33,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2022-11-20 10:52:33,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 263. [2022-11-20 10:52:33,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 261 states have (on average 1.103448275862069) internal successors, (288), 262 states have internal predecessors, (288), 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) [2022-11-20 10:52:33,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 288 transitions. [2022-11-20 10:52:33,119 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 288 transitions. Word has length 98 [2022-11-20 10:52:33,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:52:33,119 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 288 transitions. [2022-11-20 10:52:33,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 88 states, 88 states have (on average 2.9431818181818183) internal successors, (259), 88 states have internal predecessors, (259), 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) [2022-11-20 10:52:33,120 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 288 transitions. [2022-11-20 10:52:33,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-11-20 10:52:33,122 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:52:33,122 INFO L195 NwaCegarLoop]: trace histogram [56, 56, 56, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:52:33,136 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-20 10:52:33,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:52:33,330 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-20 10:52:33,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:52:33,330 INFO L85 PathProgramCache]: Analyzing trace with hash 597463893, now seen corresponding path program 5 times [2022-11-20 10:52:33,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:52:33,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307578015] [2022-11-20 10:52:33,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:33,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:52:33,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:36,741 INFO L134 CoverageAnalysis]: Checked inductivity of 4691 backedges. 0 proven. 4676 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-20 10:52:36,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:52:36,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307578015] [2022-11-20 10:52:36,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307578015] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:52:36,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125936432] [2022-11-20 10:52:36,742 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-20 10:52:36,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:52:36,743 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:52:36,751 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:52:36,753 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-20 10:55:29,508 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 57 check-sat command(s) [2022-11-20 10:55:29,508 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:55:29,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 726 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-20 10:55:29,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:55:32,027 INFO L134 CoverageAnalysis]: Checked inductivity of 4691 backedges. 0 proven. 4676 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-20 10:55:32,027 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:55:36,764 INFO L134 CoverageAnalysis]: Checked inductivity of 4691 backedges. 0 proven. 4676 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-20 10:55:36,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125936432] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:55:36,764 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:55:36,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 175 [2022-11-20 10:55:36,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710827216] [2022-11-20 10:55:36,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:55:36,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 175 states [2022-11-20 10:55:36,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:55:36,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 175 interpolants. [2022-11-20 10:55:36,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13459, Invalid=16991, Unknown=0, NotChecked=0, Total=30450 [2022-11-20 10:55:36,774 INFO L87 Difference]: Start difference. First operand 263 states and 288 transitions. Second operand has 175 states, 175 states have (on average 2.9714285714285715) internal successors, (520), 175 states have internal predecessors, (520), 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) [2022-11-20 10:55:45,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:55:45,991 INFO L93 Difference]: Finished difference Result 969 states and 970 transitions. [2022-11-20 10:55:45,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2022-11-20 10:55:45,992 INFO L78 Accepts]: Start accepts. Automaton has has 175 states, 175 states have (on average 2.9714285714285715) internal successors, (520), 175 states have internal predecessors, (520), 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 185 [2022-11-20 10:55:45,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:55:45,996 INFO L225 Difference]: With dead ends: 969 [2022-11-20 10:55:45,997 INFO L226 Difference]: Without dead ends: 969 [2022-11-20 10:55:46,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19605 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=20242, Invalid=33350, Unknown=0, NotChecked=0, Total=53592 [2022-11-20 10:55:46,003 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 4692 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 1048 mSolverCounterSat, 926 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4692 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 1974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 926 IncrementalHoareTripleChecker+Valid, 1048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-20 10:55:46,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4692 Valid, 138 Invalid, 1974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [926 Valid, 1048 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-20 10:55:46,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2022-11-20 10:55:46,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 524. [2022-11-20 10:55:46,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 522 states have (on average 1.10727969348659) internal successors, (578), 523 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) [2022-11-20 10:55:46,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 578 transitions. [2022-11-20 10:55:46,019 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 578 transitions. Word has length 185 [2022-11-20 10:55:46,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:55:46,019 INFO L495 AbstractCegarLoop]: Abstraction has 524 states and 578 transitions. [2022-11-20 10:55:46,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 175 states, 175 states have (on average 2.9714285714285715) internal successors, (520), 175 states have internal predecessors, (520), 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) [2022-11-20 10:55:46,020 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 578 transitions. [2022-11-20 10:55:46,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2022-11-20 10:55:46,026 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:55:46,026 INFO L195 NwaCegarLoop]: trace histogram [114, 114, 114, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:55:46,054 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-20 10:55:46,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-20 10:55:46,247 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-20 10:55:46,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:46,247 INFO L85 PathProgramCache]: Analyzing trace with hash 812449301, now seen corresponding path program 6 times [2022-11-20 10:55:46,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:46,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348210593] [2022-11-20 10:55:46,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:46,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:46,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:59,027 INFO L134 CoverageAnalysis]: Checked inductivity of 19452 backedges. 0 proven. 19437 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-20 10:55:59,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:55:59,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348210593] [2022-11-20 10:55:59,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348210593] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:55:59,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652360568] [2022-11-20 10:55:59,031 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-20 10:55:59,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:55:59,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:55:59,032 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:55:59,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-20 10:55:59,236 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-11-20 10:55:59,236 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:55:59,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-20 10:55:59,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:55:59,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-20 10:55:59,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-20 10:56:08,607 INFO L134 CoverageAnalysis]: Checked inductivity of 19452 backedges. 8 proven. 227 refuted. 0 times theorem prover too weak. 19217 trivial. 0 not checked. [2022-11-20 10:56:08,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:56:12,806 INFO L134 CoverageAnalysis]: Checked inductivity of 19452 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 19217 trivial. 0 not checked. [2022-11-20 10:56:12,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652360568] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:56:12,806 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:56:12,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [118, 8, 8] total 132 [2022-11-20 10:56:12,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063779278] [2022-11-20 10:56:12,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:56:12,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 132 states [2022-11-20 10:56:12,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:56:12,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2022-11-20 10:56:12,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7090, Invalid=10202, Unknown=0, NotChecked=0, Total=17292 [2022-11-20 10:56:12,814 INFO L87 Difference]: Start difference. First operand 524 states and 578 transitions. Second operand has 132 states, 132 states have (on average 2.9242424242424243) internal successors, (386), 132 states have internal predecessors, (386), 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) [2022-11-20 10:57:12,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:57:12,902 INFO L93 Difference]: Finished difference Result 526 states and 527 transitions. [2022-11-20 10:57:12,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 352 states. [2022-11-20 10:57:12,903 INFO L78 Accepts]: Start accepts. Automaton has has 132 states, 132 states have (on average 2.9242424242424243) internal successors, (386), 132 states have internal predecessors, (386), 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 359 [2022-11-20 10:57:12,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:57:12,905 INFO L225 Difference]: With dead ends: 526 [2022-11-20 10:57:12,905 INFO L226 Difference]: Without dead ends: 526 [2022-11-20 10:57:12,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1179 GetRequests, 704 SyntacticMatches, 0 SemanticMatches, 475 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74834 ImplicationChecksByTransitivity, 65.4s TimeCoverageRelationStatistics Valid=69078, Invalid=157974, Unknown=0, NotChecked=0, Total=227052 [2022-11-20 10:57:12,917 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 170 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:57:12,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 37 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 162 Invalid, 0 Unknown, 40 Unchecked, 0.3s Time] [2022-11-20 10:57:12,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2022-11-20 10:57:12,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2022-11-20 10:57:12,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 525 states have (on average 1.0038095238095237) internal successors, (527), 525 states have internal predecessors, (527), 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) [2022-11-20 10:57:12,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 527 transitions. [2022-11-20 10:57:12,928 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 527 transitions. Word has length 359 [2022-11-20 10:57:12,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:57:12,929 INFO L495 AbstractCegarLoop]: Abstraction has 526 states and 527 transitions. [2022-11-20 10:57:12,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 132 states, 132 states have (on average 2.9242424242424243) internal successors, (386), 132 states have internal predecessors, (386), 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) [2022-11-20 10:57:12,930 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 527 transitions. [2022-11-20 10:57:12,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 526 [2022-11-20 10:57:12,941 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:57:12,941 INFO L195 NwaCegarLoop]: trace histogram [115, 115, 115, 57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:57:12,951 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-20 10:57:13,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-20 10:57:13,147 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-20 10:57:13,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:57:13,147 INFO L85 PathProgramCache]: Analyzing trace with hash 570210676, now seen corresponding path program 1 times [2022-11-20 10:57:13,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:57:13,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709280493] [2022-11-20 10:57:13,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:57:13,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:57:13,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:26,088 INFO L134 CoverageAnalysis]: Checked inductivity of 24625 backedges. 0 proven. 19780 refuted. 0 times theorem prover too weak. 4845 trivial. 0 not checked. [2022-11-20 10:57:26,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:57:26,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709280493] [2022-11-20 10:57:26,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709280493] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:57:26,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326131316] [2022-11-20 10:57:26,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:57:26,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:57:26,089 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:57:26,095 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:57:26,123 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-20 10:57:26,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:26,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 1970 conjuncts, 118 conjunts are in the unsatisfiable core [2022-11-20 10:57:26,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:57:34,923 INFO L134 CoverageAnalysis]: Checked inductivity of 24625 backedges. 0 proven. 19780 refuted. 0 times theorem prover too weak. 4845 trivial. 0 not checked. [2022-11-20 10:57:34,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:57:43,150 INFO L134 CoverageAnalysis]: Checked inductivity of 24625 backedges. 0 proven. 19780 refuted. 0 times theorem prover too weak. 4845 trivial. 0 not checked. [2022-11-20 10:57:43,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326131316] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:57:43,151 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:57:43,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [119, 119, 119] total 248 [2022-11-20 10:57:43,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007013761] [2022-11-20 10:57:43,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:57:43,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 248 states [2022-11-20 10:57:43,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:57:43,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 248 interpolants. [2022-11-20 10:57:43,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23819, Invalid=37437, Unknown=0, NotChecked=0, Total=61256 [2022-11-20 10:57:43,162 INFO L87 Difference]: Start difference. First operand 526 states and 527 transitions. Second operand has 248 states, 248 states have (on average 3.0) internal successors, (744), 248 states have internal predecessors, (744), 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) [2022-11-20 10:57:53,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:57:53,271 INFO L93 Difference]: Finished difference Result 808 states and 809 transitions. [2022-11-20 10:57:53,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2022-11-20 10:57:53,272 INFO L78 Accepts]: Start accepts. Automaton has has 248 states, 248 states have (on average 3.0) internal successors, (744), 248 states have internal predecessors, (744), 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 525 [2022-11-20 10:57:53,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:57:53,276 INFO L225 Difference]: With dead ends: 808 [2022-11-20 10:57:53,276 INFO L226 Difference]: Without dead ends: 808 [2022-11-20 10:57:53,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1179 GetRequests, 817 SyntacticMatches, 104 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56837 ImplicationChecksByTransitivity, 22.3s TimeCoverageRelationStatistics Valid=25415, Invalid=41925, Unknown=0, NotChecked=0, Total=67340 [2022-11-20 10:57:53,281 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 2891 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 1156 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2891 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 2032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 1156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-20 10:57:53,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2891 Valid, 53 Invalid, 2032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 1156 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-20 10:57:53,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2022-11-20 10:57:53,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 742. [2022-11-20 10:57:53,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 741 states have (on average 1.0026990553306343) internal successors, (743), 741 states have internal predecessors, (743), 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) [2022-11-20 10:57:53,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 743 transitions. [2022-11-20 10:57:53,296 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 743 transitions. Word has length 525 [2022-11-20 10:57:53,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:57:53,297 INFO L495 AbstractCegarLoop]: Abstraction has 742 states and 743 transitions. [2022-11-20 10:57:53,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 248 states, 248 states have (on average 3.0) internal successors, (744), 248 states have internal predecessors, (744), 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) [2022-11-20 10:57:53,298 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 743 transitions. [2022-11-20 10:57:53,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 742 [2022-11-20 10:57:53,321 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:57:53,322 INFO L195 NwaCegarLoop]: trace histogram [128, 128, 128, 116, 116, 116, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:57:53,334 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-20 10:57:53,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-20 10:57:53,534 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-20 10:57:53,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:57:53,535 INFO L85 PathProgramCache]: Analyzing trace with hash 917498639, now seen corresponding path program 2 times [2022-11-20 10:57:53,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:57:53,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463796800] [2022-11-20 10:57:53,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:57:53,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:57:54,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:58:07,130 INFO L134 CoverageAnalysis]: Checked inductivity of 44638 backedges. 0 proven. 20126 refuted. 0 times theorem prover too weak. 24512 trivial. 0 not checked. [2022-11-20 10:58:07,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:58:07,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463796800] [2022-11-20 10:58:07,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463796800] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:58:07,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795791334] [2022-11-20 10:58:07,131 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:58:07,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:58:07,131 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:58:07,132 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:58:07,134 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-20 10:58:07,816 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 10:58:07,816 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:58:07,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 2762 conjuncts, 118 conjunts are in the unsatisfiable core [2022-11-20 10:58:07,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:58:08,397 INFO L134 CoverageAnalysis]: Checked inductivity of 44638 backedges. 0 proven. 20126 refuted. 0 times theorem prover too weak. 24512 trivial. 0 not checked. [2022-11-20 10:58:08,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:58:15,510 INFO L134 CoverageAnalysis]: Checked inductivity of 44638 backedges. 0 proven. 20126 refuted. 0 times theorem prover too weak. 24512 trivial. 0 not checked. [2022-11-20 10:58:15,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795791334] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:58:15,511 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:58:15,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [119, 119, 119] total 130 [2022-11-20 10:58:15,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799838414] [2022-11-20 10:58:15,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:58:15,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 130 states [2022-11-20 10:58:15,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:58:15,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2022-11-20 10:58:15,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2022-11-20 10:58:15,518 INFO L87 Difference]: Start difference. First operand 742 states and 743 transitions. Second operand has 130 states, 130 states have (on average 3.046153846153846) internal successors, (396), 130 states have internal predecessors, (396), 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) [2022-11-20 10:58:19,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:58:19,374 INFO L93 Difference]: Finished difference Result 775 states and 776 transitions. [2022-11-20 10:58:19,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2022-11-20 10:58:19,375 INFO L78 Accepts]: Start accepts. Automaton has has 130 states, 130 states have (on average 3.046153846153846) internal successors, (396), 130 states have internal predecessors, (396), 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 741 [2022-11-20 10:58:19,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:58:19,379 INFO L225 Difference]: With dead ends: 775 [2022-11-20 10:58:19,380 INFO L226 Difference]: Without dead ends: 775 [2022-11-20 10:58:19,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1599 GetRequests, 1364 SyntacticMatches, 107 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7205 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2022-11-20 10:58:19,381 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 1344 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1344 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 1326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 550 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:58:19,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1344 Valid, 34 Invalid, 1326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [550 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-20 10:58:19,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2022-11-20 10:58:19,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 775. [2022-11-20 10:58:19,397 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) [2022-11-20 10:58:19,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 776 transitions. [2022-11-20 10:58:19,400 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 776 transitions. Word has length 741 [2022-11-20 10:58:19,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:58:19,402 INFO L495 AbstractCegarLoop]: Abstraction has 775 states and 776 transitions. [2022-11-20 10:58:19,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 130 states, 130 states have (on average 3.046153846153846) internal successors, (396), 130 states have internal predecessors, (396), 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) [2022-11-20 10:58:19,402 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 776 transitions. [2022-11-20 10:58:19,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 775 [2022-11-20 10:58:19,408 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:58:19,409 INFO L195 NwaCegarLoop]: trace histogram [128, 128, 128, 127, 127, 127, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:58:19,417 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-20 10:58:19,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:58:19,615 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-20 10:58:19,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:58:19,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1306820846, now seen corresponding path program 3 times [2022-11-20 10:58:19,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:58:19,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858812793] [2022-11-20 10:58:19,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:58:19,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:58:20,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:58:20,253 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:58:20,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:58:21,089 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:58:21,089 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 10:58:21,090 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 21 remaining) [2022-11-20 10:58:21,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 21 remaining) [2022-11-20 10:58:21,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 21 remaining) [2022-11-20 10:58:21,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 21 remaining) [2022-11-20 10:58:21,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 21 remaining) [2022-11-20 10:58:21,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 21 remaining) [2022-11-20 10:58:21,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 21 remaining) [2022-11-20 10:58:21,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 21 remaining) [2022-11-20 10:58:21,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE (12 of 21 remaining) [2022-11-20 10:58:21,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE (11 of 21 remaining) [2022-11-20 10:58:21,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE (10 of 21 remaining) [2022-11-20 10:58:21,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE (9 of 21 remaining) [2022-11-20 10:58:21,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE (8 of 21 remaining) [2022-11-20 10:58:21,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE (7 of 21 remaining) [2022-11-20 10:58:21,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE (6 of 21 remaining) [2022-11-20 10:58:21,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE (5 of 21 remaining) [2022-11-20 10:58:21,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (4 of 21 remaining) [2022-11-20 10:58:21,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (3 of 21 remaining) [2022-11-20 10:58:21,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (2 of 21 remaining) [2022-11-20 10:58:21,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE (1 of 21 remaining) [2022-11-20 10:58:21,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK (0 of 21 remaining) [2022-11-20 10:58:21,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-20 10:58:21,103 INFO L444 BasicCegarLoop]: Path program histogram: [6, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2022-11-20 10:58:21,111 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 10:58:21,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 10:58:21 BoogieIcfgContainer [2022-11-20 10:58:21,405 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 10:58:21,406 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 10:58:21,406 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 10:58:21,406 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 10:58:21,407 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:52:01" (3/4) ... [2022-11-20 10:58:21,409 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-20 10:58:21,668 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 10:58:21,669 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 10:58:21,670 INFO L158 Benchmark]: Toolchain (without parser) took 380857.45ms. Allocated memory was 167.8MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 120.8MB in the beginning and 903.3MB in the end (delta: -782.5MB). Peak memory consumption was 743.1MB. Max. memory is 16.1GB. [2022-11-20 10:58:21,670 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 138.4MB. Free memory is still 82.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:58:21,670 INFO L158 Benchmark]: CACSL2BoogieTranslator took 560.03ms. Allocated memory is still 167.8MB. Free memory was 120.4MB in the beginning and 104.2MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-20 10:58:21,672 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.44ms. Allocated memory is still 167.8MB. Free memory was 104.2MB in the beginning and 102.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:58:21,672 INFO L158 Benchmark]: Boogie Preprocessor took 55.09ms. Allocated memory is still 167.8MB. Free memory was 102.5MB in the beginning and 100.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:58:21,674 INFO L158 Benchmark]: RCFGBuilder took 418.45ms. Allocated memory is still 167.8MB. Free memory was 100.8MB in the beginning and 135.3MB in the end (delta: -34.5MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. [2022-11-20 10:58:21,675 INFO L158 Benchmark]: TraceAbstraction took 379480.75ms. Allocated memory was 167.8MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 134.3MB in the beginning and 937.9MB in the end (delta: -803.6MB). Peak memory consumption was 722.0MB. Max. memory is 16.1GB. [2022-11-20 10:58:21,678 INFO L158 Benchmark]: Witness Printer took 263.38ms. Allocated memory is still 1.7GB. Free memory was 937.9MB in the beginning and 903.3MB in the end (delta: 34.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2022-11-20 10:58:21,679 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.29ms. Allocated memory is still 138.4MB. Free memory is still 82.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 560.03ms. Allocated memory is still 167.8MB. Free memory was 120.4MB in the beginning and 104.2MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.44ms. Allocated memory is still 167.8MB. Free memory was 104.2MB in the beginning and 102.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.09ms. Allocated memory is still 167.8MB. Free memory was 102.5MB in the beginning and 100.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 418.45ms. Allocated memory is still 167.8MB. Free memory was 100.8MB in the beginning and 135.3MB in the end (delta: -34.5MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. * TraceAbstraction took 379480.75ms. Allocated memory was 167.8MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 134.3MB in the beginning and 937.9MB in the end (delta: -803.6MB). Peak memory consumption was 722.0MB. Max. memory is 16.1GB. * Witness Printer took 263.38ms. Allocated memory is still 1.7GB. Free memory was 937.9MB in the beginning and 903.3MB in the end (delta: 34.6MB). Peak memory consumption was 33.6MB. 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: -1]: 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: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: 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: 379.1s, OverallIterations: 20, TraceHistogramMax: 128, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.1s, AutomataDifference: 95.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12590 SdHoareTripleChecker+Valid, 7.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12590 mSDsluCounter, 1288 SdHoareTripleChecker+Invalid, 6.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 90 IncrementalHoareTripleChecker+Unchecked, 916 mSDsCounter, 2977 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6289 IncrementalHoareTripleChecker+Invalid, 9356 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2977 mSolverCounterUnsat, 372 mSDtfsCounter, 6289 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5418 GetRequests, 3686 SyntacticMatches, 211 SemanticMatches, 1521 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169288 ImplicationChecksByTransitivity, 125.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=775occurred in iteration=19, InterpolantAutomatonStates: 991, 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, 19 MinimizatonAttempts, 876 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 176.1s SatisfiabilityAnalysisTime, 100.7s InterpolantComputationTime, 5133 NumberOfCodeBlocks, 4677 NumberOfCodeBlocksAsserted, 97 NumberOfCheckSat, 6456 ConstructedInterpolants, 22 QuantifiedInterpolants, 46882 SizeOfPredicates, 47 NumberOfNonLiveVariables, 6879 ConjunctsInSsa, 457 ConjunctsInUnsatCore, 44 InterpolantComputations, 7 PerfectInterpolantSequences, 128826/287817 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! [2022-11-20 10:58:21,779 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d662f8dc-7d07-4efb-ae58-60c8630ad19c/bin/uautomizer-ug76WZFUDN/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)