./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext-properties/test-0019_1_false-valid-memtrack_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c15ccffb-b444-4f6f-98f4-082b7bbf5a4b/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c15ccffb-b444-4f6f-98f4-082b7bbf5a4b/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c15ccffb-b444-4f6f-98f4-082b7bbf5a4b/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c15ccffb-b444-4f6f-98f4-082b7bbf5a4b/bin-2019/ukojak/config/KojakMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/test-0019_1_false-valid-memtrack_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c15ccffb-b444-4f6f-98f4-082b7bbf5a4b/bin-2019/ukojak/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c15ccffb-b444-4f6f-98f4-082b7bbf5a4b/bin-2019/ukojak --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 Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 26e51b3bd14b76ecee3437e51ca1d0aadbe3cb6b ......................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c15ccffb-b444-4f6f-98f4-082b7bbf5a4b/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c15ccffb-b444-4f6f-98f4-082b7bbf5a4b/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c15ccffb-b444-4f6f-98f4-082b7bbf5a4b/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c15ccffb-b444-4f6f-98f4-082b7bbf5a4b/bin-2019/ukojak/config/KojakMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/test-0019_1_false-valid-memtrack_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c15ccffb-b444-4f6f-98f4-082b7bbf5a4b/bin-2019/ukojak/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c15ccffb-b444-4f6f-98f4-082b7bbf5a4b/bin-2019/ukojak --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 Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 26e51b3bd14b76ecee3437e51ca1d0aadbe3cb6b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 12:42:27,751 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 12:42:27,752 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 12:42:27,758 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 12:42:27,758 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 12:42:27,758 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 12:42:27,759 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 12:42:27,761 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 12:42:27,762 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 12:42:27,762 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 12:42:27,763 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 12:42:27,763 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 12:42:27,764 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 12:42:27,765 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 12:42:27,766 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 12:42:27,766 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 12:42:27,767 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 12:42:27,768 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 12:42:27,769 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 12:42:27,771 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 12:42:27,771 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 12:42:27,772 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 12:42:27,774 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 12:42:27,774 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 12:42:27,774 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 12:42:27,775 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 12:42:27,775 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 12:42:27,776 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 12:42:27,776 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 12:42:27,777 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 12:42:27,777 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 12:42:27,778 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 12:42:27,778 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 12:42:27,778 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 12:42:27,779 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 12:42:27,779 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 12:42:27,780 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c15ccffb-b444-4f6f-98f4-082b7bbf5a4b/bin-2019/ukojak/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Default.epf [2018-12-08 12:42:27,790 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 12:42:27,790 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 12:42:27,791 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 12:42:27,791 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 12:42:27,791 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 12:42:27,791 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 12:42:27,792 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 12:42:27,792 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 12:42:27,792 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 12:42:27,792 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 12:42:27,792 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-08 12:42:27,792 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-08 12:42:27,792 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-08 12:42:27,792 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 12:42:27,793 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 12:42:27,793 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 12:42:27,793 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-12-08 12:42:27,793 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-12-08 12:42:27,793 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 12:42:27,793 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 12:42:27,793 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-08 12:42:27,794 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 12:42:27,794 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 12:42:27,794 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-12-08 12:42:27,794 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 12:42:27,794 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in 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-vcloud-master/worker/working_dir_c15ccffb-b444-4f6f-98f4-082b7bbf5a4b/bin-2019/ukojak 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 -> Kojak 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 -> 26e51b3bd14b76ecee3437e51ca1d0aadbe3cb6b [2018-12-08 12:42:27,819 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 12:42:27,828 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 12:42:27,830 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 12:42:27,831 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 12:42:27,832 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 12:42:27,832 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c15ccffb-b444-4f6f-98f4-082b7bbf5a4b/bin-2019/ukojak/../../sv-benchmarks/c/list-ext-properties/test-0019_1_false-valid-memtrack_true-termination.i [2018-12-08 12:42:27,875 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c15ccffb-b444-4f6f-98f4-082b7bbf5a4b/bin-2019/ukojak/data/617b9f1a5/9779f99fe23b44afbb485a5e5cad5864/FLAGace2bd72e [2018-12-08 12:42:28,317 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 12:42:28,318 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c15ccffb-b444-4f6f-98f4-082b7bbf5a4b/sv-benchmarks/c/list-ext-properties/test-0019_1_false-valid-memtrack_true-termination.i [2018-12-08 12:42:28,324 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c15ccffb-b444-4f6f-98f4-082b7bbf5a4b/bin-2019/ukojak/data/617b9f1a5/9779f99fe23b44afbb485a5e5cad5864/FLAGace2bd72e [2018-12-08 12:42:28,331 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c15ccffb-b444-4f6f-98f4-082b7bbf5a4b/bin-2019/ukojak/data/617b9f1a5/9779f99fe23b44afbb485a5e5cad5864 [2018-12-08 12:42:28,333 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 12:42:28,334 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 12:42:28,335 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 12:42:28,335 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 12:42:28,337 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 12:42:28,337 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 12:42:28" (1/1) ... [2018-12-08 12:42:28,339 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ceaa519 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:42:28, skipping insertion in model container [2018-12-08 12:42:28,339 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 12:42:28" (1/1) ... [2018-12-08 12:42:28,343 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 12:42:28,360 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 12:42:28,495 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 12:42:28,502 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 12:42:28,559 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 12:42:28,580 INFO L195 MainTranslator]: Completed translation [2018-12-08 12:42:28,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:42:28 WrapperNode [2018-12-08 12:42:28,581 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 12:42:28,581 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 12:42:28,581 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 12:42:28,581 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 12:42:28,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:42:28" (1/1) ... [2018-12-08 12:42:28,595 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:42:28" (1/1) ... [2018-12-08 12:42:28,607 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 12:42:28,608 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 12:42:28,608 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 12:42:28,608 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 12:42:28,613 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:42:28" (1/1) ... [2018-12-08 12:42:28,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:42:28" (1/1) ... [2018-12-08 12:42:28,615 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:42:28" (1/1) ... [2018-12-08 12:42:28,615 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:42:28" (1/1) ... [2018-12-08 12:42:28,618 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:42:28" (1/1) ... [2018-12-08 12:42:28,620 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:42:28" (1/1) ... [2018-12-08 12:42:28,620 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:42:28" (1/1) ... [2018-12-08 12:42:28,622 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 12:42:28,622 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 12:42:28,622 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 12:42:28,622 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 12:42:28,623 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:42:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c15ccffb-b444-4f6f-98f4-082b7bbf5a4b/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-08 12:42:28,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 12:42:28,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 12:42:28,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 12:42:28,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-08 12:42:28,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-08 12:42:28,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 12:42:28,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 12:42:28,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 12:42:28,887 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 12:42:28,887 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-08 12:42:28,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 12:42:28 BoogieIcfgContainer [2018-12-08 12:42:28,888 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 12:42:28,888 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-12-08 12:42:28,888 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-12-08 12:42:28,896 INFO L276 PluginConnector]: CodeCheck initialized [2018-12-08 12:42:28,896 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 12:42:28" (1/1) ... [2018-12-08 12:42:28,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:42:28,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:42:28,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-12-08 12:42:28,927 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-12-08 12:42:28,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-12-08 12:42:28,928 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:42:28,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:42:29,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:42:29,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:42:29,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-12-08 12:42:29,036 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-12-08 12:42:29,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-12-08 12:42:29,036 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:42:29,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:42:29,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:42:29,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:42:29,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-12-08 12:42:29,115 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-12-08 12:42:29,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-08 12:42:29,115 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:42:29,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:42:29,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:42:29,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:42:29,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-12-08 12:42:29,145 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-12-08 12:42:29,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-08 12:42:29,145 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:42:29,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:42:29,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:42:29,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:42:29,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-12-08 12:42:29,260 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-12-08 12:42:29,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-08 12:42:29,260 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:42:29,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:42:29,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:42:29,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:42:29,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-12-08 12:42:29,281 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-12-08 12:42:29,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-08 12:42:29,282 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:42:29,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:42:29,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:42:29,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:42:29,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-12-08 12:42:29,417 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-12-08 12:42:29,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-08 12:42:29,417 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:42:29,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:42:29,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:42:29,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:42:29,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-12-08 12:42:29,768 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-12-08 12:42:29,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-08 12:42:29,768 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:42:29,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:42:29,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:42:30,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:42:30,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-12-08 12:42:30,746 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-12-08 12:42:30,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-08 12:42:30,747 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:42:30,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:42:30,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:42:30,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:42:30,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-12-08 12:42:30,853 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-12-08 12:42:30,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-08 12:42:30,853 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:42:30,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:42:30,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:42:31,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:42:31,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-12-08 12:42:31,138 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-12-08 12:42:31,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-08 12:42:31,139 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:42:31,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:42:31,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:42:32,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:42:32,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-12-08 12:42:32,469 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-12-08 12:42:32,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-08 12:42:32,470 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:42:32,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:42:32,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:42:34,142 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2018-12-08 12:42:35,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:42:35,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-12-08 12:42:35,606 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-12-08 12:42:35,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-08 12:42:35,606 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:42:35,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:42:35,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:42:38,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:42:38,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-12-08 12:42:38,339 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-12-08 12:42:38,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-08 12:42:38,339 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:42:38,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:42:38,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:42:42,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:42:42,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-12-08 12:42:42,765 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-12-08 12:42:42,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-08 12:42:42,765 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:42:42,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:42:42,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:42:42,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:42:42,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-12-08 12:42:42,805 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-12-08 12:42:42,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-08 12:42:42,805 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:42:42,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:42:42,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:42:42,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:42:42,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-12-08 12:42:42,992 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-12-08 12:42:42,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-08 12:42:42,992 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:42:42,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:42:43,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:42:48,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:42:48,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-12-08 12:42:48,457 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-12-08 12:42:48,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-08 12:42:48,458 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:42:48,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:42:50,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:42:53,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:42:53,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-12-08 12:42:53,794 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-12-08 12:42:53,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-08 12:42:53,794 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:42:53,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:42:56,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:43:00,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:43:00,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-12-08 12:43:00,733 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-12-08 12:43:00,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-08 12:43:00,733 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:43:00,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:43:01,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:43:06,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:43:06,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-12-08 12:43:06,765 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-12-08 12:43:06,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-08 12:43:06,765 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:43:06,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:43:06,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:43:08,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:43:08,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 30 states and 31 transitions. [2018-12-08 12:43:08,059 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-12-08 12:43:08,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-08 12:43:08,060 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:43:08,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:43:08,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:43:10,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:43:10,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 31 states and 32 transitions. [2018-12-08 12:43:10,660 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-12-08 12:43:10,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-08 12:43:10,660 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:43:10,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:43:12,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:43:16,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:43:16,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 30 states and 31 transitions. [2018-12-08 12:43:16,933 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-12-08 12:43:16,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-08 12:43:16,933 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:43:16,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:43:16,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:43:17,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:43:17,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 29 states and 30 transitions. [2018-12-08 12:43:17,001 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-12-08 12:43:17,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-08 12:43:17,001 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:43:17,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:43:17,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:43:20,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:43:20,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 31 states and 32 transitions. [2018-12-08 12:43:20,595 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-12-08 12:43:20,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-08 12:43:20,595 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:43:20,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:43:20,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:43:22,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:43:22,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 30 states and 31 transitions. [2018-12-08 12:43:22,212 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-12-08 12:43:22,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-08 12:43:22,212 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:43:22,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:43:22,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:43:22,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:43:22,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:43:22,313 WARN L497 CodeCheckObserver]: This program is UNSAFE, Check terminated with 27 iterations. [2018-12-08 12:43:22,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 08.12 12:43:22 ImpRootNode [2018-12-08 12:43:22,333 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-12-08 12:43:22,333 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 12:43:22,333 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 12:43:22,333 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 12:43:22,334 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 12:42:28" (3/4) ... [2018-12-08 12:43:22,336 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-08 12:43:22,336 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 12:43:22,337 INFO L168 Benchmark]: Toolchain (without parser) took 54003.16 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 373.3 MB). Free memory was 950.6 MB in the beginning and 1.3 GB in the end (delta: -387.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 12:43:22,337 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 12:43:22,337 INFO L168 Benchmark]: CACSL2BoogieTranslator took 246.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -166.9 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-12-08 12:43:22,338 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.14 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 12:43:22,338 INFO L168 Benchmark]: Boogie Preprocessor took 14.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 12:43:22,338 INFO L168 Benchmark]: RCFGBuilder took 265.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.9 MB). Peak memory consumption was 33.9 MB. Max. memory is 11.5 GB. [2018-12-08 12:43:22,338 INFO L168 Benchmark]: CodeCheck took 53444.59 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 239.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -254.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 12:43:22,339 INFO L168 Benchmark]: Witness Printer took 3.28 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 12:43:22,340 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 58 locations, 29 error locations. UNSAFE Result, 53.4s OverallTime, 27 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 352 SDtfs, 11439050 SDslu, 440 SDs, 0 SdLazy, 536820228 SolverSat, 277706750 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1794 GetRequests, 1302 SyntacticMatches, 48 SemanticMatches, 444 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88889 ImplicationChecksByTransitivity, 51.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 10.0s InterpolantComputationTime, 226 NumberOfCodeBlocks, 226 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 185 ConstructedInterpolants, 0 QuantifiedInterpolants, 17526 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - UnprovableResult [Line: 641]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 641. Possible FailurePath: [L642] TData data; [L625] pdata->lo = (int *)malloc(sizeof(int)) [L626] pdata->hi = (int *)malloc(sizeof(int)) [L627] EXPR pdata->lo [L627] *(pdata->lo) = 4 [L628] EXPR pdata->hi [L628] *(pdata->hi) = 8 [L632] EXPR data->lo [L632] int *lo = data->lo; [L633] EXPR data->hi [L633] int *hi = data->hi; [L634] EXPR \read(*lo) [L634] EXPR \read(*hi) [L634] COND FALSE !(*lo >= *hi) [L638] data->lo = ((void *)0) [L639] data->hi = ((void *)0) [L645] return 0; [L645] return 0; * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 246.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -166.9 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.14 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 265.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.9 MB). Peak memory consumption was 33.9 MB. Max. memory is 11.5 GB. * CodeCheck took 53444.59 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 239.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -254.8 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 3.28 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-08 12:43:23,583 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 12:43:23,584 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 12:43:23,590 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 12:43:23,591 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 12:43:23,591 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 12:43:23,592 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 12:43:23,592 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 12:43:23,593 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 12:43:23,594 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 12:43:23,594 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 12:43:23,594 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 12:43:23,595 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 12:43:23,595 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 12:43:23,596 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 12:43:23,596 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 12:43:23,596 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 12:43:23,597 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 12:43:23,598 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 12:43:23,599 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 12:43:23,599 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 12:43:23,600 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 12:43:23,601 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 12:43:23,601 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 12:43:23,601 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 12:43:23,602 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 12:43:23,602 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 12:43:23,603 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 12:43:23,603 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 12:43:23,604 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 12:43:23,604 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 12:43:23,604 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 12:43:23,604 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 12:43:23,605 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 12:43:23,605 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 12:43:23,605 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 12:43:23,606 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c15ccffb-b444-4f6f-98f4-082b7bbf5a4b/bin-2019/ukojak/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Bitvector.epf [2018-12-08 12:43:23,613 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 12:43:23,613 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 12:43:23,614 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 12:43:23,614 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 12:43:23,614 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 12:43:23,614 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 12:43:23,614 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 12:43:23,614 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 12:43:23,614 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 12:43:23,615 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 12:43:23,615 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-08 12:43:23,615 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-08 12:43:23,615 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-08 12:43:23,615 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 12:43:23,615 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-08 12:43:23,615 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-08 12:43:23,615 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 12:43:23,616 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 12:43:23,616 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-12-08 12:43:23,616 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-12-08 12:43:23,616 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 12:43:23,616 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 12:43:23,616 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-08 12:43:23,616 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 12:43:23,617 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 12:43:23,617 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-12-08 12:43:23,617 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-08 12:43:23,617 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 12:43:23,617 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-08 12:43:23,617 INFO L133 SettingsManager]: * Logic for external solver=AUFBV 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-vcloud-master/worker/working_dir_c15ccffb-b444-4f6f-98f4-082b7bbf5a4b/bin-2019/ukojak 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 -> Kojak 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 -> 26e51b3bd14b76ecee3437e51ca1d0aadbe3cb6b [2018-12-08 12:43:23,637 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 12:43:23,646 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 12:43:23,649 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 12:43:23,650 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 12:43:23,651 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 12:43:23,651 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c15ccffb-b444-4f6f-98f4-082b7bbf5a4b/bin-2019/ukojak/../../sv-benchmarks/c/list-ext-properties/test-0019_1_false-valid-memtrack_true-termination.i [2018-12-08 12:43:23,691 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c15ccffb-b444-4f6f-98f4-082b7bbf5a4b/bin-2019/ukojak/data/3ab9a95ec/8ef9ee728b974a52b6a3ff30f7f7db97/FLAGe90a4a929 [2018-12-08 12:43:24,139 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 12:43:24,139 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c15ccffb-b444-4f6f-98f4-082b7bbf5a4b/sv-benchmarks/c/list-ext-properties/test-0019_1_false-valid-memtrack_true-termination.i [2018-12-08 12:43:24,145 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c15ccffb-b444-4f6f-98f4-082b7bbf5a4b/bin-2019/ukojak/data/3ab9a95ec/8ef9ee728b974a52b6a3ff30f7f7db97/FLAGe90a4a929 [2018-12-08 12:43:24,153 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c15ccffb-b444-4f6f-98f4-082b7bbf5a4b/bin-2019/ukojak/data/3ab9a95ec/8ef9ee728b974a52b6a3ff30f7f7db97 [2018-12-08 12:43:24,155 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 12:43:24,155 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 12:43:24,156 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 12:43:24,156 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 12:43:24,158 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 12:43:24,158 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 12:43:24" (1/1) ... [2018-12-08 12:43:24,160 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cb0e1fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:43:24, skipping insertion in model container [2018-12-08 12:43:24,160 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 12:43:24" (1/1) ... [2018-12-08 12:43:24,164 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 12:43:24,182 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 12:43:24,329 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 12:43:24,338 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 12:43:24,364 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 12:43:24,389 INFO L195 MainTranslator]: Completed translation [2018-12-08 12:43:24,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:43:24 WrapperNode [2018-12-08 12:43:24,389 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 12:43:24,389 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 12:43:24,390 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 12:43:24,390 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 12:43:24,427 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:43:24" (1/1) ... [2018-12-08 12:43:24,438 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:43:24" (1/1) ... [2018-12-08 12:43:24,450 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 12:43:24,450 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 12:43:24,450 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 12:43:24,450 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 12:43:24,455 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:43:24" (1/1) ... [2018-12-08 12:43:24,455 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:43:24" (1/1) ... [2018-12-08 12:43:24,457 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:43:24" (1/1) ... [2018-12-08 12:43:24,457 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:43:24" (1/1) ... [2018-12-08 12:43:24,462 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:43:24" (1/1) ... [2018-12-08 12:43:24,463 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:43:24" (1/1) ... [2018-12-08 12:43:24,464 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:43:24" (1/1) ... [2018-12-08 12:43:24,465 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 12:43:24,466 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 12:43:24,466 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 12:43:24,466 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 12:43:24,466 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:43:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c15ccffb-b444-4f6f-98f4-082b7bbf5a4b/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-08 12:43:24,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 12:43:24,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-08 12:43:24,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-08 12:43:24,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-08 12:43:24,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 12:43:24,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-12-08 12:43:24,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 12:43:24,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 12:43:24,839 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 12:43:24,839 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-08 12:43:24,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 12:43:24 BoogieIcfgContainer [2018-12-08 12:43:24,840 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 12:43:24,840 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-12-08 12:43:24,840 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-12-08 12:43:24,846 INFO L276 PluginConnector]: CodeCheck initialized [2018-12-08 12:43:24,846 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 12:43:24" (1/1) ... [2018-12-08 12:43:24,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:43:24,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:43:24,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-12-08 12:43:24,875 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-12-08 12:43:24,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-12-08 12:43:24,877 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:43:24,909 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-08 12:43:24,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:43:24,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:43:24,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-12-08 12:43:24,987 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:43:24,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 36 [2018-12-08 12:43:24,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2018-12-08 12:43:25,000 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:25,023 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:43:25,026 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:43:25,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 34 [2018-12-08 12:43:25,040 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-08 12:43:25,067 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 12:43:25,089 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 12:43:25,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-08 12:43:25,117 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:24, output treesize:58 [2018-12-08 12:43:25,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:43:25,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:43:25,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-12-08 12:43:25,183 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-12-08 12:43:25,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-12-08 12:43:25,183 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:43:25,183 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-08 12:43:25,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:43:25,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:43:25,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-08 12:43:25,198 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:43:25,199 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:43:25,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-12-08 12:43:25,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:25,207 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:25,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-08 12:43:25,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-08 12:43:25,228 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:25,230 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:25,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 12:43:25,237 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:24, output treesize:14 [2018-12-08 12:43:25,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:43:25,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:43:25,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-12-08 12:43:25,376 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-12-08 12:43:25,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-08 12:43:25,376 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:43:25,377 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-08 12:43:25,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:43:25,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:43:25,393 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:43:25,394 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:43:25,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-08 12:43:25,395 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:25,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 12:43:25,402 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:16 [2018-12-08 12:43:25,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:43:25,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:43:25,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-12-08 12:43:25,471 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-12-08 12:43:25,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-08 12:43:25,471 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:43:25,472 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-08 12:43:25,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:43:25,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:43:25,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-08 12:43:25,496 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:43:25,498 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:43:25,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-12-08 12:43:25,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:25,507 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:25,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-08 12:43:25,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-08 12:43:25,523 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:25,525 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:25,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 12:43:25,530 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:24, output treesize:14 [2018-12-08 12:43:25,536 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:43:25,538 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:43:25,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-08 12:43:25,539 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:25,557 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:43:25,560 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:43:25,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 30 [2018-12-08 12:43:25,561 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:25,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 12:43:25,572 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:19 [2018-12-08 12:43:25,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:43:25,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:43:25,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-12-08 12:43:25,642 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-12-08 12:43:25,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-08 12:43:25,642 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:43:25,643 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-08 12:43:25,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:43:25,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:43:25,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:43:25,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:43:25,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-12-08 12:43:25,699 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-12-08 12:43:25,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-08 12:43:25,699 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:43:25,700 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-08 12:43:25,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:43:25,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:43:25,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:43:25,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:43:25,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-12-08 12:43:25,941 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-12-08 12:43:25,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-08 12:43:25,941 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:43:25,941 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-08 12:43:25,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:43:25,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:43:25,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-08 12:43:25,956 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:43:25,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 21 [2018-12-08 12:43:25,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-12-08 12:43:25,968 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:25,980 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:43:25,983 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:43:25,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2018-12-08 12:43:25,988 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-08 12:43:26,012 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 12:43:26,026 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 12:43:26,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-08 12:43:26,040 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:12, output treesize:44 [2018-12-08 12:43:26,079 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:43:26,080 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:43:26,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-08 12:43:26,081 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:26,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-12-08 12:43:26,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 7 [2018-12-08 12:43:26,098 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:26,101 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:26,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:26,108 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:28, output treesize:23 [2018-12-08 12:43:26,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 31 treesize of output 24 [2018-12-08 12:43:26,155 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:43:26,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2018-12-08 12:43:26,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:26,170 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:26,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:26,184 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:35 [2018-12-08 12:43:26,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 32 [2018-12-08 12:43:26,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 21 [2018-12-08 12:43:26,237 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 12:43:26,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 12:43:26,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 12:43:26,248 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:15 [2018-12-08 12:43:26,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:43:27,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:43:27,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-12-08 12:43:27,259 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-12-08 12:43:27,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-08 12:43:27,259 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:43:27,260 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-08 12:43:27,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:43:27,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:43:27,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-08 12:43:27,295 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:43:27,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 21 [2018-12-08 12:43:27,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-12-08 12:43:27,315 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:27,366 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:43:27,378 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:43:27,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2018-12-08 12:43:27,395 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-08 12:43:27,475 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 12:43:27,563 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 12:43:27,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-08 12:43:27,649 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:43:27,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-12-08 12:43:27,658 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-12-08 12:43:27,685 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 12:43:27,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 6 xjuncts. [2018-12-08 12:43:27,733 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:25, output treesize:143 [2018-12-08 12:43:27,879 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:43:27,883 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:43:27,885 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:43:27,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 44 [2018-12-08 12:43:27,886 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:28,032 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:43:28,033 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:43:28,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 45 [2018-12-08 12:43:28,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:28,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 43 [2018-12-08 12:43:28,171 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:28,272 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:43:28,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 46 treesize of output 49 [2018-12-08 12:43:28,273 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:28,482 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:43:28,485 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:43:28,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2018-12-08 12:43:28,486 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:28,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 36 [2018-12-08 12:43:28,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 7 [2018-12-08 12:43:28,578 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:28,591 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:28,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 34 [2018-12-08 12:43:28,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 12:43:28,600 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:28,613 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:28,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 35 treesize of output 32 [2018-12-08 12:43:28,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 12:43:28,649 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:28,660 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:28,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 30 [2018-12-08 12:43:28,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 12:43:28,665 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:28,673 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:28,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 6 dim-1 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 12:43:28,696 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 9 variables, input treesize:149, output treesize:60 [2018-12-08 12:43:28,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 21 treesize of output 16 [2018-12-08 12:43:28,808 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:43:28,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 16 treesize of output 23 [2018-12-08 12:43:28,813 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:28,824 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:28,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 31 treesize of output 24 [2018-12-08 12:43:28,854 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:43:28,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2018-12-08 12:43:28,855 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:28,866 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:28,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:28,884 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:58, output treesize:44 [2018-12-08 12:43:28,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-08 12:43:28,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 12:43:28,979 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:28,981 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:28,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 36 [2018-12-08 12:43:29,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 25 [2018-12-08 12:43:29,002 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 12:43:29,008 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 12:43:29,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 12:43:29,014 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:60, output treesize:22 [2018-12-08 12:43:29,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:43:29,530 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2018-12-08 12:43:30,078 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-12-08 12:43:31,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:43:31,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-12-08 12:43:31,844 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-12-08 12:43:31,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-08 12:43:31,844 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:43:31,845 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-08 12:43:31,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:43:31,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:43:31,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:43:32,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:43:32,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-12-08 12:43:32,219 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-12-08 12:43:32,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-08 12:43:32,220 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:43:32,220 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-08 12:43:32,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:43:32,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:43:32,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:43:33,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:43:33,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-12-08 12:43:33,629 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-12-08 12:43:33,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-08 12:43:33,629 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:43:33,630 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-08 12:43:33,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:43:33,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:43:33,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-08 12:43:33,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-08 12:43:33,647 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:33,648 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:33,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:33,649 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-12-08 12:43:33,743 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-08 12:43:33,743 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:33,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 12:43:33,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 7 [2018-12-08 12:43:33,756 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:33,758 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:33,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:33,764 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:22, output treesize:14 [2018-12-08 12:43:33,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 22 treesize of output 17 [2018-12-08 12:43:33,879 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:43:33,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-12-08 12:43:33,882 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:33,889 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:33,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:33,897 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-12-08 12:43:34,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2018-12-08 12:43:34,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2018-12-08 12:43:34,183 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:34,190 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:34,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:34,196 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:20 [2018-12-08 12:43:34,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2018-12-08 12:43:34,202 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:43:34,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-12-08 12:43:34,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:34,206 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:34,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:34,208 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:5 [2018-12-08 12:43:34,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:43:36,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:43:36,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-12-08 12:43:36,625 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-12-08 12:43:36,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-08 12:43:36,626 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:43:36,626 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-08 12:43:36,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:43:36,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:43:36,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-08 12:43:36,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-08 12:43:36,646 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:36,647 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:36,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:36,648 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-12-08 12:43:36,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-08 12:43:36,652 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:36,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 12:43:36,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 7 [2018-12-08 12:43:36,671 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:36,673 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:36,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:36,686 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:25, output treesize:17 [2018-12-08 12:43:36,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 13 treesize of output 10 [2018-12-08 12:43:36,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-08 12:43:36,836 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:36,839 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:36,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 22 treesize of output 17 [2018-12-08 12:43:36,864 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:43:36,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-12-08 12:43:36,867 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:36,878 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:36,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:36,892 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:42, output treesize:31 [2018-12-08 12:43:37,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 72 [2018-12-08 12:43:37,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2018-12-08 12:43:37,289 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:37,302 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:37,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2018-12-08 12:43:37,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2018-12-08 12:43:37,330 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:37,336 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:37,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:37,344 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:85, output treesize:31 [2018-12-08 12:43:37,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-08 12:43:37,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-12-08 12:43:37,350 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:37,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:37,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-12-08 12:43:37,369 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:43:37,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2018-12-08 12:43:37,371 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:37,374 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:37,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:37,377 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:49, output treesize:11 [2018-12-08 12:43:37,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:43:42,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:43:42,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-12-08 12:43:42,285 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-12-08 12:43:42,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-08 12:43:42,286 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:43:42,286 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-08 12:43:42,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:43:42,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:43:42,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:43:48,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:43:48,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-12-08 12:43:48,973 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-12-08 12:43:48,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-08 12:43:48,973 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:43:48,974 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-08 12:43:48,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:43:48,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:43:50,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:43:59,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:43:59,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-12-08 12:43:59,984 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-12-08 12:43:59,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-08 12:43:59,984 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:43:59,985 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-08 12:43:59,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:43:59,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:44:01,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:44:01,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:44:01,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-12-08 12:44:01,023 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-12-08 12:44:01,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-08 12:44:01,024 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:44:01,024 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-08 12:44:01,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:44:01,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:44:01,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:44:01,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:44:01,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-12-08 12:44:01,532 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-12-08 12:44:01,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-08 12:44:01,532 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:44:01,533 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-08 12:44:01,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:44:01,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:44:01,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-08 12:44:01,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-08 12:44:01,561 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:44:01,563 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:44:01,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:44:01,568 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:11 [2018-12-08 12:44:01,850 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:44:01,851 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:44:01,851 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-08 12:44:01,852 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 12:44:01,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 12:44:01,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 7 [2018-12-08 12:44:01,869 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 12:44:01,872 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:44:01,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:44:01,882 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-12-08 12:44:02,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-12-08 12:44:02,180 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:44:02,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-12-08 12:44:02,184 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:44:02,195 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:44:02,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:44:02,209 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:25 [2018-12-08 12:44:02,892 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:44:02,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 62 [2018-12-08 12:44:02,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2018-12-08 12:44:02,910 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:44:02,922 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:44:02,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:44:02,934 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:34 [2018-12-08 12:44:03,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 55 [2018-12-08 12:44:03,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 [2018-12-08 12:44:03,686 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:44:03,693 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:44:03,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:44:03,700 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:28 [2018-12-08 12:44:04,097 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-12-08 12:44:04,100 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:44:04,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-12-08 12:44:04,102 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:44:04,106 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:44:04,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:44:04,108 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:7 [2018-12-08 12:44:04,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:44:06,439 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2018-12-08 12:44:08,748 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2018-12-08 12:44:15,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:44:15,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-12-08 12:44:15,183 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-12-08 12:44:15,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-08 12:44:15,183 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:44:15,184 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-08 12:44:15,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:44:15,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:44:15,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-08 12:44:15,213 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:44:15,214 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:44:15,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-12-08 12:44:15,214 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:44:15,221 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:44:15,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-12-08 12:44:15,249 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:44:15,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 36 [2018-12-08 12:44:15,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 28 [2018-12-08 12:44:15,266 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-08 12:44:15,295 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:44:15,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 24 [2018-12-08 12:44:15,296 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 12:44:15,317 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 12:44:15,338 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 12:44:15,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 12:44:15,365 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:42, output treesize:102 [2018-12-08 12:44:15,836 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:44:15,838 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:44:15,841 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:44:15,844 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:44:15,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 88 [2018-12-08 12:44:15,845 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 12:44:16,175 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:44:16,177 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:44:16,178 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:44:16,180 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:44:16,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 58 [2018-12-08 12:44:16,181 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:44:16,489 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:44:16,491 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:44:16,494 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:44:16,502 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:44:16,504 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:44:16,506 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:44:16,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 67 [2018-12-08 12:44:16,507 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 12:44:16,784 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:44:16,786 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:44:16,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 70 [2018-12-08 12:44:16,787 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 12:44:17,064 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:44:17,067 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:44:17,070 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:44:17,072 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:44:17,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 59 [2018-12-08 12:44:17,073 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 12:44:17,317 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:44:17,319 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:44:17,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 70 [2018-12-08 12:44:17,320 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 12:44:17,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 50 treesize of output 47 [2018-12-08 12:44:17,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 12:44:17,492 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 12:44:17,519 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:44:17,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 50 treesize of output 47 [2018-12-08 12:44:17,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 12:44:17,529 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 12:44:17,547 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:44:17,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 46 treesize of output 43 [2018-12-08 12:44:17,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 7 [2018-12-08 12:44:17,630 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-08 12:44:17,647 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:44:17,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 46 treesize of output 43 [2018-12-08 12:44:17,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 12:44:17,653 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-08 12:44:17,667 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:44:17,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 6 dim-1 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 12:44:17,704 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 9 variables, input treesize:216, output treesize:86 [2018-12-08 12:44:18,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-12-08 12:44:18,226 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:44:18,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 16 treesize of output 23 [2018-12-08 12:44:18,230 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:44:18,244 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:44:18,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2018-12-08 12:44:18,288 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:44:18,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-12-08 12:44:18,289 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 12:44:18,299 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:44:18,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:44:18,327 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:71, output treesize:57 [2018-12-08 12:44:19,308 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:44:19,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 131 [2018-12-08 12:44:19,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 1 [2018-12-08 12:44:19,343 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:44:19,365 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:44:19,405 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:44:19,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 47 [2018-12-08 12:44:19,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 1 [2018-12-08 12:44:19,432 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 12:44:19,438 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:44:19,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:44:19,454 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:162, output treesize:57 [2018-12-08 12:44:19,932 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:44:19,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 107 [2018-12-08 12:44:19,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 [2018-12-08 12:44:19,952 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:44:19,969 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:44:19,995 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:44:20,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 42 [2018-12-08 12:44:20,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 [2018-12-08 12:44:20,012 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 12:44:20,017 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:44:20,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:44:20,029 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:115, output treesize:49 [2018-12-08 12:44:20,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-08 12:44:20,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 12:44:20,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:44:20,598 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:44:20,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 32 [2018-12-08 12:44:20,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 21 [2018-12-08 12:44:20,617 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 12:44:20,625 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 12:44:20,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 12:44:20,633 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:61, output treesize:23 [2018-12-08 12:44:21,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:44:26,560 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2018-12-08 12:44:38,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:44:38,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-12-08 12:44:38,000 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-12-08 12:44:38,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-08 12:44:38,000 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:44:38,001 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-08 12:44:38,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:44:38,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:44:38,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-08 12:44:38,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-08 12:44:38,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:44:38,035 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:44:38,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:44:38,042 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-12-08 12:44:38,434 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:44:38,435 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:44:38,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-08 12:44:38,436 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 12:44:38,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 12:44:38,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 7 [2018-12-08 12:44:38,457 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 12:44:38,459 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:44:38,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:44:38,470 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:38, output treesize:22 [2018-12-08 12:44:38,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-12-08 12:44:38,890 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:44:38,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-12-08 12:44:38,892 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:44:38,898 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:44:38,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:44:38,910 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:28 [2018-12-08 12:44:39,830 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:44:39,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 53 [2018-12-08 12:44:39,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2018-12-08 12:44:39,849 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:44:39,854 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:44:39,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:44:39,863 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:28 [2018-12-08 12:44:40,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 57 [2018-12-08 12:44:40,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 [2018-12-08 12:44:40,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:44:40,357 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:44:40,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:44:40,366 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:66, output treesize:33 [2018-12-08 12:44:41,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2018-12-08 12:44:41,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-12-08 12:44:41,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:44:41,310 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:44:41,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:44:41,313 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:5 [2018-12-08 12:44:41,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:44:50,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:44:50,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-12-08 12:44:50,792 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-12-08 12:44:50,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-08 12:44:50,792 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:44:50,793 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-08 12:44:50,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:44:50,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:44:50,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-08 12:44:50,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-08 12:44:50,831 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:44:50,832 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:44:50,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:44:50,839 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-12-08 12:44:50,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-08 12:44:50,843 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 12:44:50,867 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:44:50,868 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:44:50,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-08 12:44:50,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:44:50,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 12:44:50,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 7 [2018-12-08 12:44:50,892 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 12:44:50,894 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:44:50,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:44:50,909 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:30 [2018-12-08 12:44:51,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-12-08 12:44:51,390 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:44:51,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-12-08 12:44:51,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:44:51,400 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:44:51,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-08 12:44:51,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-08 12:44:51,429 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 12:44:51,431 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:44:51,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:44:51,447 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:60, output treesize:50 [2018-12-08 12:44:52,541 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:44:52,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 93 [2018-12-08 12:44:52,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2018-12-08 12:44:52,566 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:44:52,589 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:44:52,625 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:44:52,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2018-12-08 12:44:52,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2018-12-08 12:44:52,635 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 12:44:52,640 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:44:52,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:44:52,654 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:104, output treesize:50 [2018-12-08 12:44:53,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 133 [2018-12-08 12:44:53,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 1 [2018-12-08 12:44:53,225 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:44:53,237 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:44:53,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 56 [2018-12-08 12:44:53,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 1 [2018-12-08 12:44:53,274 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 12:44:53,279 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:44:53,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:44:53,290 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:177, output treesize:42 [2018-12-08 12:44:54,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-08 12:44:54,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 12:44:54,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:44:54,561 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:44:54,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2018-12-08 12:44:54,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2018-12-08 12:44:54,572 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 12:44:54,576 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:44:54,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:44:54,581 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:49, output treesize:11 [2018-12-08 12:44:54,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:45:02,803 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2018-12-08 12:45:08,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:45:08,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-12-08 12:45:08,524 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-12-08 12:45:08,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-08 12:45:08,525 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:45:08,525 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-08 12:45:08,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:45:08,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:45:08,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:45:11,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:45:11,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 30 states and 31 transitions. [2018-12-08 12:45:11,988 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-12-08 12:45:11,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-08 12:45:11,988 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:45:11,989 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-08 12:45:12,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:45:12,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:45:12,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:45:22,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:45:22,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 31 states and 32 transitions. [2018-12-08 12:45:22,329 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-12-08 12:45:22,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-08 12:45:22,329 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:45:22,330 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-08 12:45:22,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:45:22,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:45:22,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-08 12:45:22,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-08 12:45:22,364 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:45:22,366 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:45:22,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:45:22,373 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-12-08 12:45:22,909 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:45:22,911 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:45:22,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-08 12:45:22,912 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 12:45:22,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 12:45:22,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 12:45:22,949 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 12:45:22,952 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:45:22,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 12:45:22,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 7 [2018-12-08 12:45:22,973 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 12:45:22,976 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:45:22,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:45:22,988 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:43, output treesize:26 [2018-12-08 12:45:23,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-12-08 12:45:23,541 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:45:23,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 16 treesize of output 23 [2018-12-08 12:45:23,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:45:23,555 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:45:23,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-12-08 12:45:23,596 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:45:23,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-12-08 12:45:23,599 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 12:45:23,608 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:45:23,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:45:23,629 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:52, output treesize:32 [2018-12-08 12:45:24,870 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:45:24,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2018-12-08 12:45:24,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2018-12-08 12:45:24,889 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:45:24,898 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:45:24,926 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:45:24,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 53 [2018-12-08 12:45:24,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2018-12-08 12:45:24,948 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 12:45:24,958 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:45:24,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:45:24,971 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:86, output treesize:32 [2018-12-08 12:45:24,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-12-08 12:45:24,977 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:45:24,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-12-08 12:45:24,979 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:45:24,982 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:45:24,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:45:24,988 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:12 [2018-12-08 12:45:25,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-12-08 12:45:25,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-12-08 12:45:25,497 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:45:25,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:45:25,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:45:25,504 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:7 [2018-12-08 12:45:25,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-08 12:45:25,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 12:45:25,981 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:45:25,982 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:45:25,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:45:25,983 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-12-08 12:45:26,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:45:35,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:45:35,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 30 states and 31 transitions. [2018-12-08 12:45:35,219 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-12-08 12:45:35,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-08 12:45:35,219 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:45:35,220 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-08 12:45:35,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:45:35,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:45:35,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:45:35,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:45:35,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 29 states and 30 transitions. [2018-12-08 12:45:35,262 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-12-08 12:45:35,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-08 12:45:35,262 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:45:35,263 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-08 12:45:35,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:45:35,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:45:36,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:45:36,819 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2018-12-08 12:45:38,369 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2018-12-08 12:45:52,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:45:52,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 31 states and 32 transitions. [2018-12-08 12:45:52,688 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-12-08 12:45:52,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-08 12:45:52,688 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:45:52,688 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-08 12:45:52,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:45:52,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:45:52,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:46:00,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:46:00,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 30 states and 31 transitions. [2018-12-08 12:46:00,136 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-12-08 12:46:00,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-08 12:46:00,136 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:46:00,137 ERROR L617 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-12-08 12:46:00,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:46:01,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:46:02,001 WARN L497 CodeCheckObserver]: This program is UNSAFE, Check terminated with 27 iterations. [2018-12-08 12:46:02,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 08.12 12:46:02 ImpRootNode [2018-12-08 12:46:02,026 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-12-08 12:46:02,026 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 12:46:02,026 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 12:46:02,026 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 12:46:02,027 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 12:43:24" (3/4) ... [2018-12-08 12:46:02,029 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-08 12:46:02,029 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 12:46:02,029 INFO L168 Benchmark]: Toolchain (without parser) took 157874.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 189.8 MB). Free memory was 939.4 MB in the beginning and 900.1 MB in the end (delta: 39.3 MB). Peak memory consumption was 229.0 MB. Max. memory is 11.5 GB. [2018-12-08 12:46:02,030 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 12:46:02,030 INFO L168 Benchmark]: CACSL2BoogieTranslator took 233.25 ms. Allocated memory is still 1.0 GB. Free memory was 939.4 MB in the beginning and 917.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-12-08 12:46:02,030 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 917.9 MB in the beginning and 1.1 GB in the end (delta: -205.2 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. [2018-12-08 12:46:02,030 INFO L168 Benchmark]: Boogie Preprocessor took 15.24 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 12:46:02,030 INFO L168 Benchmark]: RCFGBuilder took 374.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.8 MB). Peak memory consumption was 39.8 MB. Max. memory is 11.5 GB. [2018-12-08 12:46:02,031 INFO L168 Benchmark]: CodeCheck took 157186.06 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 54.5 MB). Free memory was 1.1 GB in the beginning and 900.1 MB in the end (delta: 183.2 MB). Peak memory consumption was 237.7 MB. Max. memory is 11.5 GB. [2018-12-08 12:46:02,031 INFO L168 Benchmark]: Witness Printer took 2.73 ms. Allocated memory is still 1.2 GB. Free memory is still 900.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 12:46:02,032 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 58 locations, 29 error locations. UNSAFE Result, 157.1s OverallTime, 27 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 352 SDtfs, 13153808 SDslu, 440 SDs, 0 SdLazy, 636202002 SolverSat, 246895806 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 26.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1955 GetRequests, 1504 SyntacticMatches, 45 SemanticMatches, 406 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69997 ImplicationChecksByTransitivity, 146.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 29.3s InterpolantComputationTime, 226 NumberOfCodeBlocks, 226 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 185 ConstructedInterpolants, 9 QuantifiedInterpolants, 23295 SizeOfPredicates, 141 NumberOfNonLiveVariables, 1630 ConjunctsInSsa, 279 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - UnprovableResult [Line: 641]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 641. Possible FailurePath: [L642] TData data; [L625] pdata->lo = (int *)malloc(sizeof(int)) [L626] pdata->hi = (int *)malloc(sizeof(int)) [L627] EXPR pdata->lo [L627] *(pdata->lo) = 4 [L628] EXPR pdata->hi [L628] *(pdata->hi) = 8 [L632] EXPR data->lo [L632] int *lo = data->lo; [L633] EXPR data->hi [L633] int *hi = data->hi; [L634] EXPR \read(*lo) [L634] EXPR \read(*hi) [L634] COND FALSE !(*lo >= *hi) [L638] data->lo = ((void *)0) [L639] data->hi = ((void *)0) [L645] return 0; [L645] return 0; * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 233.25 ms. Allocated memory is still 1.0 GB. Free memory was 939.4 MB in the beginning and 917.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 60.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 917.9 MB in the beginning and 1.1 GB in the end (delta: -205.2 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.24 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 374.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.8 MB). Peak memory consumption was 39.8 MB. Max. memory is 11.5 GB. * CodeCheck took 157186.06 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 54.5 MB). Free memory was 1.1 GB in the beginning and 900.1 MB in the end (delta: 183.2 MB). Peak memory consumption was 237.7 MB. Max. memory is 11.5 GB. * Witness Printer took 2.73 ms. Allocated memory is still 1.2 GB. Free memory is still 900.1 MB. There was no memory consumed. Max. memory is 11.5 GB. RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...